Abstract
We present results regarding consistent-cut protocols. Consistent-cut protocols are based on finding a consistent global state in an underlying distributed computation; they are used for a variety of applications such as checkpointing and deadlock detection. We formally define what it means for a protocol to be non-inhibitory, which intuitively means that it does not prevent any actions from occurring in an underlying computation. We prove that there is no non-inhibitory consistent-cut protocol for non-FIFO asynchronous systems. We also give a lower bound on communication for non-inhibitory consistent-cut protocols for FIFO systems of one message per bidirectional channel (up to 1/2(n 2 ā n)). We present two protocols, one non-inhibitory requiring up to two messages between each pair of neighboring nodes in a network and the other inhibitory and requiring only 3(nā1) messages total. In most networks these results illustrate a tradeoff between the amount of necessary communication and the willingness to inhibit actions of the underlying system. Additionally, our inhibitory protocol also works for non-FIFO systems, thus illustrating that the inhibitory condition is exactly what is required to develop consistent-cut protocols for non-FIFO systems which satisfy our model.
Supported by an AT&T Ph.D. Scholarship
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch. Complexity of network synchronization. J.A.C.M., 32(4), Oct. 1985.
K. Birman and T. Joseph. Reliable communication in the presence of failures. A.C.M. Transactions on Computer Systems, 5(1), February 1987.
G. Bracha and S. Toueg. Distributed deadlock detection. Distributed Computing, 2(3):127ā138, 1987.
M. Chandy and L. Lamport. Finding global states of a distributed system. A.C.M. Transactions on Computer Systems, 3(1):63ā75, 1985.
M. Chandy and J. Misra. How processes learn. In Proceedings of the Fifth A.C.M. Symposium on Principles of Distributed Computing, pages 204ā214, 1985.
E. Chang. Echo algorithms: depth parallel operations on graphs. I.E.E.E. Transactions on Software Engineering, SE-8(4):391ā400, 1982.
A. Gopal and S. Toueg, January 1989. Personal communication.
J. Gray. Notes on database operating systems. In Lecture Notes in Computer Science 60. Springer-Verlag, Berlin, 1978.
R. Koo and S. Toueg. Checkpointing and rollback-recovery for distributed systems. IEEE Transactions On Software Engineering, SE-13(1):23ā31, January 1987.
T. Lai and T. Yang. On distributed snapshots. Information Processing Letters, 25:153ā158, 1987.
L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the A.C.M., 21(7):558ā565, 1977.
F. Mattern. Virtual time and global states of distributed systems. Technical Report SFB124-38/88, University of Kaiserslautern, Dept. of Computer Science, Oct. 1988. Submitted for publication in Proceedings of Parallel and Distributed Algorithms.
P. Panangaden and K. Taylor. Concurrent common knowledge: A new definition of agreement for asynchronous systems. In Proceedings of the Seventh A.C.M. Symposium on Principles of Distributed Computing, pages 197ā209, Aug. 1988.
K. Taylor. The role of inhibition in asynchronous consistent-cut protocols. Technical Report 89-995, Cornell University, Dept. of Computer Science, April 1989.
G. Winskel. Event structures. Technical Report 95, University of Cambridge, Computer Laboratory, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
Ā© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Taylor, K. (1989). The role of inhibition in asynchronous consistent-cut protocols. In: Bermond, JC., Raynal, M. (eds) Distributed Algorithms. WDAG 1989. Lecture Notes in Computer Science, vol 392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51687-5_50
Download citation
DOI: https://doi.org/10.1007/3-540-51687-5_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51687-3
Online ISBN: 978-3-540-46750-2
eBook Packages: Springer Book Archive