Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Lazy Caching YEHUDA AFEK
 

Summary: Lazy Caching
YEHUDA AFEK
AT&T Bell Laboratories
GEOFFREY BROWN
Cornell University
AND MICHAEL MERRITT
AT&T Bell Laboratories
This paper examines cache consistency conditions for multiprocessor shared memory systems. It
states and motivates a weaker condition than is normally implemented. An algorithm is presented
that exploits the weaker condition to achieve greater concurrency. The algorithm is shown to
satisfy the weak consistency condition. Other properties of the algorithm and possible extensions
are discussed.
Categories and Subject Discriptors: B.3.2 [Memory Structures]: Design Styles---cache mem­
ories, shared memory; C.1.2 [Processor Architectures]: Multiple Data Stream Architectures
(Multiprocessors)---parallel processors, multiple­instruction­stream, multiple­data­stream processors
(MIMD); D.4.2 [Operating Systems]: Storage Management---distributed memories
General Terms: Shared Memory
Additional Key Words and Phrases: Cache Coherence, Sequential Consistency
1 Introduction
The design of efficient shared memories is arguably the single most important problem in

  

Source: Afek, Yehuda - School of Computer Science, Tel Aviv University

 

Collections: Computer Technologies and Information Sciences