Affiliation:
1. Australian National Univ., Canberra, Australia
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference16 articles.
1. Maintaining knowledge about temporal intervals
2. Development of a Debugger for a Concurrent Language;Baiardi F.;IEEE Transactions on Sofltware Engineering,1986
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Application of hierarchical structures based on binary matrices with the generalized arithmetic of Pascal’s triangle in route building problems;Journal of Physics: Conference Series;2021-03-01
2. An Optimal Vector Clock Algorithm for Multithreaded Systems;2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS);2019-07
3. PARTIALLY ORDERED SETS AND COMBINATORY OBJECTS OF THE PYRAMIDAL STRUCTURE;Advances and Applications in Discrete Mathematics;2019-03-12
4. Parallel algorithms for predicate detection;Proceedings of the 20th International Conference on Distributed Computing and Networking;2019-01-04
5. Effectiveness of Delaying Timestamp Computation;Proceedings of the ACM Symposium on Principles of Distributed Computing;2017-07-25