loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
13th International Symposium on Software Reliability Engineering (ISSRE'02)
An Empirical Study of Tracing Techniques from a Failure Analysis Perspective
Annapolis, Maryland
November 12-November 15
ISBN: 0-7695-1763-3
Satya Kanduri, University of Nebraska - Lincoln
Sebastian Elbaum, University of Nebraska - Lincoln
Tracing is a dynamic analysis technique to continuously capture events of interest on a running program. The occurrence of a statement, the invocation of a function, and the trigger of a signal are examples of traced events. Software engineers employ traces to accomplish various tasks, ranging from performance monitoring to failure analysis. Despite its capabilities, tracing can negatively impact the performance and general behavior of an application. In order minimize that impact, traces are normally buffered and transferred to (slower) permanent storage at specific intervals. This scenario presents a delicate balance. Increased buffering can minimize the impact on the target program, but it increases the risk of losing valuable collected data the event of a failure. Frequent disk transfers can ensure traced data integrity, but it risks a high impact on the target program. We conducted an experiment involving six tracing schemes and various buffer sizes to address these trade-offs. Our results highlight opportunities for tailored tracing schemes that would benefit failure analysis.
Citation:
Satya Kanduri, Sebastian Elbaum, "An Empirical Study of Tracing Techniques from a Failure Analysis Perspective," issre, pp.280, 13th International Symposium on Software Reliability Engineering (ISSRE'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.