ACM Home Page
Please provide us with feedback. Feedback
Architectural primitives for a scalable shared memory multiprocessor
Full text PdfPdf (1.27 MB)
Source ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the third annual ACM symposium on Parallel algorithms and architectures table of contents
Hilton Head, South Carolina, United States
Pages: 103 - 114  
Year of Publication: 1991
ISBN:0-89791-438-4
Authors
Joonwon Lee  College of Computing, Georgia Institute of Technology, Atlanta, Georgia
Umakishore Ramachandran  College of Computing, Georgia Institute of Technology, Atlanta, Georgia
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): 3,   Downloads (12 Months): 29,   Citation Count: 1
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/113379.113389
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
2
 
3
 
4
K. Charachorloo, D. Lenoski, J. Laudon, and A. Gupta. Memory consistency and event ordering in scalable shared-memory multiprocessors. Technical Report CSL-TR-89-405, Stanford University, Computer Systems Laboratory, Nov. 1989.
5
 
6
R. Cytron, S. Marlovsky, and K. P. McAuliffe. Automatic management of programmable caches. In Proceedings of the 1988 International Conference on Parallel Processing, pages 229-238, 1988.
7
8
9
 
10
J. R. Goodman, M. K. Vernon, and P. J. Woest. Efficient synchronization primitives for large-scale cache-coherent multiprocessor. Technical Report TR-814, Univ. of Wisconsin at Madison, Jan. 1989.
11
 
12
L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C- 28(9):690-691, September 1979.
13
 
14
 
15
Joonwon Lee and Umakishore Ramachandran. Architectural primitives for a scalable shared memory multiprocessor. Technical Report GIT-CC-91/10, College of Computing, Georgia Institute of Technology, 1991.
 
16
K. Li and R. Schaefer. Shiva: An operation system transforming a hypercube into a shared-memory machine. Technical Report 217-89, Computer Science Dept., Princeton University, 1989.
 
17
E. McCreight. The Dragon Computer System: An early overview. Xerox Corp., Sept. 1984.
 
18
G. F. Pfister and V. A. Norton. Hotspot contention and combining in multistage interconnection network. IEEE Transactions on Computers, C-34(10), Oct. 1985.
 
19
20
21
22
23
 
24
25
 
26
Josep Torrellas and John Hennessy. Estimating the performance advantages of relaxing consistency in a shared memory multiprocessor. In Proceedings of the 1990 International Conference on Parallel Processing, pages I:26-33, 1990.


Collaborative Colleagues:
Joonwon Lee: colleagues
Umakishore Ramachandran: colleagues