Abstract
This paper presents an algorithm for global state detection based on peer-to-peer interactions. The interactions in distributed systems can be analyzed in terms of the peer-to-peer pairwise interactions of intervals between processes. This paper examines the problem: “If a global state of interest to an application is specified in terms of the pairwise interaction types between each pair of peer processes, how can such a global state be detected?” Devising an efficient algorithm is a challenge because of the overhead of having to track the intervals at different processes. We devise a distributed on-line algorithm to efficiently manage the distributed data structures and solve this problem. We prove the correctness of the algorithm and analyze its complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chandra, P., Kshemkalyani, A.D.: Detection of orthogonal interval relations. In: Sahni, S.K., Prasanna, V.K., Shukla, U. (eds.) HiPC 2002. LNCS, vol. 2552, pp. 323–333. Springer, Heidelberg (2002)
Chandra, P., Kshemkalyani, A.D.: Distributed detection of temporal interactions. Tech. Report UIC-ECE-02-07, Univ. of Illinois at Chicago (May 2002)
Chandra, P., Kshemkalyani, A.D.: Detecting global predicates under fine-grained modalities. In: Saraswat, V.A. (ed.) ASIAN 2003. LNCS, vol. 2896, pp. 91–109. Springer, Heidelberg (2003)
Chandra, P., Kshemkalyani, A.D.: Causality-based predicate detection across space and time. IEEE Transactions on Computers 54(11), 1438–1453 (2005)
Chandy, K.M., Lamport, L.: Distributed snapshots: Determining global states of distributed systems. ACM Transactions on Computer Systems 3(1), 63–75 (1985)
Fidge, C.J.: Timestamps in message-passing systems that preserve partial ordering. Australian Computer Science Communications 10(1), 56–66 (1988)
Kshemkalyani, A.D.: Temporal interactions of intervals in distributed systems. Journal of Computer and System Sciences 52(2), 287–298 (1996)
Kshemkalyani, A.D.: A framework for viewing atomic events in distributed computations. Theoretical Computer Science 196(1-2), 45–70 (1998)
Kshemkalyani, A.D., Raynal, M., Singhal, M.: An introduction to global snapshots of a distributed system. IEE/IOP Distributed Systems Engineering Journal 2(4), 224–233 (1995)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)
Mattern, F.: Virtual time and global states of distributed systems. In: Parallel and Distributed Algorithms, pp. 215–226. North-Holland, Amsterdam (1989)
Milojicic, D., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., Xu, Z.: Peer-to-peer computing. Hewlett Packard Technical Report HPL-2002-57 (2002)
Rissom, J., Moors, T.: Survey of research towards robust peer-to-peer networks: Search methods. Technical Report UNSW-EE-P2P-1-1, Univ. of New South Wales (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chandra, P., Kshemkalyani, A.D. (2005). Global State Detection Based on Peer-to-Peer Interactions. In: Yang, L.T., Amamiya, M., Liu, Z., Guo, M., Rammig, F.J. (eds) Embedded and Ubiquitous Computing – EUC 2005. EUC 2005. Lecture Notes in Computer Science, vol 3824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596356_57
Download citation
DOI: https://doi.org/10.1007/11596356_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30807-2
Online ISBN: 978-3-540-32295-5
eBook Packages: Computer ScienceComputer Science (R0)