Advertisement

Universal Constructs in Distributed Computations

  • Ajay D. Kshemkalyani
  • Mukesh Singhal
Conference paper
  • 46 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1685)

Abstract

This paper identifies two classes of communication patterns that occur in distributed computations and explores their properties. It first examines local patterns, primarily IO and OI intervals, that occur at nodes in distributed computations. These local patterns form building blocks that are then used to define the global patterns, termed segments and paths, that occur across nodes in distributed computations. By controlling the predicates on the local patterns used to define segments and paths, various types of segments and paths can be defined. A number of key concepts and structures characterizing distributed computations are special cases of and are expressed in terms of the patterns identified.

Keywords

Local Pattern Distinguished Event Causal Chain Global Pattern Closed Path 
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.

References

  1. [1]
    B. Bhargava, S.R. Lian, Checkpointing and rollback recovery in distributed systems-an optimistic approach, Proc. 7th IEEE SRDS, 3–12, Oct. 1988.Google Scholar
  2. [2]
    K.M. Chandy, L. Lamport, Distributed snapshots: Global states of a distributed system, ACM Trans. Comput. Systems, 3(1):63–75, 1985.Google Scholar
  3. [3]
    K.M. Chandy, J. Misra, How processes learn, Distributed Computing, 1, 40–52, 1986.Google Scholar
  4. [4]
    B. Charron-Bost, F. Mattern, G. Tel, Synchronous, asynchronous, and causally ordered communication, Distributed Computing, 9(4):173–191, 1996.Google Scholar
  5. [5]
    C.J. Fidge, A simple run-time concurrency measure, In: T. Bossomaier et al. (Eds.), The Transputer in Australasia (ATOUG-3), 92–41, IOS Press, 1990.Google Scholar
  6. [6]
    A.D. Kshemkalyani, M. Singhal, On characterization and correctness of distributed deadlock detection, Journal of Parallel and Distributed Computing, 22(1), 44–59, July 1994. (Tech. Rep. TR-06/90-TR15, Ohio State Univ., 1990.)Google Scholar
  7. [7]
    A.D. Kshemkalyani, M. Singhal, Universal constructs in distributed computations, Technical Report 29.2136, IBM, March 1996.Google Scholar
  8. [8]
    L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, 21(7):558–565, July 1978.Google Scholar
  9. [9]
    R. Netzer, J. Xu, Necessary and sufficient conditions for consistent global snap-shots, IEEE Trans. on Parallel and Distributed Systems, 6(2):165–169, 1995.Google Scholar
  10. [10]
    A. Schiper, A. Sandoz, Strong stable properties in distributed systems, Distributed Computing, 8:93–103, 1994.Google Scholar
  11. [11]
    M. Spezialetti, R. Gupta, Debugging distributed programs through the detection of simultaneous events, Proc. 14th IEEE ICDCS, 634–641, June 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Ajay D. Kshemkalyani
    • 1
  • Mukesh Singhal
    • 2
  1. 1.Dept. of EECSUniversity of Illinois at ChicagoChicagoUSA
  2. 2.Dept. of CISThe Ohio State UniversityColumbusUSA

Personalised recommendations