ACM Home Page
Please provide us with feedback. Feedback
Cooperative shared memory: software and hardware for scalable multiprocessors
Full text PdfPdf (1.37 MB)
Source ACM Transactions on Computer Systems (TOCS) archive
Volume 11 ,  Issue 4  (November 1993) table of contents
Pages: 300 - 318  
Year of Publication: 1993
ISSN:0734-2071
Authors
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 23,   Citation Count: 32
Additional Information:

abstract   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/161541.161544
What is a DOI?

ABSTRACT

We believe the paucity of massively parallel, shared-memory machines follows from the lack of a shared-memory programming performance model that can inform programmers of the cost of operations (so they can avoid expensive ones) and can tell hardware designers which cases are common (so they can build simple hardware to optimize them). Cooperative shared memory, our approach to shared-memory design, addresses this problem. Our initial implementation of cooperative shared memory uses a simple programming model, called Check-In/Check-Out (CICO), in conjunction with even simpler hardware, called Dir1SW. In CICO, programs bracket uses of shared data with a check_in directive terminating the expected use of the data. A cooperative prefetch directive helps hide communication latency. Dir1SW is a minimal directory protocol that adds little complexity to message-passing hardware, but efficiently supports programs written within the CICO model.


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
2
3
 
4
BAYLUR, S J., MCAULIFFE, K. P., AND RATHI, B, D, 1991. An evaluation of cache coherence protocols for MIN-based multiprocessors In International Symposium on Shared Memory Multiprocessing. 230-241.
 
5
BELL, C G. 1985 Multis A new class of multiprocessor computers. Science 228, 462-466
6
7
 
8
9
10
 
11
 
12
CHERITON, D. R., GOOSEN, H. A., AND MACHANICK, P. 1991b. Restructuring a parallel simulation to improve cache behavior in a shared-memory multiprocessor: A first experience. In International Symposium on Shared Memory Multiprocessing. 109-118.
 
13
CYTRON, R., KARLOVSKV, S., AND MCAULIFFE, K. P. 1988. Automatic management of programmable caches. In Proceedings of the 1988 International Conference on Parallel Processing (Vol. II Software). Penn State University, 229-238.
14
15
 
16
 
17
GUSTAVSON, D. B., AND JAMES, D. V., Ens. 1991. SCI: Scalable Coherent Interface: Logical, Physical and Cache coherence Specifications. Vol. P1596/D2.00 18 Nov. 91. Draft 2.00 for Recirculation to the Balloting Body. IEEE, New York.
 
18
19
20
21
22
 
23
LARUS, J. R., CHANDRA, S., AND WOOD, D. A. 1993. CICO: A shared-memory programming performance model. In Portability and Performance for Parallel Processing. Wiley, Sussex, England.
 
24
 
25
 
26
LIN, C., AND SNYDER, L. 1990. A comparison of programming models for shared memory multiprocessors. In Proceedings of the 1990 International Conference on Parallel Processing (Vol. H Software). Penn State University, 11-163-170.
27
 
28
MIN, S. L., AND BAER, J.-L. 1989. A timestarnp-based cache coherence scheme. In Proceedings of the 1989 International Conference on Parallel Processing (Vol. I Architecture). Penn State University, I-23-32.
29
30
31
32
 
33

CITED BY  32

Collaborative Colleagues:
Mark D. Hill: colleagues
James R. Larus: colleagues
Steven K. Reinhardt: colleagues
David A. Wood: colleagues