Abstract
In the sequential processor , time is measured by its clock and progresses linearly, i.e.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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).
Cristian, F. (1989). Probabilistic clock synchronization. Distributed Computing, Springer-Verlag, 3, 146–158.
Czaja, L. (2012). Exclusive Access to Resources in Distributed Shared Memory ArchitectureVolume. Fundamenta Informaticae, 119(3–4), 265–280.
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.
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.
Kuz, I., Manuel M. T., Chakravarty & Gernot Heiser. (2016). A course on distributed systems COMP9243, 2016.
Lamport, L. (1978). Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21(7), 558–565.
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.
Mills, D. L. (1991). Internet time synchronization: The network time protocol. IEEE Transactions on Communications, 39(10), 1482–1493.
Network Time Protocol (version 2), specification and implementation. (1989). DARPA Network Working Group Report RFC-119, University of Delaware, Sep 1989.
Peterson, J. L. (1981). Petri Net Theory and the Modeling of Systems, Prentice Hall, Inc.
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.
Reisig, W. (1985). Petri Nets. An Introduction, Monographs on Theoretical Computer Science, Springer-Verlag.
Ricart, G., & Agrawala, A. K. (1981). An optimal algorithm for mutual exclusion in computer networks. Communications of the ACM, 24(1), 9–17.
Saxena, P. C., & Rai, J. (2003). A survey of permission-based distributed mutual exclusion algorithms. Computer Standards & Interfaces, 25(2), 159–181. May 2003.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Czaja, L. (2018). Time, Coordination, Mutual Exclusion Without Supervisory Manager. In: Introduction to Distributed Computer Systems . Lecture Notes in Networks and Systems, vol 27. Springer, Cham. https://doi.org/10.1007/978-3-319-72023-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-72023-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72022-7
Online ISBN: 978-3-319-72023-4
eBook Packages: EngineeringEngineering (R0)