Time, Coordination, Mutual Exclusion Without Supervisory Manager

  • Ludwik CzajaEmail author
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 27)


In the sequential processor, time is measured by its clock and progresses linearly, i.e.


clockClock Global Timestamp synchronizationSynchronization processProcess eventEvent 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Christensen, S., & Hansen N. D. (1993). Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs. In Application and theory of Petri Nets, Lecture Notes in Computer Science book series (LNCS, vol 691).Google Scholar
  2. Cristian, F. (1989). Probabilistic clock synchronization. Distributed Computing, Springer-Verlag, 3, 146–158.CrossRefzbMATHGoogle Scholar
  3. Czaja, L. (2012). Exclusive Access to Resources in Distributed Shared Memory ArchitectureVolume. Fundamenta Informaticae, 119(3–4), 265–280.MathSciNetGoogle Scholar
  4. Gusella, R., & Zatti, S. (1989). The Accuracy of the Clock Synchronization Achieved by TEMPO in Berkeley UNIX 4.3BSD. IEEE Transactions on Software Engineering, 15(7), 847–853.CrossRefGoogle Scholar
  5. Kuratowski, K., & Mostowski, A. (1976). Set Theory, with an Introduction to Descriptive Set Theory (2nd ed., Studies in Logic and the Foundations of Mathematics—Vol 86) Hardcover—26 Feb 1976.Google Scholar
  6. Kuz, I., Manuel M. T., Chakravarty & Gernot Heiser. (2016). A course on distributed systems COMP9243, 2016.Google Scholar
  7. Lamport, L. (1978). Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21(7), 558–565.CrossRefzbMATHGoogle Scholar
  8. Marczewski (Spilrajn) K. (1930). Sur l’extension de l’ordre partiel, FM (Vol. 16, pp. 386–389). in Edward Marczewski, Collected Mathematical Papers, IM PAN 1996.Google Scholar
  9. Mills, D. L. (1991). Internet time synchronization: The network time protocol. IEEE Transactions on Communications, 39(10), 1482–1493.CrossRefGoogle Scholar
  10. Network Time Protocol (version 2), specification and implementation. (1989). DARPA Network Working Group Report RFC-119, University of Delaware, Sep 1989.Google Scholar
  11. Peterson, J. L. (1981). Petri Net Theory and the Modeling of Systems, Prentice Hall, Inc.Google Scholar
  12. Petri, C. A. (1996). Communication with automata, Report RADC TR-65-377, Applied Data Research (Vol. 1, Suppl. 1), Contract AF 30 Princeton N.J.Google Scholar
  13. Reisig, W. (1985). Petri Nets. An Introduction, Monographs on Theoretical Computer Science, Springer-Verlag.Google Scholar
  14. Ricart, G., & Agrawala, A. K. (1981). An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM, 24(1), 9–17.MathSciNetCrossRefGoogle Scholar
  15. Saxena, P. C., & Rai, J. (2003). A survey of permission-based distributed mutual exclusion algorithms. Computer Standards & Interfaces, 25(2), 159–181. May 2003.Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Vistula UniversityWarsawPoland
  2. 2.Institute of InformaticsUniversity of WarsawWarsawPoland

Personalised recommendations