Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

The choice coordination problem

Summary

In the course of a concurrent computation, processes P1,..., Pn must reach a common choice of one out of k alternatives A 1,..., A k. They do this by protocols using k shared variables, one for each alternative. If the range of the variables has m values then \(\frac{{\text{1}}}{{\text{2}}}\sqrt[{\text{3}}]{n} \leqq \operatorname{m} \) is necessary, and n + 2≦m is sufficient, for deterministic protocols solving the choice coordination problem (C.C.P.). We introduce very simple randomizing protocols which, independently of n, solve the C.C.P. by use of a fixed alphabet. A single-byte (256-valued) alphabet permits a solution with non-termination probability smaller than 2−127. Many software and hardware tasks involving concurrency can be interpreted as choice coordination problems. Choice coordination problems occur also in nature.

This is a preview of subscription content, log in to check access.

References

  1. 1.

    Ben-Or, M.: Private communication

  2. 2.

    Fischer, M., Rabin, M.O.: Concurrent search of a large data-structure. In preparation

  3. 3.

    Lehmann, D., Rabin, M.O.: On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem. Submitted for publication

  4. 4.

    Rabin, M.O.: N-process synchronization by 4 · log2 N-valued shared variables. Proceedings of the 21st IEEE Annual Symp. on Foundations of Computer Science (1980). To appear JCSS

  5. 5.

    Probabilistic algorithms: Algorithms and complexity, New Directions and Recent Trends (J.F. Traub Ed.) Academic Press: New York (1976), pp. 21–39

  6. 6.

    Treat, A.: Experimental control of ear choice in the moth ear mite. XI. Internationaler Kongress für Entomologie. Wien (1960), pp. 619–621

Download references

Author information

Additional information

This research was supported in part by NSF grants: MCS77-02474 at Washington University, Seattle, MCS80-12716 at University of California at Berkeley. Presented at the Specker Symposium in Zürich, January 1980

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Rabin, M.O. The choice coordination problem. Acta Informatica 17, 121–134 (1982). https://doi.org/10.1007/BF00288965

Download citation

Keywords

  • Information System
  • Operating System
  • Data Structure
  • Communication Network
  • Information Theory