article

Free access

A graphical representation of concurrent processes

Author:

Janice M. StoneAuthors Info & Claims

ACM SIGPLAN Notices, Volume 24, Issue 1

Pages 226 - 235

https://doi.org/10.1145/69215.69237

Published: 01 November 1988 Publication History

PDF eReader

Abstract

This paper describes a graphical representation called a concurrency map. It provides a succinct representation of the potentially large collection of possible correct event-orderings for a set of concurrent processes.

The normal problems of monitoring, debugging and analyzing performance of single-process programs are compounded for programs with concurrent processes. Although we can observe the behavior of each separate process, we do not know what is occurring concurrently in the various processes during successive moments as execution progresses. Furthermore, unknown timing delays among the processes may cause different program behavior when we rerun the program. The relative time-ordering of events in different concurrent processes is not, in general, fixed, and events that occurred in one order on one occasion on which the program performed correctly might occur in another order on another occasion, with equal correctness. We need to know both how the program behaved during execution and how that behavior might have differed under normal variations of concurrent execution. The concurrency map aids in solving these problems.

References

[1]

Baiardi, Fabrizio, Nicoletta De Francesco, and Cigliola Vaglini. Development of a Debugger for a Concurrent Language. IEEE Transactions on Soft~are Engineering, SE-12(4):547-553, April 1986.

Digital Library

Google Scholar

[2]

Bates, Peter and J. Wileden. High Level Debugging of Distributed Systems: The Behavioral Abstraction Approach. The Journal of Sygtems and Software, 3(4):255-267, December 1983.

Digital Library

Google Scholar

[3]

Chandy, K. Mani and Leslie Lamport. Distributed Snapshots: Determining Global States of Distributed Systems.,4 CM Transactions otz Computer Systems, 3( 1 ): (~3-7 5, February 1985.

Digital Library

Google Scholar

[4]

Isoda, Sadahiro, Takao Shimomura, and Yuji Ono. VIPS: A Visual Debugger. IEEE Software, 4(3):8-19, May 1987.

Digital Library

Google Scholar

[5]

LeBlanc, Thomas J. and john M. Mellor-Crummey. Debugging Parallel Programs with Instant Replay. IEEE Trans on Computers, C-36(4):471-482, April 1987.

Digital Library

Google Scholar

[6]

Miller, Barton P. and Yang Cui-Qing. IPS: an interactive and Automatic Performance Measurement Tool for Parallel and Distributed Programs, University of Wisconsin, Report TR 613, 1987.

Google Scholar

[7]

J. M. Stone. Visualizing concurrent processes, IBM T. J. Watson Research Center, RC 12973, July 1987.

Google Scholar

[8]

J. M. Stone. Debugging concurrent processes: a case study. Proceedings ACM SIGPLAN '88 Programming Language Design and Implementation, June 1988, to appear.

Digital Library

Google Scholar

[9]

Strom, Robert E. and Shaula Yemini. Optimistic recovery in distributed systems. ACM Trans on Computer Systems, 3(3):204-226, At~gust 1985.

Digital Library

Google Scholar

Cited By

View all

Beschastnikh IBrun YErnst MKrishnamurthy AAnderson T(2012)Mining temporal invariants from partially ordered logsACM SIGOPS Operating Systems Review10.1145/2094091.209410145:3(39-46)Online publication date: 11-Jan-2012
https://dl.acm.org/doi/10.1145/2094091.2094101
Beschastnikh IBrun YErnst MKrishnamurthy AAnderson T(2011)Mining temporal invariants from partially ordered logsManaging Large-scale Systems via the Analysis of System Logs and the Application of Machine Learning Techniques10.1145/2038633.2038636(1-10)Online publication date: 23-Oct-2011
https://dl.acm.org/doi/10.1145/2038633.2038636
Leu ESchiper A(2005)Execution replay: A mechanism for integrating a visualization tool with a symbolic debuggerParallel Processing: CONPAR 92—VAPP V10.1007/3-540-55895-0_398(55-66)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-55895-0_398
Show More Cited By

Index Terms

A graphical representation of concurrent processes

Recommendations

A graphical representation of concurrent processes
PADD '88: Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging

This paper describes a graphical representation called a concurrency map. It provides a succinct representation of the potentially large collection of possible correct event-orderings for a set of concurrent processes.

The normal problems of monitoring, ...
Concurrent data representation synthesis
PLDI '12

We describe an approach for synthesizing data representations for concurrent programs. Our compiler takes as input a program written using concurrent relations and synthesizes a representation of the relations as sets of cooperating data structures as ...
Looking for efficient implementations of concurrent objects
PaCT'11: Proceedings of the 11th international conference on Parallel computing technologies

As introduced by Taubenfeld, a contention-sensitive implementation of a concurrent object is an implementation such that the overhead introduced by locking is eliminated in the common cases, i.e., when there is no contention or when the operations ...

Comments

Information & Contributors

Information

Published In

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 November 1988

Published in SIGPLAN Volume 24, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
Total Citations
View Citations
586
Total Downloads

Downloads (Last 12 months)154
Downloads (Last 6 weeks)17

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Beschastnikh IBrun YErnst MKrishnamurthy AAnderson T(2012)Mining temporal invariants from partially ordered logsACM SIGOPS Operating Systems Review10.1145/2094091.209410145:3(39-46)Online publication date: 11-Jan-2012
https://dl.acm.org/doi/10.1145/2094091.2094101
Beschastnikh IBrun YErnst MKrishnamurthy AAnderson T(2011)Mining temporal invariants from partially ordered logsManaging Large-scale Systems via the Analysis of System Logs and the Application of Machine Learning Techniques10.1145/2038633.2038636(1-10)Online publication date: 23-Oct-2011
https://dl.acm.org/doi/10.1145/2038633.2038636
Leu ESchiper A(2005)Execution replay: A mechanism for integrating a visualization tool with a symbolic debuggerParallel Processing: CONPAR 92—VAPP V10.1007/3-540-55895-0_398(55-66)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-55895-0_398
Kraemer EStasko J(1998)Creating an Accurate Portrayal of Concurrent ExecutionsIEEE Concurrency10.1109/4434.6567786:1(36-46)Online publication date: 1-Jan-1998
https://dl.acm.org/doi/10.1109/4434.656778
Paganelli FWinter SWilson D(1997)A framework for virtually transparent monitoring of parallel programsJournal of Systems Architecture: the EUROMICRO Journal10.1016/S1383-7621(96)00054-943:6-7(403-423)Online publication date: 15-Apr-1997
https://dl.acm.org/doi/10.1016/S1383-7621%2896%2900054-9
Karam G(1994)Visualization using timelinesProceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis10.1145/186258.187157(125-137)Online publication date: 1-Aug-1994
https://dl.acm.org/doi/10.1145/186258.187157
Kraemer EStasko J(1994)Issues in visualization for the comprehension of parallel programsProceedings 1994 IEEE 3rd Workshop on Program Comprehension- WPC '9410.1109/WPC.1994.341259(116-125)Online publication date: 1994
https://doi.org/10.1109/WPC.1994.341259
Kraemer EStasko J(1994)Toward flexible control of the temporal mapping from concurrent program events to animationsProceedings of 8th International Parallel Processing Symposium10.1109/IPPS.1994.288199(902-908)Online publication date: 1994
https://doi.org/10.1109/IPPS.1994.288199
Schwarz RMattern F(1994)Detecting causal relationships in distributed computationsDistributed Computing10.1007/BF022778597:3(149-174)Online publication date: 1-Mar-1994
https://dl.acm.org/doi/10.1007/BF02277859
Kolosova Y(1994)Parallel histories ? bases for detection of free and speed-competitive processesCybernetics and Systems Analysis10.1007/BF0112587529:4(593-601)Online publication date: 1994
https://doi.org/10.1007/BF01125875
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.

Abstract

References

Cited By

Index Terms

Recommendations