Skip to main content

The Fuzzy Philosophers

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPDPS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1800))

Included in the following conference series:

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.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  MathSciNet  Google Scholar 

  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.

    Article  Google Scholar 

  3. Dijkstra, E. W.: Self stabilizing systems in spite of distributed control. Communications of the ACM, Vol. 17, No. 6 (1974) 643–644.

    Article  Google Scholar 

  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. Gouda, M. and Haddix, F.: The alternator. Proceedings of the 1999 Workshop on Self-Stabilizing Systems (WSS-99) 48–53.

    Google Scholar 

  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. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, ST. (2000). The Fuzzy Philosophers. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45591-4_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67442-9

  • Online ISBN: 978-3-540-45591-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics