Advertisement

The Fuzzy Philosophers

  • Shing-Tsaan Huang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1800)

Abstract

Consider a network of nodes; each node represents a philosopher; links represent the neighboring relationship among the philosophers. Every philosopher enjoys singing so much that once getting the chance, he always sings a song within a finite delay. This paper proposes a protocol for the philosophers to follow. The protocol guarantees the following requirements: (1) No two neighboring philosophers sing songs simultaneously. (2) Along any infinite time period, each philosopher gets his chances to sing infinitely often. Following the protocol, each philosopher uses only one bit to memorize his state.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brown, G. M., Gouda, M. G., and Wu, C. L.: Token systems that stabilize. IEEE Transaction on Computers, Vol. 38, No. 6 (1989) 845–852.CrossRefMathSciNetGoogle Scholar
  2. 2.
    Chany, K. M. and Misra, J.: The drinking philosophers problem. ACM Transaction on Programming Languages and Systems, Vol. 6, No. 4, Oct. (1984) 632–646.CrossRefGoogle Scholar
  3. 3.
    Dijkstra, E. W.: Self stabilizing systems in spite of distributed control. Communications of the ACM, Vol. 17, No. 6 (1974) 643–644.zbMATHCrossRefGoogle Scholar
  4. 4.
    Dijkstra, E. W.: Hierarchical ordering of sequential processes. In Operating Systems Techniques, Hoare, C.A. R. and Perrott, R.H., Eds., Academic Press, New York (1972).Google Scholar
  5. 5.
    Gouda, M. and Haddix, F.: The alternator. Proceedings of the 1999 Workshop on Self-Stabilizing Systems (WSS-99) 48–53.Google Scholar
  6. 6.
    Huang, S.T., Wuu, L.C., and Tsai, M. S.: Distributed execution model for self-stabilizing systems. Proceedings of the 14th International Conference of Distributed Computing Systems. (ICDCS-94) (1994) 432–439.Google Scholar
  7. 7.
    Mizuno, M., Nesterenko, M., and Kakugawa, H.: Lock based self-stabilizing distributed mutual exclusion algorithms. Proceedings of the 16th International Conference of Distributed Computing Systems. (ICDCS-96) (1996) 708–716.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Shing-Tsaan Huang
    • 1
  1. 1.Department of Computer Science and Information EngineeringNational Central UniversityChung-LiTaiwan, R.O.C.

Personalised recommendations