Article

Free access

The ambiguity of choosing

Authors:

J. E. Burns,

G. L. PetersonAuthors Info & Claims

PODC '89: Proceedings of the eighth annual ACM Symposium on Principles of distributed computing

Pages 145 - 157

https://doi.org/10.1145/72981.72991

Published: 01 June 1989 Publication History

PDF eReader

References

[1]

Yehuda Afek, Danny Dolev, Michael Merritt, and Nit Shavit. (Private communication.)

Google Scholar

[2]

Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, and Rfidiger Reischuk. Achievable cases in an asynchronous environment. 28th Syrup. on Foundations of Computer Science, Los Angeles, CA, Oct. 1987, pp. 337-346.

Digital Library

Google Scholar

[3]

Hagit Attiya and Mark Tuttle. (Private communincation.)

Google Scholar

[4]

Bard Bloom. Constructing two-writer atomic registers. Proc. Sixth Annual ACM Syrup. on Principles of Distributed Computing, Vancouver, B.C., Aug. 1987, pp. 249-259.

Digital Library

Google Scholar

[5]

James E. Burns and Gary L. Peterson. Constructing multi-reader values from non-atomic values. Proc. Sixth Annual ACM Symp. on Principles of Distributed Computing, Vancouver, B.C., Aug. 1987, pp. 222-231.

Digital Library

Google Scholar

[6]

James E. Burns and Gary L. Peterson. Pure buffers for concurrent reading while writing. Georgia Institute of Technology, School of information and Computer Science, GIT-ICS-87/17, Apr. 1987.

Google Scholar

[7]

P.J. Courtois, F. Heymann, and D.L. Parnas. Concurrent control with "readers" and "writers." Comm. ACM 14, 10 (Oct. 1971), 667-668.

Digital Library

Google Scholar

[8]

Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. On the minimal synchronism needed for distributed consensus. J A CM 34 (1987) 77-97.

Digital Library

Google Scholar

[9]

Danny Dolev, Eli Gafni, and Nir Shavit. Toward a non-atomic era l-exclusion as a test case. Proc. 20th ACM Syrup. on Theory of Computing, Chicago, IL, May 1988, pp. 78-92.

Digital Library

Google Scholar

[10]

Danny Dolev and Nit Shavit. Bounded concurrent time-stamp systems are constructible. Proc. 21st ACM Syrup. on Theory of Computing, Seattle, WA, May 1989, pp. 454-466.

Digital Library

Google Scholar

[11]

Michael j. Fischer, Nancy A. Lynch, James E. Burns, and Allan Borodin. Resource allocation with immunity to limited process failure. 20th Syrup. on Foundations of Computer Science, San Juan, Puerto Rico, Oct. 1979, pp. 234-254.

Google Scholar

[12]

Michael J. Fischer, Nancy A. Lynch, James E. Burns, and Allan Borodin. Distributed FIFO allocation of identical resources using small shared space. A CM Transactions on Programming Languages and Systems 11 (1989) 90-114.

Digital Library

Google Scholar

[13]

Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. J. A CM 32, 2 (1985) 374-382.

Digital Library

Google Scholar

[14]

Leslie Lamport. Concurrent reading and writing. Comm. ACM 20, 11 (Nov. 1977), 8(~811.

Digital Library

Google Scholar

[15]

Michael C. Loui and Hosame H. Abu- Amara. Memory requirements for agreement among unreliable asynchronous processes. In Advances in Computing Research 4 (19s ) x63-1 .

Google Scholar

[16]

Richard Newman-Wolfe. A protocol for wait-free, atomic, multi-reader shared variables. Proc. Sixth Annual A CM Symp. on Principles of Distributed Computing, Vancouver, B.C., Aug. 1987, pp. 232-247.

Digital Library

Google Scholar

[17]

Gary L. Peterson. Myths about the mutual exclusion problem. Information Processing Letter, 12, 3 (June 1981), 115-116.

Crossref

Google Scholar

[18]

Gary L. Peterson. Concurrent reading while writing. A CM Transactions on Programm/ng Languages and Systems 5, 1 (Jan. 1983), 46-55.

Digital Library

Google Scholar

[19]

Gary L. Peterson. A new solution to Lainport's concurrent programming problem using small shared variables. A CM Transactions on Programm/ng Languages and Systems 5, 1 (Jan. 1983), 56-65.

Digital Library

Google Scholar

[20]

Gary L. Peterson and James E. Burns. Concurrent reading while writing II: The multi-writer case. Proceedings 28th IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, Oct. 1987, pp. 383-392.

Google Scholar

[21]

Russel $chaffer. On the correctness of atomic multi-writer registers. Bachelor's Thesis, Lab. for Computer Science, MIT (June 1988).

Google Scholar

[22]

Ambuj K. Singh, James H. Anderson, and Mohamed G. Gouda. The elusive atomic register. Proc. Sixth Annual ACM Symp. on Principles of Distributed Computing, Vancouver, B.C., Aug. 1987, pp. 206-221.

Digital Library

Google Scholar

Cited By

View all

Taubenfeld G(2019)Waiting in concurrent algorithmsComputing10.1007/s00607-018-0618-5101:1(39-57)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s00607-018-0618-5
Delporte-Gallet CFauconnier HGafni ELosa G(2018)The Assignment ProblemProceedings of the 19th International Conference on Distributed Computing and Networking10.1145/3154273.3154303(1-9)Online publication date: 4-Jan-2018
https://dl.acm.org/doi/10.1145/3154273.3154303
Taubenfeld G(2018)A Closer Look at Fault ToleranceTheory of Computing Systems10.1007/s00224-017-9779-462:5(1085-1108)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s00224-017-9779-4
Show More Cited By

Index Terms

The ambiguity of choosing

Recommendations

Spatial autocorrelation and toponym ambiguity
GIR '08: Proceedings of the 5th Workshop on Geographic Information Retrieval

In this paper, we explore the spatial distribution of the referents of ambiguous toponyms and compare it to the distribution of randomly selected unambiguous toponym pairs. We show that for a number of gazetteers, ambiguous toponyms are spatially ...
Analysing anaphoric ambiguity in natural language requirements
Special Issue on Best Papers of RE'10: Requirements Engineering in a Multi-faceted World

Many requirements documents are written in natural language (NL). However, with the flexibility of NL comes the risk of introducing unwanted ambiguities in the requirements and misunderstandings between stakeholders. In this paper, we describe an ...
Toponym ambiguity in geographical information retrieval
SIGIR '09: Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval

The objectives of this research work is to study the effects of toponym (place name) ambiguity in the Geographical Information Retrieval (GIR) task. Our experience with GIR systems shows that toponym ambiguity may be an important factor in the inability ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PODC '89: Proceedings of the eighth annual ACM Symposium on Principles of distributed computing

June 1989

353 pages

ISBN:0897913264

DOI:10.1145/72981

Editor:
Piotr Rudnicki

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 June 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC05

Sponsor:

PODC05: ACM Symposium on Principles of Distributed Computing

Alberta, Edmonton, Canada

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

42
Total Citations
View Citations
379
Total Downloads

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

Reflects downloads up to 30 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Taubenfeld G(2019)Waiting in concurrent algorithmsComputing10.1007/s00607-018-0618-5101:1(39-57)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s00607-018-0618-5
Delporte-Gallet CFauconnier HGafni ELosa G(2018)The Assignment ProblemProceedings of the 19th International Conference on Distributed Computing and Networking10.1145/3154273.3154303(1-9)Online publication date: 4-Jan-2018
https://dl.acm.org/doi/10.1145/3154273.3154303
Taubenfeld G(2018)A Closer Look at Fault ToleranceTheory of Computing Systems10.1007/s00224-017-9779-462:5(1085-1108)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s00224-017-9779-4
Taubenfeld G(2016)Waiting in Concurrent AlgorithmsNetworked Systems10.1007/978-3-319-46140-3_29(345-360)Online publication date: 15-Sep-2016
https://doi.org/10.1007/978-3-319-46140-3_29
Alistarh DAspnes JCensor-Hillel KGilbert SGuerraoui R(2014)Tight Bounds for Asynchronous RenamingJournal of the ACM10.1145/259763061:3(1-51)Online publication date: 2-Jun-2014
https://dl.acm.org/doi/10.1145/2597630
Alistarh DKopinsky JMatveev AShavit N(2014)The LevelArrayProceedings of the 2014 IEEE 34th International Conference on Distributed Computing Systems10.1109/ICDCS.2014.43(348-357)Online publication date: 30-Jun-2014
https://dl.acm.org/doi/10.1109/ICDCS.2014.43
Taubenfeld G(2014)Tight space bounds for $$\ell $$ℓ-exclusionDistributed Computing10.1007/s00446-014-0207-627:3(165-179)Online publication date: 1-Jun-2014
https://dl.acm.org/doi/10.1007/s00446-014-0207-6
Helmi MHigham LWoelfel P(2014)Space Bounds for Adaptive RenamingDistributed Computing10.1007/978-3-662-45174-8_21(303-317)Online publication date: 2014
https://doi.org/10.1007/978-3-662-45174-8_21
Fraigniaud PGafni ERajsbaum SRoy M(2014)Automatically Adjusting Concurrency to the Level of SynchronyDistributed Computing10.1007/978-3-662-45174-8_1(1-15)Online publication date: 2014
https://doi.org/10.1007/978-3-662-45174-8_1
Alistarh DAspnes JGiakkoupis GWoelfel PFatourou PTaubenfeld G(2013)Randomized loose renaming in o(log log n) timeProceedings of the 2013 ACM symposium on Principles of distributed computing10.1145/2484239.2484240(200-209)Online publication date: 22-Jul-2013
https://dl.acm.org/doi/10.1145/2484239.2484240
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.

Cited By

Index Terms

Recommendations

Spatial autocorrelation and toponym ambiguity

Analysing anaphoric ambiguity in natural language requirements

Toponym ambiguity in geographical information retrieval