research-article

Efficient program tracing

Staff:

Computer StaffAuthors Info & Claims

Computer, Volume 26, Issue 5

Pages 52 - 61

https://doi.org/10.1109/2.211900

Published: 01 May 1993 Publication History

Abstract

A program trace lists the addresses of instructions executed and data referenced during a program's execution. Earlier approaches to collecting program traces, including abstract execution and optimal control tracing, are reviewed. Two tracing systems based on these techniques are presented. Results collected when using the later systems on several programs show significant reductions in the cost of collecting traces. Reduction in trace file sizes are also significant.

References

[1]

1. C.B. Stunkel, B. Janssens, and W.K. Fuchs, "Address Tracing for Parallel Machines," Computer, Vol. 24, No. 1, Jan. 1991, pp. 31-45.

[2]

1. J.R. Larus, "Abstract Execution: A Technique for Efficiently Tracing Programs," Software Practice & Experience, Vol. 20, No. 12, Dec. 1990, pp. 1,241- 1,258.

Digital Library

[3]

2. T. Ball and J.R. Larus, "Optimally Profiling and Tracing Programs," Conf. Record 19th Ann. ACM Symp. Principles of Programming Languages, ACM Press, New York, 1992, pp. 59-70.

[4]

1. T. Ball and J.R. Larus, "Optimally Profiling and Tracing Programs," Conf. Record of the 19th Ann. ACM Symp. Principles of Programming Languages, ACM Press, New York, 1992, pp. 59-70.

[5]

2. S.L. Graham, P.B. Kessler, and M.K. McKusick, "An Execution Profiler for Modular Programs," Software Practice & Experience, Vol. 13, 1983, pp. 671-685.

[6]

3. A.D. Samples, "Mache: No-Loss Trace Compaction," Proc. 1989 ACM SIGMetrics Conf. Measuring and Modeling of Computer Systems, ACM Press, New York, 1989, pp. 89-97.

[7]

4. C.A. Wiecek, "A Case Study of VAX-11 Instruction Set Usage for Compiler Execution," Proc. Symp. Architectural Support for Programming Languages and Operating Systems, ACM Press, New York, 1982, pp. 177-184.

[8]

5. R.R. Henry, "VAX Address and Instruction Traces," Tech. Report, Univ. of California, Berkeley, 1983.

[9]

6. A. Agarwal, R.L. Sites, and M. Horwitz, "ATUM: A New Technique for Capturing Address Traces Using Microcode," in Proc. 13th Ann. Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., Order No. 719, 1986, pp. 119- 127.

[10]

7. C.B. Stunkel, B. Janssens, and W.K. Fuchs, "Address Tracing for Parallel Machines," Computer, Vol. 24, No. 1, Jan. 1991, pp. 31-45.

[11]

8. A. Borg, R.E. Kessler, and D.W. Wall, "Generation and Analysis of Very Long Address Traces," Proc. 17th Ann. Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., Order No. 2047, 1990, pp. 270-281.

[12]

9. S.J. Eggers et al., "Techniques for Efficient In-Line Tracing on a Shared-Memory Multiprocessor," Proc. 1990 ACM SIGMetrics Conf. Measuring and Modeling of Computer Systems, ACM Press, New York, 1990, pp. 37-47.

[13]

10. J.R. Larus, "Abstract Execution: A Technique for Efficiently Tracing Programs," Software Practice & Experience, Vol. 20, No. 12, Dec. 1990, pp. 1,241-1,258.

Digital Library

[14]

11. A.V. Aho, R. Sethi, and J.D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley, Reading, Mass., 1985.

[15]

12. J.R. Larus, "Estimating the Potential Parallelism in Programs," in Proc. Third Workshop on Languages and Compilers for Parallel Computing, Nicolau et al., eds., MIT Press, Cambridge, Mass., pp. 331-349.

Cited By

Li HWu YHuang Y(2022)On the Feasibility of Anomaly Detection with Fine-Grained Program Tracing EventsJournal of Network and Systems Management10.1007/s10922-021-09635-330:2Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s10922-021-09635-3
Ketterlin AClauss P(2014)Recovering memory access patterns of executable programsScience of Computer Programming10.5555/2748144.274839880:PB(440-456)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.5555/2748144.2748398
Ketterlin AClauss P(2012)Profiling Data-Dependence to Assist ParallelizationProceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture10.1109/MICRO.2012.47(437-448)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1109/MICRO.2012.47
Show More Cited By

Recommendations

Distributed program tracing
ESEC/FSE 2013: Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering

Dynamic program analysis techniques depend on accurate program traces. Program instrumentation is commonly used to collect these traces, which causes overhead to the program execution. Various techniques have addressed this problem by minimizing the ...
Public-key traitor tracing from efficient decoding and unbounded enrollment: extended abstract
DRM '08: Proceedings of the 8th ACM workshop on Digital rights management

Public-key traitor-tracing schemes is a supporting technology for content distribution that discourages abuse and resale of cryptographic keys used for the distribution. These schemes enable a system manager to maintain a set of subscribers so that any ...
Efficient Dynamic Traitor Tracing

The notion of traitor tracing was introduced by Chor, Fiat, and Naor [ Tracing Traitors , Lecture Notes in Comput. Sci. 839, 1994, pp. 257--270] in order to combat piracy scenarios. Recently, Fiat and Tassa [ Tracing Traitors , Lecture Notes in ...

Comments

Information & Contributors

Information

Published In

cover image Computer

Computer Volume 26, Issue 5

May 1993

91 pages

ISSN:0018-9162

Issue’s Table of Contents

Copyright © Copyright © 1993 IEEE. All Rights Reserved.

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 01 May 1993

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li HWu YHuang Y(2022)On the Feasibility of Anomaly Detection with Fine-Grained Program Tracing EventsJournal of Network and Systems Management10.1007/s10922-021-09635-330:2Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s10922-021-09635-3
Ketterlin AClauss P(2014)Recovering memory access patterns of executable programsScience of Computer Programming10.5555/2748144.274839880:PB(440-456)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.5555/2748144.2748398
Ketterlin AClauss P(2012)Profiling Data-Dependence to Assist ParallelizationProceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture10.1109/MICRO.2012.47(437-448)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1109/MICRO.2012.47
Milenković AMilenković M(2007)An efficient single-pass trace compression technique utilizing instruction streamsACM Transactions on Modeling and Computer Simulation10.1145/1189756.118975817:1(2-es)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1145/1189756.1189758
Burton AKelly P(2006)Performance prediction of paging workloads using lightweight tracingFuture Generation Computer Systems10.1016/j.future.2006.02.00322:7(784-793)Online publication date: 1-Aug-2006
https://dl.acm.org/doi/10.1016/j.future.2006.02.003
Raza AVogel GPlödereder E(2006)BauhausProceedings of the 11th Ada-Europe international conference on Reliable Software Technologies10.1007/11767077_6(71-82)Online publication date: 5-Jun-2006
https://dl.acm.org/doi/10.1007/11767077_6
Luo YJohn L(2004)Locality-Based Online Trace CompressionIEEE Transactions on Computers10.1109/TC.2004.1253:6(723-731)Online publication date: 1-Jun-2004
https://dl.acm.org/doi/10.1109/TC.2004.12
Wang CHill JKnight JDavidson J(2001)Protection of Software-Based Survivability MechanismsProceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)10.5555/647882.738073(193-202)Online publication date: 1-Jul-2001
https://dl.acm.org/doi/10.5555/647882.738073
Ravindran RMoona R(2001)Retargetable cache simulation using high level processor modelsAustralian Computer Science Communications10.5555/545615.54561023:4(114-121)Online publication date: 15-Jan-2001
https://dl.acm.org/doi/10.5555/545615.545610
Ravindran RMoona RHeiser G(2001)Retargetable cache simulation using high level processor modelsProceedings of the 6th Australasian conference on Computer systems architecture10.5555/545596.545610(114-121)Online publication date: 29-Jan-2001
https://dl.acm.org/doi/10.5555/545596.545610
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents