The round complexity of distributed sorting: Extended abstract

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2011, Pages 249-255

  Patt Shamir, Boaz ^a   Teplitsky, Marat ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

communication complexity; congest model; distributed sorting; network algorithms

Indexed keywords

COMMUNICATION COMPLEXITY; COMPLEXITY BOUNDS; CONGEST MODEL; DISTRIBUTED SORTING; EXTENDED ABSTRACTS; FULLY CONNECTED NETWORKS; HIGH PROBABILITY; NETWORK ALGORITHMS; ROUND COMPLEXITY; SPANNING TREE;

ALGORITHMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 79959860533     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993806.1993851     Document Type: Conference Paper

References (21)

1. Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, and Lars Rasmussen. Parallel randomized load balancing. In Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, STOC '95, pages 238-247, New York, NY, USA, 1995. ACM.
2. M. Ajtai, J. Komlós, and E. Szemerédi. An O(n log n) sorting network. In Proc. 15th Ann. ACM Symp. on Theory of Computing (STOC), pages 1-9. ACM Press, May 1983.
3. K. E. Batcher. Sorting networks and their applications. In Proc. 1968 Spring Joint Computer Conference, pages 307-314, Reston, VA, 1968. AFIPS Press.
4. V. Chvátal. Lecture notes on the new AKS sorting network. Technical Report DCS-TR-294, Computer Science Department, Rutgers University, 1992.
5. Richard Cole. Parallel merge sort. In Proc. 27th Ann. Symp. on Foundations of Computer Science, pages 511-516, October 1986.
6. David E. Culler, Richard M. Karp, David Patterson, Abhijit Sahay, Eunice E. Santos, Klaus Erik Schauser, Ramesh Subramonian, and Thorsten von Eicken. LogP: A practical model of parallel computation. Comm. ACM, 39:78-85, November 1996.
7. Devdatt Dubhashi and Desh Ranjan. Balls and bins: a study in negative dependence. Random Struct. Algorithms, 13:99-124, September 1998.
8. Micheal Elkin. An unconditional lower bound on the time-approximation tradeoff for the minimum spanning tree problem. SIAM Journal on Computing, 36(2):463-501, 2006.
9. Michael T. Goodrich. Communication-efficient parallel sorting (preliminary version). In Proc. 28th Ann. ACM Symp. on Theory of Computing (STOC), pages 247-256, New York, NY, USA, 1996. ACM.
10. Alex Kipnis and Boaz Patt-Shamir. A note on distributed stable matching. In Proc. 29th International Conf. on Distributed Computing Systems (ICDCS), June 2009.
11. Donald E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, 2nd edition, 1998.
12. Christoph Lenzen and Roger Wattenhofer. Brief announcement: Exponential speed-up of local algorithms using non-local communication. In Proc. 29th ACM Symp. On Principles of Distributed Computing (PODC), pages 295-296, 2010.
13. Christoph Lenzen and Roger Wattenhofer. Tight Bounds for Parallel Randomized Load Balancing. In Proc. 43rd ACM Symposium on Theory of Computing (STOC), 2011. To appear.
14. Zvi Lotker, Boaz Patt-Shamir, Elan Pavlov, and David Peleg. Minimum-weight spanning tree construction in O(log log n) communication rounds. SIAM Journal on Computing, 35(1):120-131, 2005.
15. Zvi Lotker, Boaz Patt-Shamir, and David Peleg. Distributed MST for constant diameter graphs. Distributed Computation, 18(6):453-460, 2006.
16. Colin McDiarmid. On the method of bounded differences. In Surveys in Combinatorics, pages 148-188. Cambridge University Press, Cambridge, UK, 1989.
17. D. Peleg and V. Rubinovich. Near-tight lower bound on the time complexity of distributed MST construction. SIAM Journal on Computing, 30:1427-1442, 2000. (Pubitemid 33099783)
18. David Peleg. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
19. Leslie G. Valiant. Parallelism in comparison problems. SIAM Journal on Computing, 4(3):348-355, 1975.
20. Leslie G. Valiant. A bridging model for parallel computation. Commun. ACM, 33:103-111, August 1990.
21. Leslie G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing (STOC), pages 263-277, Milwaukee, WI, May 1981.