article

Free access

Event-based performance perturbation: a case study

Author:

Allen D. MalonyAuthors Info & Claims

ACM SIGPLAN Notices, Volume 26, Issue 7

Pages 201 - 212

https://doi.org/10.1145/109626.109646

Published: 01 April 1991 Publication History

PDF eReader

References

[1]

M. Abrams and A. Agrawala. Exact Performance Analysis of Two Distributed Proce#ae.# with Multiple Synchronization Points. Technical Report TR-1845, University of Maryland, Department of Computer Science, February 1987.

Google Scholar

[2]

S. Adve and M. Hill. Weak Ordering- A New Definition and Some Implications. in Proceedzngs of the Seventeenth International Symposi#lm on Computer Architecture, pages 2-14, Seattle, Washington, May 1990.

Digital Library

Google Scholar

[3]

R. Cytron. Compile-Time Schedllling and Optimization for Asynchronous Machines. PhD thesis, University of Illinois at Urbana-Champaign, Department of Computer Science, October 1984.

Digital Library

Google Scholar

[4]

J. Davies. Parallel Loop Constructs for Multiprocessors. Master's thesis, University of Illinois at Urbana-Champaign, Department of Computer Science, May 1981.

Google Scholar

[5]

C. Fidge. Partial Orders for Parallel Debugging. In Proceedings of the Workshop on Parallel and Distributed Debugging, pages 183-194. ACM SigpIan/Sigops, May 1988. University of Wisconsin.

Digital Library

Google Scholar

[6]

J. Gait. A Probe Effect in Concurrent Programs. Software Practice and Expemence, 16(3), March 1986.

Digital Library

Google Scholar

[7]

V. Hasse. Real-Time Behavior of Programs. IEEE Transactions on Software Engineering, 7(9):454- 501, September 1981.

Google Scholar

[8]

P. Heidelberger and K. Trivedi. Queueing Network Models for Parallel Processing with Asynchronous Tasks. IEEE Transact'tons on Computers, 31(11):1099-1109, November 1982.

Digital Library

Google Scholar

[9]

P. Heidelberger and K. Trivedi. Analytic Queueing Models for Programs with Internal Concurrency. IEEE Tranactions on Computers, 32(1):73- 82, January 1983.

Google Scholar

[10]

D. Helmbold and D. Bryan. Design of Run Time Monitors for Concurrent Programs. Technical Report CSL-TP#-89-395, Stanford University, October 1989.

Digital Library

Google Scholar

[11]

D. Kuck. The Structure of Computers and CoT#- putations. Wiley, New York, 1978.

Digital Library

Google Scholar

[12]

L. Lamport. Time, Clocks, and the Ordering of Events in a Distributed System. Commu#.ications of the A CM, 21(7):558-565, July 1978.

Digital Library

Google Scholar

[13]

L. Lamport. How to Make a Multiprocessor Computer that Correctly Executes M ultiprocess Programs. IEEE Tranac#ions on Computers, 28(9):690-691, September 1979.

Google Scholar

[14]

D. Lane. A Model of Time Dependent Behavior in Concurrent Software Systems. Technical Report TR-87-28, University of California, Irvine, Department of Information and Computer Science, November 1987.

Google Scholar

[15]

C. LeDoux and D. Parker. Saving Traces for Ada Debugging. In Proceedings of #he SIGAda International Ada Conference, pages 1-12, 1985.

Digital Library

Google Scholar

[16]

T. Lehr. Comensating for Perturbation by Software Performance Monitors in Asynchronous Computations. PhD thesis, Carnegie-Mellon University, Department of Computer Science, April 1990.

Digital Library

Google Scholar

[17]

V. Mak. Performance Prediction of Concurrent Systems. Technical Report CSL-TR-87-344, Stanford University, December 1987.

Google Scholar

[18]

A. Malony. Performance Observability. PhD thesis, University of Illinois at Urbana-Champaign, Department of Computer Science, September 1990.

Digital Library

Google Scholar

[19]

A. Malony, D. Reed, and H. Wijshoff. Performance Measurement Intrusion and Perturbation Analysis. Technical Report CSRD-923, University of Illinois at Urbana-Champaign, Center for Supercomputing Research and Development, October 1989.

Google Scholar

[20]

F. McMahon. The Livermore Fortran Kernels: A Computer Test of the Numerical Performance Range. Technical Report UCRL-53745, Lawrence Livermore National Laboratory, December 1986.

Google Scholar

[21]

:i. Mellor-Crumm#y. Debugging and Analysi# of Large-Scale Parallel Programs. PhD thesis, University of Rochester, Department of Computer Science, September 1989.

Digital Library

Google Scholar

[22]

J. Mohan. Performance of Parallel Programs. PhD thesis, Carnegie-Mellon University, Department of Computer Science, July 1984.

Digital Library

Google Scholar

[23]

R. Netzer and B. Miller. On the Complexity of Event Ordering for Shared Memory Parallel Program Executions. Technical Report CS-908, University of Wisconsin at Madison, Department of Computer Science, January 1990.

Google Scholar

[24]

R. Perron and C. Mundie. The Architecture of the Alliant FX/8 Computer. In Spring COMPCON '86, pages 390-393, March 1986.

Google Scholar

[25]

V. Pratt. Modeling Concurrency with Partial Orders. International Journal of Parallel Programming, 15(1), 1986.

Digital Library

Google Scholar

[26]

A. Shaw. Reasoning About Time in Higher-Level Language Software. IEEE Transactions on Software Engineering, 15(7):875-889, July 1989.

Digital Library

Google Scholar

[27]

A. Thomasian and P. Bay. Queueing Network Models for Parallel Processing of Task Systems. In Proceedings of #he 1983 International Conference on Parallel Processing, pages 421-428, August 1983.

Google Scholar

[28]

A. Thomasian and P. Bay. Analytic Queueing Network Models for Parallel Processing of Task Systems. IEEE Tranactions on Computers, 35(12):1045-1054, December 1986.

Digital Library

Google Scholar

[29]

M. Wolfe. Optimizing Supercompilers for Supercomputers. PhD thesis, University of Illinois at Urbana-Champaign, Department of Computer Science, 1982.

Digital Library

Google Scholar

Cited By

View all

Schuchart JGerndt MKjeldsberg PLysaght MHorák DŘíha LGocht ASourouri MKumaraswamy MChowdhury AJahre MDiethelm KBouizi OMian UKružík JSojka RBeseda MKannan VBendifallah ZHackenberg DNagel W(2017)The READEX formalism for automatic tuning for energy efficiencyComputing10.1007/s00607-016-0532-799:8(727-745)Online publication date: 10-Jan-2017
https://doi.org/10.1007/s00607-016-0532-7
Ben-Asher YStein E(2005)Basic results in automatic transformations of shared memory parallel programs into sequential programsAdvances in Computing Science — ASIAN'9710.1007/3-540-63875-X_64(351-366)Online publication date: 1-Aug-2005
https://doi.org/10.1007/3-540-63875-X_64
Malony AShende S(2005)Models for on-the-fly compensation of measurement overhead in parallel performance profilingProceedings of the 11th international Euro-Par conference on Parallel Processing10.1007/11549468_11(72-82)Online publication date: 30-Aug-2005
https://dl.acm.org/doi/10.1007/11549468_11
Show More Cited By

Index Terms

Recommendations

Infinitesimal perturbation analysis for general discrete event systems

A rigorous extension of the recent perturbation analysis approach to more general discrete event systems is given. First, a general class of systems and performance measures is defined, and some basic reprsentational and linearity properties are ...
Performance Measurement Intrusion and Perturbation Analysis

The authors study the instrumentation perturbations of software event tracing on the Alliant FX/80 vector multiprocessor in sequential, vector, concurrent, and vector-concurrent modes. Based on experimental data, they derive a perturbation model that ...
Event-Based Performance Analysis
IWPC '03: Proceedings of the 11th IEEE International Workshop on Program Comprehension

Understanding performance and related issues in a complex system requires analyzing where and why the program spends its resources. In a reactive system such as a interactive application or a server, it is important for understanding that one be able to ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 26, Issue 7

July 1991

223 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/109626

Editor:
Richard L. Wexelblat
IDA/CSED, Alexandria, VA

Issue’s Table of Contents

PPOPP '91: Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
April 1991
223 pages
ISBN:0897913906
DOI:10.1145/109625
Chairman:
David S. Wise
Indiana Univ., Bloomington

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1991

Published in SIGPLAN Volume 26, Issue 7

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
387
Total Downloads

Downloads (Last 12 months)52
Downloads (Last 6 weeks)13

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Schuchart JGerndt MKjeldsberg PLysaght MHorák DŘíha LGocht ASourouri MKumaraswamy MChowdhury AJahre MDiethelm KBouizi OMian UKružík JSojka RBeseda MKannan VBendifallah ZHackenberg DNagel W(2017)The READEX formalism for automatic tuning for energy efficiencyComputing10.1007/s00607-016-0532-799:8(727-745)Online publication date: 10-Jan-2017
https://doi.org/10.1007/s00607-016-0532-7
Ben-Asher YStein E(2005)Basic results in automatic transformations of shared memory parallel programs into sequential programsAdvances in Computing Science — ASIAN'9710.1007/3-540-63875-X_64(351-366)Online publication date: 1-Aug-2005
https://doi.org/10.1007/3-540-63875-X_64
Malony AShende S(2005)Models for on-the-fly compensation of measurement overhead in parallel performance profilingProceedings of the 11th international Euro-Par conference on Parallel Processing10.1007/11549468_11(72-82)Online publication date: 30-Aug-2005
https://dl.acm.org/doi/10.1007/11549468_11
Malony AShende S(2004)Overhead Compensation in Performance ProfilingEuro-Par 2004 Parallel Processing10.1007/978-3-540-27866-5_16(119-132)Online publication date: 2004
https://doi.org/10.1007/978-3-540-27866-5_16
Hall RMontgomery T(1992)Call path profilingProceedings of the 14th international conference on Software engineering10.1145/143062.143147(296-306)Online publication date: 1-Jun-1992
https://dl.acm.org/doi/10.1145/143062.143147
Kambadur MTang KKim MLu STorrellas J(2012)HarmonyProceedings of the 39th Annual International Symposium on Computer Architecture10.5555/2337159.2337211(452-463)Online publication date: 9-Jun-2012
https://dl.acm.org/doi/10.5555/2337159.2337211
Kambadur MTang KKim M(2012)HarmonyACM SIGARCH Computer Architecture News10.1145/2366231.233721140:3(452-463)Online publication date: 9-Jun-2012
https://dl.acm.org/doi/10.1145/2366231.2337211
Malony AShende SMorris AWolf F(2007)Compensation of Measurement Overhead in Parallel Performance ProfilingInternational Journal of High Performance Computing Applications10.1177/109434200707786221:2(174-194)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.1177/1094342007077862
Wolf FMalony AShende SMorris A(2005)Trace-based parallel performance overhead compensationProceedings of the First international conference on High Performance Computing and Communications10.1007/11557654_72(617-628)Online publication date: 21-Sep-2005
https://dl.acm.org/doi/10.1007/11557654_72
Shende SMalony AMorris AWolf F(2005)Performance profiling overhead compensation for MPI programsProceedings of the 12th European PVM/MPI users' group conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface10.1007/11557265_47(359-367)Online publication date: 18-Sep-2005
https://dl.acm.org/doi/10.1007/11557265_47
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Infinitesimal perturbation analysis for general discrete event systems

Performance Measurement Intrusion and Perturbation Analysis

Event-Based Performance Analysis

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations