ACM Home Page
Please provide us with feedback. Feedback
Specifying non-blocking shared memories (extended abstract)
Full text PdfPdf (1.29 MB)
Source ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures table of contents
San Diego, California, United States
Pages: 306 - 315  
Year of Publication: 1992
ISBN:0-89791-483-X
Authors
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): 17,   Citation Count: 11
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/140901.141895
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.

 
ABHN91
M. Ahamad, J. E. Burns, P. W. Hutto, and G. Neiger. Causal memory. Technical Report GIT-CC-91/42, Georgia Institute of Technology, September 1991.
ABM92
ACC+90
AF92
AH90a
AH90b
AW91
Buc62
 
CS90
 
DS90
 
GAG+92
K. Gharachorloo, S.V. Adve, A. Gupta, J.L. Hennessy, and M.D. Hill. Programming for different memory consistency models. J. of Parallel and Distributed Systems, 1992. To appear.
GGH92
GHG+91
 
Gib89
 
Gib90
P. B. Gibbons. Cache support for the Asynchronous PRAM. In Prec. 19~h Int. Conf. on Parallel Processing (ICPP), I322-I325, August 1990.
GLL+90
GMG91
 
GM92
P.B. Gibbons and M. Merritt. Specifying nonblocking shared memories. Technical report, AT&:T Bell Laboratories, May 1992. Full version.
 
HA90
P. Hutto and M. Ahamad. Slow memory: Weakening consistency to enhance concurrency in distributed memories. In Prec. l Oth Int. Conf. on Distributed Computing Systems, 302- 309. IEEE Computer Society Press, 1990.
Her91
HW90
 
ISCA91
18th Int. Symp. on Computer Architecture. ACM Press, May 1991.
 
Joh89
 
Lam79
L. Lamport. How to make a multiprocessor that correctly executes multiprocess programs. IEEE Trans. on Computers, C-28:690-691, 1979.
Lis88
LLG+90
 
LS88
R. Lipton and J. Sandberg. PRAM: A scalable shared memory. Technical Report CS-TR-180-88, Princeton University, September 1988.
LT87
 
Lyn88
N. Lynch. I/O automata: A model for discrete event systems. In Prec. 22nd Conf. on Information Science and Systems. Princeton University, March 1988. Also MIT technical report number MIT/LCS/TM-351.
 
MR91
M. Mavronicolas and D. Roth. Bounds on the costs of shared memory implementations. Technical report, Harvard University, Cambridge, Massachusetts, December 1991.
 
NA88
R. S. Nikhil and Arvind. Can dataflow subsume von Neumann computing? Technical Report CSG Memo 292, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts, November 1988.
 
SFC90
P. S. Sindhu, J.-M. Frailong, and M. Cekleov. Formal specification of memory models. Workshop on scalable shared memory multiprocessors, 17th Int. Syrup. on Computer Architec- ~lurv, May 1990.
 
Tom67
R. M. Tomasulo. An efficient hardware algorithm for exploiting multiple arithmetic units. IBM Journal, 11:25-33, 1967.
Val90

CITED BY  11

Collaborative Colleagues:
Phillip B. Gibbons: colleagues
Michael Merritt: colleagues