Issues in event abstraction

  • Thomas Kunz
Poster Session Regular Posters
Part of the Lecture Notes in Computer Science book series (LNCS, volume 694)


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.


  1. 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. 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. 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. 4.
    Thomas Kunz. Event Abstraction: Some Definitions and Theorems. Technical Report TI-1/93, Technical University Darmstadt, February 1993.Google Scholar
  5. 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. 6.
    Cherri M. Pancake. Debugger Visualization Techniques for Parallel Architectures. In Proceedings of COMPCON, pages 276–284, San Francisco, February 1992.Google Scholar
  7. 7.
    James Alexander Summers. Precedence-Preserving Abstraction for Distributed Debugging. Master's thesis, University of Waterloo, 1992.Google Scholar
  8. 8.
    Dror Zernik, Marc Snir, and Dalia Malki. Using Visualization Tools to Understand Concurrency. IEEE Software, pages 87–92, May 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Thomas Kunz
    • 1
  1. 1.Institut für Theoretische InformatikTechnische Hochschule DarmstadtDeutschland

Personalised recommendations