Dependable software needs pervasive debugging

ABSTRACT

Nobody would claim that debugging computer software is easy: all too often it proceeds by trial-and-error experiments in which programmers examine the behaviour of the system and form hypotheses that could explain what they see. These problems are exacerbated when developing distributed, peer-to-peer or multi-processor applications, or when unreliable network links form part of the system under test. Environments for pervasive computing take this to an extreme, allowing user-supplied code to run or migrate within and around the network.In this paper we show how to perform pervasive debugging, enabling complex multi-process applications to be debugged and controlled as single entities and their robustness to changes in network performance to be evaluated. We do this by virtualizing the resources used by the system, allowing the threads that it involves and the network links that it uses to be modelled within a single controllable process.

REFERENCES

• 1: Sarita V. Adve , Kourosh Gharachorloo, Shared Memory Consistency Models: A Tutorial, Computer, v.29 n.12, p.66-76, December 1996 [doi>10.1109/2.546611]
• 2: Bob Boothe, Efficient algorithms for bidirectional debugging, ACM SIGPLAN Notices, v.35 n.5, p.299-310, May 2000
• 3: Eric A. Brewer , William E. Weihl, Developing parallel applications using high-performance simulation, Proceedings of the 1993 ACM/ONR workshop on Parallel and distributed debugging, p.158-168, May 17-18, 1993, San Diego, California, United States
• 4: D. Bruening. Systematic testing of multithreaded Java programs, 1999.
• 5: Jong-Deok Choi , Harini Srinivasan, Deterministic replay of Java multithreaded applications, Proceedings of the SIGMETRICS symposium on Parallel and distributed tools, p.48-59, August 03-04, 1998, Welches, Oregon, United States [doi>10.1145/281035.281041]
• 6: R. C. B. Cooper. Debugging concurrent and distributed programs. PhD thesis, University of Cambridge Computer Laboratory, Feb. 1988. Also available as UCAM-CL-TR-128.
• 7: John Domingue , Paul Mulholland, Fostering debugging communities on the Web, Communications of the ACM, v.40 n.4, p.65-71, April 1997 [doi>10.1145/248448.248460]
• 8: Sally Floyd , Van Jacobson, The synchronization of periodic routing messages, IEEE/ACM Transactions on Networking (TON), v.2 n.2, p.122-136, April 1994 [doi>10.1109/90.298431]
• 9: Robert Hood, The p2d2 project: building a portable distributed debugger, Proceedings of the SIGMETRICS symposium on Parallel and distributed tools, p.127-136, May 22-23, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/238020.238058]
• 10: James R. Larus, Whole program paths, Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, p.259-269, May 01-04, 1999, Atlanta, Georgia, United States
• 11: T. J. LeBlanc , J. M. Mellor-Crummey, Debugging parallel programs with instant replay, IEEE Transactions on Computers, v.36 n.4, p.471-482, April 1987 [doi>10.1109/TC.1987.1676929]
• 12: I. M. Leslie, D. McAuley, R. Black, T. Roscoe, P. Barham, D. Evers, R. Fairbairns, and E. Hyden. The design and implementation of an operating system to support distributed multimedia applications. IEEE Journal on Selected Areas In Communications, 14(7):1280--1297, Sept. 1996.
• 13: J. M. Mellor-Crummey , T. J. LeBlanc, A software instruction counter, Proceedings of the third international conference on Architectural support for programming languages and operating systems, p.78-86, April 03-06, 1989, Boston, Massachusetts, United States
• 14: William Pugh, Fixing the Java memory model, Proceedings of the ACM 1999 conference on Java Grande, p.89-98, June 12-14, 1999, San Francisco, California, United States [doi>10.1145/304065.304106]
• 15: Dickon Reed , Ian Pratt , Paul Menage , Stephen Early , Neil Stratford, Xenoservers: Accountable Execution of Untrusted Programs, Proceedings of the The Seventh Workshop on Hot Topics in Operating Systems, p.136, March 28-30, 1999
• 16: Stefan Savage , Michael Burrows , Greg Nelson , Patrick Sobalvarro , Thomas Anderson, Eraser: a dynamic data race detector for multithreaded programs, ACM Transactions on Computer Systems (TOCS), v.15 n.4, p.391-411, Nov. 1997 [doi>10.1145/265924.265927]
• 17: D. L. Tennenhouse, J. M. Smith, W. D. Sincoskie, D. J. Wetherall, and G. J. Minden. A survey of active network research. IEEE Communications Magazine, 35(1):80--86, Jan. 1997.
• 18: Robert Wahbe , Steven Lucco , Thomas E. Anderson , Susan L. Graham, Efficient software-based fault isolation, Proceedings of the fourteenth ACM symposium on Operating systems principles, p.203-216, December 05-08, 1993, Asheville, North Carolina, United States
• 19: Youtao Zhang , Rajiv Gupta, Timestamped whole program path representation and its applications, ACM SIGPLAN Notices, v.36 n.5, p.180-190, May 2001