Maurice Herlihy
Beng-Hong Lim
Nir Shavit
- 1.A. AgarwaI and M. Cherian. Adaptive BackoffSynchronization Techniques. In Proceeding8 of the 15th Internatzonal Symposium on Computer Architecture, June 1989. Google Scholar
Digital Library
- 2.A. Agarwal et al. The MIT Alewife Machine: A Large-Scale Distributed-Memory Multiprocessor. In Proceedings of Workshop on Scalable Shared Memory Multiprocessors. Kluwer Academic Publishers, 1991. An extended version of this paper has been submitted for publication, and appears as MIT/LCS Memo TM-454, 1991. Google ScholarDigital Library
- 3.E. Aharonson and H. Attiya. Counting Network with Arbitrary Fan-Out. In 3rd Symposium on Discrete Algorithms, pages 104-113. ACM-SIAM, January 1992. Google ScholarDigital Library
- 4.T.E. Anderson. The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 1(1):6-16, January 1990. Google ScholarDigital Library
- 5.$. Aspnes, M.P. Herlihy, and N. Shavit. Counting Networks and Multi-Processor Coordination. in Proceedings of the 23rd Annual Symposium on Theory of Computing, May 1991. Google ScholarDigital Library
- 6.K.E. Batcher. Sorting Networks and their Applications. In Proceedings of A FIPS Joint Computer Conference, pages 338-334, 1968.Google ScholarDigital Library
- 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.Google Scholar
- 8.T.H. Cormen, C.E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge MA, 1990. Google ScholarDigital Library
- 9.J.R. Goodman, M.K. Vernon, and P.J. Woest. Efficient Synchronization Primitives for Large-Scale Cache-Coherent multiprocessors. In Proceedings of the 3rd ASPLOS, pages 64-75. ACM, April 1989. Google ScholarDigital Library
- 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.Google ScholarDigital Library
- 11.A. Gottlieb, B.D. Lubachevsky, and L. Rudolph. Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors. A CM Transactions on Programming Languages and Systems, 5(2):164-189, April 1983. Google ScholarDigital Library
- 12.G. Graunke and S. Thakkar. Synchronization Algorithms for Shared-Memory Multiprocessors. IEEE Computer, 23(6):60-70, June 1990. Google ScholarDigital Library
- 13.M.P. Herlihy. Wait-Free Synchronization. A CM Transactions on Programming Languages and Systems, 13(I):123-149, January 1991. Google ScholarDigital Library
- 14.M.P. Herlihy, N. Shavit, and O. Waarts. Low Contention Linearizable Counting. In Proceedings of the A CM Symposium on Foundations of Computer Science. ACM, October 1991. Google ScholarDigital Library
- 15.H.F. Jordan. Performance measurements on HEP - a pipelined MIMD computer. In Proceedings of the lOth annual Symposium on Computer Architecture, pages 202-212, June 1983. Google ScholarDigital Library
- 16.M. Klugerman and C.G. Plaxton. Small-depth Counting Networks. To appear, 1992 ACM Symposium on the Theory of Computing. Google ScholarDigital Library
- 17.J.M. Mellor-Crummey and M.L. Scott. Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. Technical Report 342, University of Rochester, Rochester, NY 14627, April 1990. Google ScholarDigital Library
- 18.L. Rudolph. Decentralized Cache Scheme for an MIMD Parallel Processor. In 11th Annual Computing Architecture Conference, pages 340-347, 1983. Google ScholarDigital Library
- 19.L. Rudolph, M. Slivkin, and E. Upfal. A Simple Load Balancing Scheme for Task Allocation in Parallel Machines. In Proceedings of ~he 3rd A CM Symposium on Parallel Algorithms and Architectures, pages 237-245, July 1991. Google ScholarDigital Library
- 20.P.C Yew, N.F. Tzeng, and D.H. Lawrie. Distributing Hot-Spot Addressing in Large-Scale Multiprocessors. IEEE Transactions on Computers, pages 388-395, April 1987. Google ScholarDigital Library
Index Terms
- Low contention load balancing on large-scale multiprocessors
Recommendations
An Efficient Dynamic Load-Balancing Large Scale Graph-Processing System
ICNCC '18: Proceedings of the 2018 VII International Conference on Network, Communication and ComputingSince the introduction of pregel by Google, several large-scale graph-processing systems have been introduced. These systems are based on the bulk synchronous parallel model or other similar models and use various strategies to optimize system ...
Comments