Skip to main content
SpringerLink
Log in
Book cover

GI — 17. Jahrestagung Computerintegrierter Arbeitsplatz im Büro pp 89–109Cite as

Effiziente Bestimmung von Schnappschüssen in verteilten Systemen

  • Conference paper

  • 97 Accesses

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 156))

Kurzfassung

Ein zentrales Problem verteilter Systeme stellt die Berechnung eines konsistenten Schnappschusses des globalen Zustandes dar. Wir stellen einen effizienten symmetrischen Algorithmus vor, der für asynchrone Kommunikation mit beliebigen Nachrichtenüberholungen geeignet ist und unabhängig von mehreren Knoten „gleichzeitig“ gestartet werden kann. Bei iterierter Anwendung bis zur Systemterminierung ist die Zahl der Läufe des Algorithmus i.w. durch die Zahl der Basisnachrichten des zugrundeliegenden Systems begrenzt. Die Methoden zum parallelen und sequentiellen Traversieren des Netzes und zur Symmetriebrechung („distributed election“), auf denen das Schnappschußverfahren basiert, werden ebenfalls erläutert.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. Bouge L. (1985) Repeated Synchronous Snapshots and Their Implementation in CSP. In: Brauer W. (ed) Proc. of the 12th Colloquium on Automata, Languages and Programming, Springer-Verlag, LNCS, pp. 325–341

    Google Scholar 

  2. Chang E.J.H. (1982) Echo Algorithms: Depth Parallel Operations on General Graphs IEEE Transactions on Software Engineering SE-8:4, pp. 391–401

    Google Scholar 

  3. Ciiandy K.M., Lamport L. (1985) Distributed Snapshots: Determining Global States of Distributed Systems. ACM Transactions on Computer Systems 3: 1, pp. 63–75

    Google Scholar 

  4. Chang E., Roberts R. (1979) An Improved Algorithm for Decentralized Extrema-Finding in Circular Configurations of Processes. Comm. of the ACM 22: 5, pp. 281–283

    Article  Google Scholar 

  5. Chin F., Ting H.F. (1985) An Almost Linear Time and O(nlogn+e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees. Proc. of the 26th Symposium on Foundations of Computer Science, pp. 257–266

    Google Scholar 

  6. Clinger W.D. (1981) Foundations of Actor Semantics. Technical Report AI—TR-633, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, USA

    Google Scholar 

  7. Elmagarmid A.K. (1986) A Survey of Distributed Deadlock Detection Algorithms. Sigmod Record 15: 3, pp. 37–44

    Article  Google Scholar 

  8. Francez N. (1980) Distributed Termination. ACM Transactions on Programming Languages and Systems 2:1, pp. 42–55

    Article  Google Scholar 

  9. Gallager R.G., Humbley P.A., Spira P.A. (1983) A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM Transactions on Programming Languages and Systems 5: 1, pp. 66–77

    Google Scholar 

  10. Helary J.-M., Maddi A., Plouzeau N., Raynal M. (1986) Parcours et Apprentissage dans un Reseau de Processus Communicants. Technical Report 302, IRISA, University of Rennes, France

    Google Scholar 

  11. Korach E., Kutten S., Moran S. (1985) A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms. Technical Report, Technion - Israel Institute of Technology, Computer Science Department, Haifa, Israel.

    Google Scholar 

  12. Kutren S. (1987) Stepwise Construction of an Efficient Distributed Traversing Algorithm for General Strongly Connected Directed Graphs. Technical Report (draft), Technion - Israel Institute of Technology, Computer Science Department, Haifa, Israel

    Google Scholar 

  13. Lamport L. (1978) Time, Clocks and the Ordering of Events in a Distributed System. Comm. of the ACM 21:7, pp. 558–565

    Article  Google Scholar 

  14. Lai T.H., Yang T.H. (1987) On Distributed Snapshots. Information Processing Letters 25, pp. 153–158

    Google Scholar 

  15. Mariern F. (1987) Algorithms for Distributed Termination Detection. Technical Report SFB124–20/87, Department of Computer Science, University of Kaiserslautern, West-Germany.

    Google Scholar 

  16. Mar1ern F. (1987) Determining the Partial Order of Distributed Events. Technical Report SFB124–28/87, Department of Computer Science, University of Kaiserslautem, West-Germany.

    Google Scholar 

  17. Mattern F. (1987) Das Actor-Modell. Informatik-Spektrum 10:1, pp. 41–43

    Google Scholar 

  18. Maitern F. (1987) Schnappschuß und andere verteilte Kontrollalgorithmen am Beispiel eines experimentellen dezentralen Terminvereinbarungssystems. Technical Report SFB124–26/87, Department of Computer Science, University of Kaiserslautern, West-Germany.

    Google Scholar 

  19. Morgan C. (1985) Global and Logical Time in Distributed Algorithms. Information Processing Letters 20, pp. 189–194

    Google Scholar 

  20. Neiger T., Toueg S. (1987) Substituting for Real Time and Common Knowledge in Distributed Systems. Technical Report, Department of Computer Science, Cornell University, NY, USA

    Google Scholar 

  21. Nehmer J., Haban D., Mattern F., Rombach D., Wybranietz D. (1987) Key Concepts of the INCAS Multicomputer Project. IEEE Transactions on Software Engineering, SE-13:8

    Google Scholar 

  22. Peterson G.L. (1982) An O(nlogn) Unidirectional Algorithm for the Circular Extrema Problem. ACM Transactions on Programming Languages and Systems 4:4, pp. 758–762

    Google Scholar 

  23. Raynal M. (1986) Algorithms for Mutual Exclusion. North Oxford Academic Publishers Limited

    Google Scholar 

  24. Segal A. (1983) Distributed Network Protocols. IEEE Transactions on Information Theory IT-29:1, pp. 23–35

    Google Scholar 

  25. Spezialetfi M, Kearns P (1986) Efficient Distributed Snapshots. Proc. of the 6th Int. Conf. on Distributed Computing Systems, pp 382–388

    Google Scholar 

  26. Tel G. (1986) Distributed Infimum Approximation. Technical Report RUU—CS-86–12, Department of Computer Science, University of Utrecht, The Netherlands

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, SFB124, Universität Kaiserslautern, Postfach 3049, D 6750, Kaiserslautern, Deutschland

    Friedemann Mattern

Authors
  1. Friedemann Mattern
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Infromatik, Technische Universität München, Arcisstraße 21, D-8000, München 2, Deutschland

    Manfred Paul

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mattern, F. (1987). Effiziente Bestimmung von Schnappschüssen in verteilten Systemen. In: Paul, M. (eds) GI — 17. Jahrestagung Computerintegrierter Arbeitsplatz im Büro. Informatik-Fachberichte, vol 156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-01110-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-01110-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18478-2

  • Online ISBN: 978-3-662-01110-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation