Combining Funnels: A Dynamic Approach to Software Combining

Journal of Parallel and Distributed Computing

Volumn 60, Issue 11, 2000, Pages 1355-1387

  Shavit, Nir ^a   Zemach, Asaph ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b CRAY INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0142253704     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2000.1621     Document Type: Article

References (33)

1. Agarwal A., Cherian M. Adaptive backoff synchronization techniques. Proceedings of the 16th International Symposium on Computer Architecture. May 1989;. p. 396-406.
2. Agarwal A., Chaiken D., Johnson K., Krantz D., Kubiatowicz J., Kurihara K., Lim B., Maa G., Nussbaum D. The MIT Alewife Machine: A large-scale distributed-memory multiprocessor. Scalable Shared Memory Multiprocessors. 1991;Kluwer Academic, Dordrecht.
3. Anderson T. E. The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Parallel Distrib. Syst. 1:Jan. 1990;6-16.
4. Brewer E. A., Dellarocas C. N. PROTEUS User Documentation. Dec. 1992;MIT, Cambridge.
5. Brewer E. A., Dellarocas C. N., Colbrook A., Weihl W. E. MIT Technical Report. Sept. 1991.
6. Della-Libera G. Reactive Diffracting Trees. 1997;Massachusetts Institute of Technology.
7. Della-Libera G., Shavit N. Reactive diffracting trees. Proceedings of the 9th Annual Symposium on Parallel Algorithms and Architectures (SPAA). June 1997.
8. Gawlick D. Processing 'hot spots' in high performance systems. Proceedings IEEE COMPCON '85. Feb. 1985.
9. Goodman J. R., Vernon M. K., Woest P. J. Efficient synchronization primitives for large-scale cache-coherent multiprocessors. Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS). April 1989;. p. 64-75.
10. Gottlieb A., Grishman R., Kruskal C. P., McAuliffe K. P., Rudolph L., Snir M. The NYU Ultracomputer - Designing an MIMD parallel computer. IEEE Trans. Comput. C. 32:Feb. 1984;175-189.
11. Gottlieb A., Lubachevsky B. D., Rudolph L. Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors. ACM Trans. Program. Languages Syst. 5:April 1983;164-189.
12. Graunke G., Thakkar S. Synchronization algorithms for shared-memory multiprocessors. IEEE Comput. 23:Jun. 1990;60-70.
13. Gupta R., Hill C. R. A scalable implementation of barrier synchronization using an adaptive combining tree. Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS III). 1989;. p. 54-63.
14. Herlihy M. P., Lim B. H., Shavit N. Scalable concurrent counting. ACM Trans. Comput. Syst. 13:1995;343-364.
15. Herlihy M. P., Wing J. M. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Languages Syst. 12:July 1990;463-492.
16. Junt G. C., Michael M. M., Parthasarathy S., Scott M. L. An efficient algorithm for concurrent priority queue heaps. Inform. process. Lett. 60:Nov. 1996;151-157.
17. Karlin A., Li K., Manasse M., Owicki S. Empirical studies of competitive spinning for a shared memory multiprocessor. 13th ACM Symposium on Operating System Principles (SOSP). Oct. 1991;. p. 41-55.
18. Kruskal C. P., Rudolph L., Snir M. Efficient synchronization on multiprocessors with shared memory. Fifth ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing. Aug. 1986.
19. Lim B. H., Agarwal A. Reactive synchronization algorithms for multiprocessors. Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS VI). 1994;. p. 25-35.
20. Lim B. H., Agarwal A. Waiting algorithms for synchronization in large-scale multiprocessors. ACM Trans. Comput. Syst. 11:Aug. 1993;253-294.
21. Lynch N. A., Tuttle M. R. Hierarchical correctness proofs for distributed algorithms. Sixth ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing. Aug. 1987;. p. 137-151.
22. Mellor-Crummey J. M., Scott M. L. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst. 9:Feb. 1991;21-65.
23. Michael M. M., Scott M. L. Technical report. Dec. 1995.
24. Mellor-Crummey J. M., Scott M. L. Contention-free combining tree bariers. Intl. J. Parallel Program. 22:Aug. 1994.
25. Pfister G. H. The IBM research parallel processor prototype (RP3): Introduction and architecture. International Conference on Parallel Processing. 1985.
26. Pfister G. H., Norton A. 'Hot Spot' contention and combining in multistage interconnection networks. IEEE Trans. Comput. C. 34:Nov. 1985;933-938.
27. Shavit N., Touitou D. Elimination trees and the construction of pools and stacks. Proceedings of the 7th Annual Symposium on Parallel Algorithms and Architectures (SPAA). July 1995;. p. 54-63.
28. Shavit N., Upfal E., Zemach A. A steady state analysis of diffracting trees. Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures. June 1996;. p. 33-41.
29. Shavit N., Zemach A. Diffracting trees. ACM Trans. Comput. Syst. 14:Nov. 1996;385-428.
30. Shavit N., Zemach A. Combining funnels: A new twist on an old tale. Proceedings of the 17th Annual ACM Symposium on Principals of Distributed Computing (PODC), Santa Barbara. Aug. 1998;. p. 61-70.
31. Shavit N., Zemach A. Scalable concurrent priority queue algorithms. Proceedings of the 18th Annual ACM symposium on Principals of Distributed Computing (PODC), Atlanta. May 1999;. p. 113-122.
32. Wattenhofer R., Widmayer P. The counting pyramid: An adaptive distributed counting scheme. Proceedings of the 5th International Colloquium on Structural Information and Communication Complexity. 1998.
33. Yew P. C., Tzeng N. F., Lawrie D. H. Distributing Hot-Spot addressing in large-scale multiprocessors. IEEE Trans. Comput. C. 36:Apr. 1987;388-395.