skip to main content
10.1145/564870.564907acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
Article

Tracking immediate predecessors in distributed computations

Published:10 August 2002Publication History

ABSTRACT

A distributed computation is usually modeled as a partially ordered set of relevant events (the relevant events are a subset of the primitive events produced by the computation). An important causality-related distributed computing problem, that we call the Immediate Predecessors Tracking (IPT) problem, consists in associating with each relevant event, on the fly and without using additional control messages, the set of relevant events that are its immediate predecessors in the partial order. So, IPT is the on-the-fly computation of the transitive reduction (i.e., Hasse diagram) of the causality relation defined by a distributed computation. This paper addresses the IPT problem: it presents a family of protocols that provides each relevant event with a timestamp that exactly identifies its immediate predecessors. The family is defined by a general condition that allows application messages to piggyback control information whose size can be smaller than $n$ (the number of processes). In that sense, this family defines message size-efficient IPT protocols. According to the way the general condition is implemented, different IPT protocols can be obtained. Two of them are exhibited.

References

  1. Anceaume E., Hélary J.-M. and Raynal M., Tracking Immediate Predecessors in Distributed Computations. Res. Report #1344, IRISA, Univ. Rennes (France), 2001.]]Google ScholarGoogle Scholar
  2. Baldoni R., Prakash R., Raynal M. and Singhal M., Efficient Δ-Causal Broadcasting. Journal of Computer Systems Science and Engineering, 13(5):263--270, 1998.]]Google ScholarGoogle Scholar
  3. Chandy K.M. and Lamport L., Distributed Snapshots: Determining Global States of Distributed Systems, ACM Transactions on Computer Systems, 3(1):63-75, 1985.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Diehl C., Jard C. and Rampon J.-X., Reachability Analysis of Distributed Executions, Proc. TAPSOFT'93, Springer-Verlag LNCS 668, pp. 629--643, 1993.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Fidge C.J., Timestamps in Message-Passing Systems that Preserve Partial Ordering, Proc. 11th Australian Computing Conference, pp. 56--66, 1988.]]Google ScholarGoogle Scholar
  6. Fromentin E., Jard C., Jourdan G.-V. and Raynal M., On-the-fly Analysis of Distributed Computations, IPL, 54:267--274, 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Fromentin E. and Raynal M., Shared Global States in Distributed Computations, JCSS, 55(3):522--528, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Fromentin E., Raynal M., Garg V.K. and Tomlinson A., On-the-Fly Testing of Regular Patterns in Distributed Computations. Proc. ICPP'94, Vol. 2:73--76, 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Garg V.K., Principles of Distributed Systems, Kluwer Academic Press, 274 pages, 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Hélary J.-M., Mostéfaoui A., Netzer R.H.B. and Raynal M., Communication-Based Prevention of Useless Ckeckpoints in Distributed Computations. Distributed Computing, 13(1):29--43, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Hélary J.-M., Melideo G. and Raynal M., Tracking Causality in Distributed Systems: a Suite of Efficient Protocols. Proc. SIROCCO'00, Carleton University Press, pp. 181--195, L'Aquila (Italy), June 2000.]]Google ScholarGoogle Scholar
  12. Hélary J.-M., Netzer R. and Raynal M., Consistency Issues in Distributed Checkpoints. IEEE TSE, 25(4):274-281, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Hurfin M., Mizuno M., Raynal M. and Singhal M., Efficient Distributed Detection of Conjunction of Local Predicates in Asynch Computations. IEEE TSE, 24(8):664--677, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Lamport L., Time, Clocks and the Ordering of Events in a Distributed System. Comm. ACM, 21(7):558-565, 1978.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Marzullo K. and Sabel L., Efficient Detection of a Class of Stable Properties. Distributed Computing, 8(2):81--91, 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Mattern F., Virtual Time and Global States of Distributed Systems. Proc. Int. Conf. Parallel and Distributed Algorithms, (Cosnard, Quinton, Raynal, Robert Eds), North-Holland, pp. 215--226, 1988.]]Google ScholarGoogle Scholar
  17. Prakash R., Raynal M. and Singhal M., An Adaptive Causal Ordering Algorithm Suited to Mobile Computing Environment. JPDC, 41:190--204, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Raynal M. and Singhal S., Logical Time: Capturing Causality in Distributed Systems. IEEE Computer, 29(2):49-57, 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Singhal M. and Kshemkalyani A., An Efficient Implementation of Vector Clocks. IPL, 43:47--52, 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Wang Y.M., Consistent Global Checkpoints That Contain a Given Set of Local Checkpoints. IEEE TOC, 46(4):456--468, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Tracking immediate predecessors in distributed computations

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SPAA '02: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
        August 2002
        302 pages
        ISBN:1581135297
        DOI:10.1145/564870

        Copyright © 2002 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 10 August 2002

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate447of1,461submissions,31%

        Upcoming Conference

        SPAA '24

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader