article

Free access

Partial orders for parallel debugging

Author:

C. J. FidgeAuthors Info & Claims

ACM SIGPLAN Notices, Volume 24, Issue 1

Pages 183 - 194

https://doi.org/10.1145/69215.69233

Published: 01 November 1988 Publication History

Abstract

Parallel programs differ from sequential programs primarily in that the temporal relationships between events are only partially defined. However, for a given distributed computation, debugging utilities typically linearize the observed set of events into a total ordering, thus losing information and allowing potentially capturable temporal errors to escape detection. We explore use of the partially ordered relation “happened before” to augment both centralized and distributed parallel debuggers to ensure that such errors are always detected and that the results produced by the debugger are unaffected by the non-determinism inherent in the partial ordering. This greatly reduces the number of tests required during debugging. Assertions are based on time intervals, rather than treating events as dimensionless points.

References

[1]

J.F. Allen, "Maintaining Knowledge about TemporM Intervals", Communication8 of the AUM, Vol. 26, No. 11, November 1983.

Digital Library

[2]

F. Baiardi, N. DeFYartcesco and G. VaglinJ, "Development of a Debugger for a Concurrent Language", IEEE Transactions on Sofltware Engineering, Vol. SE-12, No. 4, April 1986.

Digital Library

[3]

CORNAFION, Distributed Computing Systems: Communication, Cooperation, Consistency, Elsevier Science Publishers, 1985.

Digital Library

[4]

C.J. Fidge, "Reproducible Tests in CSP", Proceedings o} the 10~h Australian Computer Science Conference, Deakin University, Februea'y 1987. Repril~ted in The Australian Computer Journal, Vol. 19, No. 2, May 1987.

[5]

C.J. Fidge, "Timestamps in Message-Passing Systems That Preserve the Partial Ordering", Proceedings o} the 11th Australian Computer Science ConJerence, University of Queensland, Februoa-y 1988.

[6]

J. Gait, "A Probe Effect in Concurrent Programs", Software--Practice and Experience, Vol. 16, No. 3, March 1988.

Digital Library

[7]

G.S. Goldszmidt, S. Kat~ and S. Yemelfi, "Interactive Blackbox Debugging for Concurrent Languages", Israel

[8]

C.A.R. Hoare, Communicatiu9 Seqateu~ial Processes, Prentice-HaU International Series in Computer Science, 1985.

Digital Library

[9]

J. Joyce, G. Lomow, K. Slind and B. Unger, "Mo:fitoring Distributed Systems", A CI~I Transactions on Computer Systems, Vol. 5, No. 2, May 1987.

Digital Library

[10]

L. Laanport, "Time, Clocks and the Ordering of Events in a Distributed System", Commuuicationn o} the AGM, Vol. 21, No. 7, July 1978.

Digital Library

[11]

L. Lamport, "Timesets: A New Method for Temporal Reasoning About Programs", in Logics o} Programs, D. Kozen (ed.}, Springer-Verlag Lecture Notes ill (~omputer Science No. 131, 1981.

Digital Library

[12]

T.J. LeBlanc and J.M. Mellor-Crunmmy, "Debugging Parallel Progroans with Instant Replay", {EEE Transactions on Computers, Vol. C-36, No. 4, April 1987.

Digital Library

[13]

V. Pratt, "Modelling Concurrency with Partial Orders", International Journal of Parallel Programming, Vol. 15, No. 1, 1986.

Digital Library

[14]

P. Qtfinton and J-P. Verjus, "Distributed Synchronization of Paa'allel Programs: Why and How?", in Parallel Algorithms and Architectures, M, Cosnm-d et al (eds.), North-Holland, 1986.

Digital Library

[15]

W. Reisig, "Partial Order Semantics Vemus Interleaving Semantics for CSP-like Languages and its Impact on Fairness*', 11~h Colloquium on Automata, Languages and Programming, Belgium, LNCS 172, July 1984.

Digital Library

[16]

S.M. Shatz and J-P. Wang, "hatroduction to Distributed Software Engineering", IEEE Computer, Vol. 20, No. 10, October 1987.

Digital Library

Cited By

Kuzmin OStarkov B(2021)Application of hierarchical structures based on binary matrices with the generalized arithmetic of Pascal’s triangle in route building problemsJournal of Physics: Conference Series10.1088/1742-6596/1847/1/0120301847:1(012030)Online publication date: 1-Mar-2021
https://doi.org/10.1088/1742-6596/1847/1/012030
Garg VGarg RHansdah RKrishnaswamy DVaidya N(2019)Parallel algorithms for predicate detectionProceedings of the 20th International Conference on Distributed Computing and Networking10.1145/3288599.3288604(51-60)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1145/3288599.3288604
Kulkarni SVaidya NSchiller ESchwarzmann A(2017)Effectiveness of Delaying Timestamp ComputationProceedings of the ACM Symposium on Principles of Distributed Computing10.1145/3087801.3087818(263-272)Online publication date: 25-Jul-2017
https://dl.acm.org/doi/10.1145/3087801.3087818
Show More Cited By

Index Terms

Partial orders for parallel debugging
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
2. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Software defect analysis
        Software testing and debugging

Recommendations

Partial orders for parallel debugging
PADD '88: Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging

Parallel programs differ from sequential programs primarily in that the temporal relationships between events are only partially defined. However, for a given distributed computation, debugging utilities typically linearize the observed set of events ...
Debugging Im Informatikunterricht
Model Predictive Control for Partial Differential Equations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 24, Issue 1

Special issue: Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on parallel and distributed debugging

Jan. 1989

280 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/69215

Editor:
Richard L. Wexelblat

Issue’s Table of Contents

PADD '88: Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging
November 1988
282 pages
ISBN:0897912969
DOI:10.1145/68210
Editor:
Richard L. Wexelbalt

Copyright © 1988 ACM.

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

172
Total Citations
View Citations
752
Total Downloads

Downloads (Last 12 months)58
Downloads (Last 6 weeks)9

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kuzmin OStarkov B(2021)Application of hierarchical structures based on binary matrices with the generalized arithmetic of Pascal’s triangle in route building problemsJournal of Physics: Conference Series10.1088/1742-6596/1847/1/0120301847:1(012030)Online publication date: 1-Mar-2021
https://doi.org/10.1088/1742-6596/1847/1/012030
Garg VGarg RHansdah RKrishnaswamy DVaidya N(2019)Parallel algorithms for predicate detectionProceedings of the 20th International Conference on Distributed Computing and Networking10.1145/3288599.3288604(51-60)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1145/3288599.3288604
Kulkarni SVaidya NSchiller ESchwarzmann A(2017)Effectiveness of Delaying Timestamp ComputationProceedings of the ACM Symposium on Principles of Distributed Computing10.1145/3087801.3087818(263-272)Online publication date: 25-Jul-2017
https://dl.acm.org/doi/10.1145/3087801.3087818
Attiya HEllen FMorrison A(2017)Limitations of Highly-Available Eventually-Consistent Data StoresIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2016.255666928:1(141-155)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1109/TPDS.2016.2556669
Attiya HEllen FMorrison AGeorgiou CSpirakis P(2015)Limitations of Highly-Available Eventually-Consistent Data StoresProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767419(385-394)Online publication date: 21-Jul-2015
https://dl.acm.org/doi/10.1145/2767386.2767419
Lu KZhou XBergan TWang X(2014)Efficient deterministic multithreading without global barriersACM SIGPLAN Notices10.1145/2692916.255525249:8(287-300)Online publication date: 6-Feb-2014
https://dl.acm.org/doi/10.1145/2692916.2555252
Lu KZhou XBergan TWang XMoreira JLarus J(2014)Efficient deterministic multithreading without global barriersProceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming10.1145/2555243.2555252(287-300)Online publication date: 6-Feb-2014
https://dl.acm.org/doi/10.1145/2555243.2555252
Garg VAgarwal AOgale V(2014)Modeling, analyzing and slicing periodic distributed computationsInformation and Computation10.1016/j.ic.2013.11.002234(26-43)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1016/j.ic.2013.11.002
ZHOU XLU KWANG XZHANG WZHANG KLI XLI G(2013)Deterministic Message Passing for Distributed Parallel ComputingIEICE Transactions on Information and Systems10.1587/transinf.E96.D.1068E96.D:5(1068-1077)Online publication date: 2013
https://doi.org/10.1587/transinf.E96.D.1068
Becker DGeimer MRabenseifner RWolf F(2013)Extending the scope of the controlled logical clockCluster Computing10.1007/s10586-011-0181-816:1(171-189)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1007/s10586-011-0181-8
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents