Giovanni Della-Libera
Nir Shavit
- 1.A. Agarwal, D. Chaiken, K. Johnson, D. Krantz, J. Kubiatowicz, K. Kurihara, B. Lim, G. Maa, and D. Nussbaum. 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. Also, appears as MIT Technical Report MIT/LCS/TM-454, June 1991. Google Scholar
Digital Library
- 2.A. Agarwal and M. Cherian. Adaptive backoff synchronization techniques. In Proceedings of the 16th International Symposium on Computer Architecture, pages 396--406, May 1989. Google ScholarDigital Library
- 3.T. 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
- 4.J. Aspnes, M. P. Herlihy, and N. Shavit. Counting networks. Journal of the ACM, 41(5):1020-1048, September 1994. Earlier version in Proceedings of the 23rd ACM Annual Symposium on Theory of Computing, pp. 348-358, May 1991. Also, MIT Technical Report MIT/LCS/TM-451, June 1991. Google ScholarDigital Library
- 5.E.A. Brewer,, and C. N. Dellarocas. Proteus user documentation, version 4.0, March 1992.Google Scholar
- 6.E. A. Brewer, C. N: Dellarocas, A. Colbrook, and W. E. Weihl. Proteus: a high-performance parallel-architecture simulator. Technical Report MIT/LCS/TR-516, MIT Laboratory for Computer Science, September 1991. Google ScholarDigital Library
- 7.D. Chaiken, J. Kubiatowicz, and A. Agarwal. LimitLESS directories: A scalable cache coherence scheme. In aspIoslV, pages 224-234, Santa Clara, California, 1991. Google ScholarDigital Library
- 8.Giovanni Della-Libera. Dynamic diffracting trees. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, July 1996.Google Scholar
- 9.J. R. Goodman, M. K. Vernon, and P. J. Woest. Efficent synchronization primitives for large-scale cache-coherent multiprocessors. In Proceedings of the 3rd International Conference on Architectural Support for Programming Languages and Operating Systems, pages 64-75, Boston, Massachusetts, April 1989. Google ScholarDigital Library
- 10.G. Graunke and S. Thakkar. Synchronization algorithms for shared-memory multiprocessors. IEEE Computer, 23(6):60-70, June 1990. Google ScholarDigital Library
- 11.B. Lira. Reactive Synchronization Algorithms for Multiprocessors. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technolgy, February 1995.Google Scholar
- 12.B. Lim and A. Agarwal. Reactive synchronization algorithms for multiprocessors. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS VI),, pages 25-35, October I994. Google ScholarDigital Library
- 13.J.M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. A CM Transactions on Computer Systems, TOCS, 9(1 ):21-65, February 1991. Earlier version published as TR 342, University of Rochester, Computer Science Department, April 1990, and COMP TR90- 114, Center for Research on Parallel Computation, Rice UNIV, May 1990. Google ScholarDigital Library
- 14.L. Rudolph and Z. Segall. Dynamic decentralized cache schemes for MIMD parallel processors. In Proceedings of the 11th Annual Symposium on Computer Architecture, pages 340-347, June 1984. Google ScholarDigital Library
- 15.L. Rudolph, M. Slivkin, and E. Upfal. A simple load balancing scheme for task allocation in parallel machines. In Proceedings of the 3rd ACM Symposium on Parallel Algorithms and Architectures, pages 237-245, July 1991. Google ScholarDigital Library
- 16.N. Shavit and D. Touitou. Elimination trees and the construction of pools and stacks. In SPAA '95: 7thAnnual ACM Symposium on Parallel Algorithms and Architectures, pages 54--63, Santa Barbara, California, July 1995. Also, Tel-Aviv University Technical Report, January 1995. Google ScholarDigital Library
- 17.N. Shavit, E. Upfal, and A. Zemach. A steady state analysis of diffracting trees. In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 33-41, Padua, Italy, June 1996. Google ScholarDigital Library
- 18.N. Shavit and A. Zemach. Diffracting trees. In Proceedings of the Sixth Annual Symposium on Parallel Algorithms and Architectures (SPAA), pages 167-176, Cape May, New Jersey, June 1994. Also in ACM Transactions on Computer Systems, November 1996. Google ScholarDigital Library
- 19.P. C Yew, N. E 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
- Reactive diffracting trees
Recommendations
Diffracting trees
Shared counters are among the most basic coordination structures in multiprocessor conputation, with applications ranging from barrier synchronization to concurrent-data-structure design. This article introduces diffracting trees, novel data structures ...
Self-tuning reactive diffracting trees
Reactive diffracting trees are efficient distributed objects that support synchronization, by distributing sets of memory accesses to different memory banks in a coordinated manner. They adjust their size in order to retain their efficiency in the ...
Diffracting trees (preliminary version)
SPAA '94: Proceedings of the sixth annual ACM symposium on Parallel algorithms and architecturesShared counters are among the most basic coordination structures in multiprocessor computation, with applications ranging from barrier synchronization to dynamic load balancing. Introduced in this paper are diffracting trees, novel distributed-parallel ...
Comments