This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Logical Clock Requirements for Reverse Engineering Scenarios from a Distributed System
April 2002 (vol. 28 no. 4)
pp. 321-339

To reverse engineer scenarios from event traces, one must infer causal relationships between events. The inferences are usually based on a trace with sequence numbers or timestamps corresponding to some kind of logical clock. In practice, there is an explosion of potentially causal relationships in the trace, which limits one's ability to extract scenarios. This work defines a more parsimonious form of causality called scenario causality that concentrates on certain major causal relationships and ignores more subtle potentially causal links. The influence of an event is restricted to the particular scenario it is part of. An event which is not a message reception is defined to be caused by the previous event in the same software object, while a message reception is caused by a sending event in another object. The events are ordered to form a scenario event graph where typed nodes are events and the typed edges are certain causal relationships. Intuitively, we might say that most logical clocks, which identify events which “happened before” a given event and, thus, are potentially causal, give an upper bound on the set of causal events; scenario causality identifies a lower bound. The much smaller lower bound set makes it possible to reverse engineer and automate the analysis of scenarios.

[1] G. Booch, J. Rumbaugh, and I. Jacobson, The Unified Modeling Language User Guide. Addison Wesley, 1999.
[2] T. Kunz and J.P. Black, “Using Automated Process Clustering for Design Recovery and Distributed Debugging,” IEEE Trans. Software Eng., vol. 21, pp. 515–527, June 1995.
[3] T. Kunz, “High-Level Views of Distributed Executions: Convex Abstract Events,” J. Automated Software Eng., vol. 4, pp. 179–197, Apr. 1997.
[4] D.P. Helmbold, C.E. McDowell, and J.Z. Wang, “Determining Possible Event Orders by Analyzing Sequential Traces,” IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 827–839, July 1993.
[5] L. Lamport, "Time, clocks and the ordering of events in a distributed system," Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[6] R. Schwarz and F. Mattern, “Detecting Causal Relationships in Distributed Computations: In Search of the Holy Grail,” Distributed Computing, vol. 7, no. 3, pp. 149–174, 1994.
[7] C.J. Fidge, "Logical Time in Distributed Computing Systems," Computer, pp. 28-33, Aug. 1991.
[8] F. Mattern, “Time and Global States of Distributed Systems,” Proc. Int'l Workshop Parallel and Distributed Algorithms, pp. 215–226, 1988.
[9] W. Newton-Smith, The Structure of Time. London: Routledge&Kegan Paul, 1980.
[10] C.J. Fidge, “Timestamps in Message-Passing Systems that Preserve the Partial Ordering,” Proc. 11th Australian Computer Science Conf., pp. 56–66, 1988.
[11] S. Paynter, “Structuring the Semantic Definitions of Graphical Design Notations,” Software Eng. J., vol. 10, pp. 105–115, May 1995.
[12] M. Jackel, “Ada-Concurrency Specified by Graph Grammars,” Graph Grammars and Their Application to Computer Science, H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, eds., pp. 262–279, 1987.
[13] M. Glinz, "An Integrated Formal Model of Scenarios Based on Statecharts," Proc. ESEC'95—Fourth European Software Eng. Conf., Lecture Notes in Computer Science 989, Springer-Verlag, 1995.
[14] D. Janssens and G. Rozenberg, “Basic Notions of Actor Grammars,” Graph Grammars and Their Application to Computer Science, H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, eds., pp. 280–298, 1987.
[15] F. Mattern, “Algorithms for Distributed Termination Detection,” Distributed Computing, pp. 161–175, 1987.
[16] M. Singhal and A. Kshemkalyani, "An Efficient Implementation of Vector Clocks," Information Processing Letters, vol. 43, pp. 47-52, 1992.
[17] J. Fowler and W. Zwaenepoel, "Causal Distributed Breakpoints," Proc. 10th Int'l Conf. Distributed Computing Systems, pp. 134-141, 1990.
[18] C. Valot, “Characterizing the Accuracy of Distributed Timestamps,” Proc. ACM/ONR Workshop Parallel and Distributed Debugging, pp. 43–52, May 1993.
[19] A.D. Kshemkalyani, “Temporal Interactions of Intervals in Distributed Systems,” J. Computer and System Sciences, vol. 52, pp. 287–298, 1996.
[20] D.J. Taylor,“A prototype debugger for Hermes,” Proc. 1992 CAS Conf., vol. 1, Toronto, Ont., Canada, Nov. 1992, IBM Canada Ltd. Laboratory, Centre for Advanced Studies, pp. 29-42.
[21] B. Charron-Bost, F. Mattern, and G. Tel, “Synchronous, Asynchronous, and Causally Ordered Communications,” Distributed Computing, 1995.
[22] C. Diehl and C. Jard, “Interval Approximations of Message Causality in Distributed Executions,” Proc. Symp. Theoretical Aspects of Computer Science, pp. 363–374, Feb. 1992.
[23] J. Rumbaugh, I. Jacobson, and G. Booch, The Unified Modeling Language Reference Manual. Addison-Wesley, 1999.
[24] R. Milner, A Calculus of Communicating Systems. Berlin: Springer Verlag, vol. 92, 1980.
[25] J.L. Peterson, “Petri Nets,” ACM Computing Surveys, vol. 9, no. 3, Sept. 1977.
[26] Open Software Foundation, Introduction to OSF DCE. Prentice Hall, 1992.
[27] Object Management Group, The Common Object Request Broker: Architecture and Specification (CORBA) Revision 1.2. Framingham, Mass: Object Management Group, Dec. 1993.
[28] T. Lindholm and F. Yellin, The Java Virtual Machine Specification, Addison-Wesley, Reading, Mass., 1997.
[29] J. Gosling, B. Joy, and G. Steele, The Java Language Specification, Addison-Wesley, Reading, Mass., 1996.
[30] S. Prasad, "Models for Mobile Computing Agents," ACM Computing Surveys, vol. 28, p. 53, Dec. 1996.
[31] R. Cypher and E. Leu, “The Semantics of Blocking and Nonblocking Send and Receive Primitives,” Proc. Eighth Int'l Symp. Parallel Processing, H.J. Siegel, ed., pp. 729–735, Apr. 1994.
[32] R. Cypher and E. Leu, “Repeatable and Portable Message-Passing Programs,” Symp. Principles of Distributed Computing (PODC '94), pp. 22–31, Aug. 1994.
[33] A.D. Birrell and B.J. Nelson, “Implementing Remote Procedure Calls,” Proc. ACM Symp. Operating System Principles, p. 3, Oct. 1983.
[34] C. Hrischuk, C.M. Woodside, J. Rolia, and R. Iversen, “Trace-Based Load Characterization for Generating Performance Software Models,” IEEE Trans. Software Eng., vol. 25, pp. 122–135, Jan. 1999.
[35] W.M. Gentleman, “Message Passing between Sequential Processes: The Reply Primitive and the Administrator Concept,” Software–Practice and Experience, vol. 11, pp. 435–466, 1981.
[36] V.R. Pratt, "Modeling Concurrency with Partial Orders," Int. J. Parallel Programming, Vol. 15, No. 1, 1986, pp. 33-71.
[37] C.E. Hrischuck, J. Rolia, and C.M. Woodside, “Automatic Generation of a Software Performance Model Using an Object Oriented Prototype,” Proc. MASCOTS, pp. 399–409, Jan. 1995.
[38] C.E. Hrischuk, “Trace-Based Load Characterization for the Automated Development of Software Performance Models,” PhD thesis, Carleton Univ., Ottawa, Canada, 1998.
[39] C.E. Hrischuk, “A Model Making Automation Process (MMAP) Using a Graph Grammar Formalism,” technical report, Electrical and Computer Eng. Department, Univ. of Alberta, Edmonton, Alberta, Canada, 1998. Presented at the Sixth Int'l Workshop Theory and Application of Graph Transformations (TAGT'98).
[40] M. Nagl, “Set Theoretic Approaches to Graph Grammars,” Graph Grammars and Their Application to Computer Science, H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, eds., pp. 41–54, 1987.
[41] H. Ehrig, “Tutorial Introduction to the Algebraic Approach of Graph-Grammars,” Graph Grammars and Their Application to Computer Science, H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, eds., pp. 3–14, 1987.
[42] A. Schürr, “Introduction to PROGRES, an Attribute Graph Grammar Based Specification Language,” Graph-Theoretic Concepts in Computer Science, M. Nagl, ed., pp. 151–165, 1990.
[43] A. Schürr, “PROGRES: A VHL-Language Based on Graph Grammars,” Graph Grammars and Their Application to Computer Science, H. Ehrig, H.-J. Kreowski, and G. Rozenberg, eds., pp. 641–659, 1991.
[44] A. Schürr, Operationales Spezifizieren mit Programmierten Graphersetzungssystemen: Formale Definitionen Anwendungsbeispiele und Werkzeugunterstützung. Wiesbaden: Deutscher Universitäts-Verlag, 1991.
[45] A. Schürr, A.J. Winter, and A. Zündorf, “Graph Grammar Engineering with PROGRES,” Proc. Fifth European Software Eng. Conf., W. Schäfer and P. Botella, eds., pp. 219–234, 1995.
[46] A. Schürr, “Programmed Graph Replacement Sytems,” Handbook of Graph Grammars and Computing by Graph Transformation, G. Rozenberg, ed., vol. 1, chapter 7, pp. 479–541, 1997.
[47] C. Morgan, “Global and Logical Time in Distributed Algorithms,” Information Processing Letters, vol. 20, pp. 189–194, May 1985.
[48] M. Ahamad, P. Hutto, and R. John, “Implementing and Programming Causal Distributed Shared Memory,” Proc. 11th Int'l Conf. Distributed Computing Systems, 1991.
[49] K. Birman, A. Schiper, and P. Stephenson, “Lightweight Causal and Atomic Group Multicast,” ACM Trans. Computer Systems, vol. 9, no. 3, pp. 272-314, Aug. 1991.
[50] K.M. Chandy and L. Lamport, "Distributed Snapshots: Determining Global States of Distributed Systems," ACM Trans. Computer Systems, Feb. 1985.
[51] F. Mattern, “Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation,” J. Parallel and Distributed Computing, vol. 18, no. 4, pp. 423-434, Aug. 1993.
[52] M. Spezialetti and P. Kearns, “Efficient Distributed Snapshots,” IEEE Proc. Sixth Int'l Conf. Distributed Computing Systems, pp. 382–288, 1986.
[53] R. Cooper and K. Marzullo, "Consistent Detection of Global Predicates," in Proc. Workshop Parallel and Distributed Debugging, ACM Press, New York, pp. 163-173.
[54] D. Haban and W. Weigel, "Global Events and Global Breakpoints in Distributed Systems," Proc. 21st Hawaii Int'l Conf. Systems Sciences, pp. 166-175, 1989.
[55] W. Hseush and G. Kaiser, “Modeling Concurrency in Parallel Debugging,” ACM SIGPLAN Notices, vol. 25, no. 3, pp. 11–20, 1990.
[56] R. Netzer and B. Miller, "Optimal Tracing and Replay for Debugging Message-Passing Parallel Programs, Proc. Supercomputing '92, pp. 502-511, 1992.
[57] T.J. LeBlanc and J.M. Mellor-Crummey, "Debugging Parallel Programs with Instant Replay," IEEE Trans. Computers, vol. 36, no. 4, pp. 471-482, Apr. 1987.
[58] D.C. Luckham,J.J. Kenney,L.M. Augustin,J. Vera,D. Bryan,, and W. Mann,“Specification and analysis of system architecture usingRapide,” IEEE Transactions on Software Engineering, vol. 21, no. 4, pp. 336-355, Apr. 1995.
[59] ObjecTime Limited, ObjecTime Developer User's Guide. 1998.
[60] S. L. Peterson and P. Kearns, "Rollback Based on Vector Time," Proc. 12th Symp. Reliable Distributed Systems, IEEE Computer Society Press, Los Alamitos, Calif., 1993, pp. 68-77.
[61] B. Charron-Bost, “Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory,” Proc. Third Int'l Workshop Distributed Algorithms, J.-C. Bermond and M. Raynal, eds., pp. 45–56, 1989.
[62] K. Birman and T. Joseph., “Exploiting Virtual Synchrony in Distributed Systems,” Proc. ACM Symp. Operating Systems Principles, ACM Press, New York, 1987, pp. 123‐138.
[63] B. Liskov, "Distributed Programming in ARGUS," Comm. ACM, vol. 31, no. 3, Mar. 1988.
[64] P. Schuller, H. Hartig, and W.E. Kunhauser, “Performance of the BirLix Operating System,” Proc. USENIX Workshop Micro-Kernels and Other Kernel Architectures, USENIX Association, ed., pp. 147–160, Apr. 1992.
[65] S. Ahuja, N. Carriero, and D. Gelernter, “Linda and Friends,” Computer, vol. 19, no. 8, Aug. 1986.
[66] N. Carriero and D. Gelernter, "Linda in Context," Comm. ACM, vol. 32, no. 4, Apr. 1989, pp. 444-458.
[67] M. Nagl, “A Tutorial and Bibliographical Survey on Graph Grammars,” Graph-Grammars and Their Application to Computer Science and Biology, V. Claus, H. Ehrig, and G. Rozenberg, eds., pp. 70–126, 1979.
[68] M. Nagl, Building Tightly-Integrated (Software) Development Environments: The IPSEN Approach. Springer-Verlag, 1996.

Index Terms:
logical clock, causal order, software tracing, graph grammar, trace analysis, distributed programming, reverse engineering, event labeling, debugging, web services
Citation:
C.E. Hrischuk, C.M. Woodside, "Logical Clock Requirements for Reverse Engineering Scenarios from a Distributed System," IEEE Transactions on Software Engineering, vol. 28, no. 4, pp. 321-339, April 2002, doi:10.1109/TSE.2002.995416
Usage of this product signifies your acceptance of the Terms of Use.