Article

Free access

Distributed elections in an archimedean ring of processors

Author:

Paul M.B. VitányiAuthors Info & Claims

STOC '84: Proceedings of the sixteenth annual ACM symposium on Theory of computing

Pages 542 - 547

https://doi.org/10.1145/800057.808725

Published: 01 December 1984 Publication History

PDF eReader

References

[1]

Burns, J.E., A formal model for message passing systems. Tech. Rep. No. 91, Comp. Sci. Dept., Indiana Univ., May 1980.

Google Scholar

[2]

Chang, E., & R. Roberts, An improved algorithm for decentralized extrema-finding in circular configurations of processes, Communications of the Ass. Comp. Mach. 22 (1979) 281-283.

Digital Library

Google Scholar

[3]

Dixon, R.C., N.G. Strole and J.D. Markov, A token-ring network for local data communications, IBM Systems Journal 22 (1983) 47-62.

Digital Library

Google Scholar

[4]

Dolev, D., M. Klawe and M. Rodeh, An O(n logn) unidirectional distributed algorithm for extremafinding in a circle, Journal of Algorithms 3 (1982) 245-260.

Crossref

Google Scholar

[5]

Franklin, R., On an improved algorithm for decentralized extrema finding in circular configurations of processors, Communications of the Ass. Comp. Mach. 25 (1982) 336-337.

Digital Library

Google Scholar

[6]

Garcia-Molina, H., Elections in a distributed computing system, IEEE Transactions on Computers, vol. C-31,(1982) 48-59.

Google Scholar

[7]

Hirschberg, D.S., & J.B. Sinclair, Decentralized extremafinding in circular configurations of processors, Communications of the Ass. Comp. Mach. 23 (1980) 627-628.

Digital Library

Google Scholar

[8]

Itai, A., and M. Rodeh, Symmetry breaking in a distributed environment. Proceedings 22nd Ann. IEEE Symp. on Foundations of Computer Science, 1981, 150-158.

Google Scholar

[9]

Le Lann, G., Distributed systems - Towards a formal approach. In: 1977 IFIP Congress Proceedings, Information Processing 77, B. Gilchrist Ed., North Holland, Amsterdam, 1977, 155-160.

Google Scholar

[10]

Lamport, L., Time, clocks, and the ordering of events in a distributed system, Communications of the Ass. Comp. Mach. 21 (1978) 558-565.

Digital Library

Google Scholar

[11]

Pachl, J., E. Korach and D. Rotem, A technique for proving lower bounds for distributed maximum-finding algorithms. Proceedings 14th Ann. ACM Symposium on Theory of Computing, 1982, 378-382.

Digital Library

Google Scholar

[12]

Saltzer, J.H., K.T.Pogran and D.D. Clark, Why a ring? Computer Networks 7 (1983) 223-231.

Google Scholar

[13]

Strole, N.C., A local communications network based on interconnected token-access rings: a tutorial, IBM J. Res. Develop. 27 (1983) 481-496.

Digital Library

Google Scholar

[14]

Stuck, B.W., Calculating the maximum mean data rate in Local Area Networks, Computer 16 (1983) 5: 72-76.

Digital Library

Google Scholar

[15]

Tanenbaum, A.S., Computer Networks. Prentice-Hall, Englewood Cliffs, New Jersey, 1981.

Digital Library

Google Scholar

Cited By

View all

Gilbert SRobinson PSourav SNewport CKeidar I(2018)Leader Election in Well-Connected GraphsProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212754(227-236)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212754
Spirakis PTampakas B(2011)Efficient distributed algorithms by using the archimedean time assumptionRAIRO - Theoretical Informatics and Applications10.1051/ita/198923010113123:1(113-128)Online publication date: 8-Jan-2011
https://doi.org/10.1051/ita/1989230101131
EffatParvar MYazdani NEffatParvar MDadlani AKhonsari A(2010)Improved algorithms for leader election in distributed systems2010 2nd International Conference on Computer Engineering and Technology10.1109/ICCET.2010.5485357(V2-6-V2-10)Online publication date: Apr-2010
https://doi.org/10.1109/ICCET.2010.5485357
Show More Cited By

Index Terms

Distributed elections in an archimedean ring of processors

Recommendations

Enabling compiler flow for embedded VLIW DSP processors with distributed register files
LCTES '07: Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems

High-performance and low-power VLIW DSP processors are increasingly deployed on embedded devices to process video and multimedia applications. For reducing power and cost in designs of VLIW DSP processors, distributed register files and multi-bank ...
Enabling compiler flow for embedded VLIW DSP processors with distributed register files
Proceedings of the 2007 LCTES conference

High-performance and low-power VLIW DSP processors are increasingly deployed on embedded devices to process video and multimedia applications. For reducing power and cost in designs of VLIW DSP processors, distributed register files and multi-bank ...
Implicitly-multithreaded processors

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

STOC '84: Proceedings of the sixteenth annual ACM symposium on Theory of computing

December 1984

547 pages

ISBN:0897911334

DOI:10.1145/800057

Chairman:
Richard DeMillo

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 December 1984

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

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

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

32
Total Citations
View Citations
357
Total Downloads

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

Reflects downloads up to 11 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gilbert SRobinson PSourav SNewport CKeidar I(2018)Leader Election in Well-Connected GraphsProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212754(227-236)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212754
Spirakis PTampakas B(2011)Efficient distributed algorithms by using the archimedean time assumptionRAIRO - Theoretical Informatics and Applications10.1051/ita/198923010113123:1(113-128)Online publication date: 8-Jan-2011
https://doi.org/10.1051/ita/1989230101131
EffatParvar MYazdani NEffatParvar MDadlani AKhonsari A(2010)Improved algorithms for leader election in distributed systems2010 2nd International Conference on Computer Engineering and Technology10.1109/ICCET.2010.5485357(V2-6-V2-10)Online publication date: Apr-2010
https://doi.org/10.1109/ICCET.2010.5485357
Hutle MMalkhi DSchmid UZhou L(2009)Chasing the Weakest System Model for Implementing Ω and ConsensusIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2008.246:4(269-281)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1109/TDSC.2008.24
Robinson PSchmid U(2008)The Asynchronous Bounded-Cycle ModelProceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems10.1007/978-3-540-89335-6_20(246-262)Online publication date: 21-Nov-2008
https://dl.acm.org/doi/10.1007/978-3-540-89335-6_20
EffatParvar MEffatparvar MBemana ADehghan M(2007)Determining a Central Controlling Processor with Fault Tolerant Method in Distributed SystemProceedings of the International Conference on Information Technology10.1109/ITNG.2007.75(658-663)Online publication date: 2-Apr-2007
https://dl.acm.org/doi/10.1109/ITNG.2007.75
Merritt MTaubenfeld G(2006)Fairness of shared objectsDistributed Computing10.1007/BFb0056491(303-317)Online publication date: 2-Jun-2006
https://doi.org/10.1007/BFb0056491
Parlati GYung M(2006)Non-exploratory self-stabilization for constant-space symmetry-breakingAlgorithms — ESA '9410.1007/BFb0049408(183-201)Online publication date: 23-Feb-2006
https://doi.org/10.1007/BFb0049408
Reischuk RKoshors M(2005)Lower bounds for synchronous networks and the advantage of local informationDistributed Algorithms10.1007/BFb0019817(374-387)Online publication date: 16-Jun-2005
https://doi.org/10.1007/BFb0019817
Chan MChin F(2005)Optimal resilient ring election algorithmsDistributed Algorithms10.1007/BFb0019815(345-354)Online publication date: 16-Jun-2005
https://doi.org/10.1007/BFb0019815
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

References

Cited By

Index Terms

Recommendations

Enabling compiler flow for embedded VLIW DSP processors with distributed register files

Enabling compiler flow for embedded VLIW DSP processors with distributed register files

Implicitly-multithreaded processors

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations