Article

Free access

Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)

Authors:

Yefim Dinitz,

Shlomo Moran,

Sergio RajsbaumAuthors Info & Claims

STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of Computing

Pages 265 - 274

https://doi.org/10.1145/301250.301314

Published: 01 May 1999 Publication History

PDF eReader

References

[1]

Hagit Attiya and Jennifer ~Velch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-HilI, England, 1998.

Digital Library

Google Scholar

[2]

Hans L. Bodlaender, "New lower bound techniques for distributed leader finding and other problems on rings of processors," Theor. Comput. Sci. 81 (1991), 237- 256.

Digital Library

Google Scholar

[3]

Haas L. Bodlaender, Shlomo Moran, Manfred K. Warmuth, ':The distributed bit complexity of the ring: From the anonymous to the non-anonymous case", Information and Computation 114 (2), pp. 34-50, 1994.

Digital Library

Google Scholar

[4]

James E. Burns, "A formal model for message passing systems," Technical Report TR-91, Computer Science Dept., Indiana University, Bloomington, September 1980.

Google Scholar

[5]

Martin Dietzfelbinger, "The lineax-axray problem in communication complexity resolved," in Proceedings of the ~gth A CM Symposium on Theory of Computing, pages 373-382, 1997.

Digital Library

Google Scholar

[6]

M. Dietzfelbinger, J. Hromkovic, G. Schnitger, "A comparison of two lower-bound methods for communication complexity," Theoretical computer Science 168 (1996), 39-51

Digital Library

Google Scholar

[7]

Pavol Duris and Zvi Galil, "Two lower bounds in asynchronous distributed computation," Journal oj~ Computer and System Sciences, 42(3), pp. 254-266, June 1991.

Digital Library

Google Scholar

[8]

Shimon Even, Graph Algorithms, Computer Science Press, 1979.

Digital Library

Google Scholar

[9]

Robert G. Gallager, Pier A. Humbler, Philip M. Spits, "A distributed algori~hm for minimum-weight spanning trees," A CM Trans. Prog. Lang. Syst., 5(1):66-77, Jan. 1983.

Digital Library

Google Scholar

[10]

Daniel S. Hirschberg, J.B. Sinclair, "Decentralized extrema~finding in circular configurations of processes," Commun. ACM 23 (11), pp. 627-628, 1980.

Digital Library

Google Scholar

[11]

Eyal Kushilevitz, Nathan Lineal, Rafail Ostrovsky, "The linear-array conjecture in communication complexity is false," Proc. of the ~Sth Annual A CM Syrup. Th. Comp. (1996), pp. 1-10.

Digital Library

Google Scholar

[12]

Ephraim Korach, Shlomo Moran, Shmuel Zaks, ':Tight upper and lower bounds for some distributed algorithms for a complete network of processors," Proc. of the 3th A nn~al A CM Syrup. Princ. Dist. Comp. (1984), pp. 199-207.

Digital Library

Google Scholar

[13]

Eyal Kushilevitz, Noam Nisan, Communication CompIezity, Cambridge University Press, 1997.

Digital Library

Google Scholar

[14]

Leslie Lamport, "Time, Clocks, and the Ordering of Events in a Distributed System," Commun. A CM, 21 (7), pp. 558-564, ~978.

Digital Library

Google Scholar

[15]

Nancy A. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers, Inc. 1996.

Digital Library

Google Scholar

[16]

Shlomo Moran, Manfred K. Warmuth, "Gap Theorem in Distributed Computing", SIAM Journal of Computing 22:2 (1993), 379-394.

Digital Library

Google Scholar

[17]

Shlomo Moran, Yaron Wolfsthal, "An extended impossibility result for asynchronous complete networks", Information Processing Letters, 26, pp. 141-151, 1987.

Digital Library

Google Scholar

[18]

Gerard Tel, Introduction to Distributed Algorithms, Cambridge University Press, 1994.

Digital Library

Google Scholar

[19]

Prasoon Tiwaxi, "Lower bounds on communication complexity in distributed computer networks," J. Assoc. CompuL Mach. 34 (1987), 921-938.

Digital Library

Google Scholar

[20]

Andrew C. Yao, ':Some complexity questions related to distributed computing," Proc. of the 11th A CM Syrup. on Theory of Comp. (1979), pp. 209-213.

Digital Library

Google Scholar

Cited By

View all

Dinitz YMoran SRajsbaum S(2008)Bit complexity of breaking and achieving symmetry in chains and ringsJournal of the ACM10.1145/1326554.132655755:1(1-28)Online publication date: 22-Feb-2008
https://dl.acm.org/doi/10.1145/1326554.1326557
Dinitz YSolomon N(2007)Two absolute bounds for distributed bit complexityTheoretical Computer Science10.1016/j.tcs.2007.04.027384:2-3(168-183)Online publication date: 1-Oct-2007
https://dl.acm.org/doi/10.1016/j.tcs.2007.04.027
Dinitz YSolomon N(2005)Two absolute bounds for distributed bit complexityProceedings of the 12th international conference on Structural Information and Communication Complexity10.1007/11429647_11(115-126)Online publication date: 24-May-2005
https://dl.acm.org/doi/10.1007/11429647_11

Index Terms

Recommendations

Bit complexity of breaking and achieving symmetry in chains and rings

We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed but have distinct identities, taken from {0, 1,… ,M − 1}. We investigate the ...
Distributed symmetry-breaking with improved vertex-averaged complexity
ICDCN '19: Proceedings of the 20th International Conference on Distributed Computing and Networking

We study the distributed message-passing model in which a communication network is represented by a graph G = (V, E). Usually, the measure of complexity that is considered in this model is the worst-case complexity, which is the largest number of rounds ...
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction

Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries , causing adverse effects on CSP solvers based on tree search. As a remedy, symmetry breaking constraints are commonly used. While variable ...

Comments

Information & Contributors

Information

Published In

STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of Computing

May 1999

790 pages

ISBN:1581130678

DOI:10.1145/301250

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC99

Sponsor:

SIGACT

STOC99: ACM Symposium on Theory of Computing

May 1 - 4, 1999

Georgia, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
280
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)4

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dinitz YMoran SRajsbaum S(2008)Bit complexity of breaking and achieving symmetry in chains and ringsJournal of the ACM10.1145/1326554.132655755:1(1-28)Online publication date: 22-Feb-2008
https://dl.acm.org/doi/10.1145/1326554.1326557
Dinitz YSolomon N(2007)Two absolute bounds for distributed bit complexityTheoretical Computer Science10.1016/j.tcs.2007.04.027384:2-3(168-183)Online publication date: 1-Oct-2007
https://dl.acm.org/doi/10.1016/j.tcs.2007.04.027
Dinitz YSolomon N(2005)Two absolute bounds for distributed bit complexityProceedings of the 12th international conference on Structural Information and Communication Complexity10.1007/11429647_11(115-126)Online publication date: 24-May-2005
https://dl.acm.org/doi/10.1007/11429647_11

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations