ACM Home Page
Please provide us with feedback. Feedback
A lazy cache algorithm
Full text PdfPdf (1.27 MB)
Source ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the first annual ACM symposium on Parallel algorithms and architectures table of contents
Santa Fe, New Mexico, United States
Pages: 209 - 222  
Year of Publication: 1989
ISBN:0-89791-323-X
Authors
Y. Afek  AT&T Bell Laboratories, & Computer Science Department, Tel-Aviv University
G. Brown  School of Electrical Engineering, Cornell University
M. Merritt  AT&T Bell Laboratories
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 24,   Citation Count: 12
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/72935.72958
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
[Bro88] Geoffrey Brown. Asynchronous multicaches. Submitted for publication to Distributed Computing., 1988.
2
 
3
[Lam79] Leslie Lamport. How to make a multiprocessor that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28:690-691, 1979.
4
 
5
[Lyn88] Nancy A. Lynch. I/O automata: A model for discrete event systems. Technical Report MIT/LCS/TM-351, MIT, March 1988. Also, in 22nd Annual Conference on Information Science and Systems, Princeton University, Princeton, N. J., March 1988.
6
7

CITED BY  12