ACM Home Page
Please provide us with feedback. Feedback
Low contention load balancing on large-scale multiprocessors
Full text PdfPdf (717 KB)
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: 219 - 227  
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): 4,   Downloads (12 Months): 13,   Citation Count: 21
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

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.140924
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
5
 
6
K.E. Batcher. Sorting Networks and their Applications. In Proceedings of A FIPS Joint Computer Conference, pages 338-334, 1968.
 
7
B. Bershad. Practical Considerations for Lock-Free Concurrent Objects. Technical Report CMU-CS- 91-183, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, September 1991.
 
8
9
 
10
A. Gottlieb, R. Grishman, C.P. Kruskal, K.P. McAuliffe, L. Rudolph, and M. Snir. The NYU Ultracomputer- designing an MIMD parallel computer. IEEE Transactions on Compulers, C- 32(2):175-189, February 1984.
11
 
12
13
 
14
15
16
 
17
18
19
 
20

CITED BY  21
 
 

Collaborative Colleagues:
Maurice Herlihy: colleagues
Beng-Hong Lim: colleagues
Nir Shavit: colleagues

Peer to Peer - Readers of this Article have also read: