Skip to main content

Issues in event abstraction

  • Poster Session
  • Conference paper
  • First Online:
PARLE '93 Parallel Architectures and Languages Europe (PARLE 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 694))

  • 703 Accesses

Abstract

Debugging distributed applications is very difficult, due to a number of problems. To manage the inherent complexity of distributed applications, for example, the use of abstractions is proposed. Event abstractions group sets of events into one higher-level event. Only event sets with certain properties guarantee proper abstraction. This paper examines two specific event set structures in more depth: complete precedence abstractions and contractions. Its main results are as follows. First, it is shown how the algorithmic detection of complete precedence abstractions can be simplified. Second, an additional structural requirement for contractions is derived to ensure their complete timestamping.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Peter Bates. Distributed Debugging Tools for Heterogeneous Distributed Systems. In Proceedings of the 8th International Conference on Distributed Computing Systems, pages 308–315, San Jose, California, June 1988.

    Google Scholar 

  2. Wing Hong Cheung. Process and Event Abstraction for Debugging Distributed Programs. PhD thesis, University of Waterloo, Ontario, Canada, September 1989. Also available as Technical Report T-189, Computer Communications Network Group, University of Waterloo.

    Google Scholar 

  3. Wing Hong Cheung, James P. Black, and Eric Manning. A Framework for Distributed Debugging. IEEE Software, pages 106–115, January 1990.

    Google Scholar 

  4. Thomas Kunz. Event Abstraction: Some Definitions and Theorems. Technical Report TI-1/93, Technical University Darmstadt, February 1993.

    Google Scholar 

  5. Leslie Lamport. Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM, pages 558–565, July 1978.

    Google Scholar 

  6. Cherri M. Pancake. Debugger Visualization Techniques for Parallel Architectures. In Proceedings of COMPCON, pages 276–284, San Francisco, February 1992.

    Google Scholar 

  7. James Alexander Summers. Precedence-Preserving Abstraction for Distributed Debugging. Master's thesis, University of Waterloo, 1992.

    Google Scholar 

  8. Dror Zernik, Marc Snir, and Dalia Malki. Using Visualization Tools to Understand Concurrency. IEEE Software, pages 87–92, May 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Arndt Bode Mike Reeve Gottfried Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kunz, T. (1993). Issues in event abstraction. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_55

Download citation

  • DOI: https://doi.org/10.1007/3-540-56891-3_55

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56891-9

  • Online ISBN: 978-3-540-47779-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics