Browse > Article

Race State Transition for Detecting Unaffected Race Conditions in Message-Passing Programs  

Park Mi-Young (경상대학교 컴퓨터과학부)
Kang Hyun-Syug (경상대학교 컴퓨터과학부)
Jun Yong-Kee (경상대학교 컴퓨터과학부)
Abstract
Detecting unaffected race conditions is important to debugging message-passing programs effectively, because such a message race can affect other races to occur or not. The previous technique to detect efficiently unaffected races detects racing messages by halting at the receive event of the first race to occur in each process. However this technique does not guarantee that all of the detected races are unaffected, because halting such processes does disconnect some chain of affects-relations among those races. In this paper, we present a novel technique that manages the state of the detected race by examining if every received message is affected until the execution terminates. Our technique therefore guarantees to detect efficiently the unaffected races, because it maintains affects-relations of the races all along the execution of program.
Keywords
message-passing programs; message race; debugging; unaffected races;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Kranzlmuller, D., and M. Schulz, 'Notes on Nondeterminism in Message Passing Programs,' 9th European PVM/MPI Users' Group Conf., Lecture Notes in Computer Science, 2474: 357-367, Springer- Verlag, Sept. 2002
2 Krammer. B., M.S. Muller, and M.M. Resch, 'MPI Application Development Using the Analysis Tool MARMOT,' 4th Int'l Conf. on Computational Science, Lecture Notes in Computer Science, 3038:464-471, Springer-Verlag, june 2004
3 Kranzlrnuller, D., Event Graph Analysis for Debugging Massively Parallel Programs, Ph.D. Dissertation, Joh. Kepler University Linz, Austria, Sept. 2000
4 Kilgore, Rand C. Chase, 'Re-execution of Distributed Programs to Detect Bugs Hidden by Racing Messages,' 30th Annual Hawaii Int'l. Conference on System Sciences (HICSS), Vol. 1, pp. 423-432, Jan. 1997   DOI
5 Geist, A., A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. 'PVM: Parallel Virtual Machine,' A Users' Guide and Tutorial for Networked Parallel Computing, Cambridge, MIT Press, 1994
6 Snir, M., S. Otto, S. Huss-Lederman, O. Walker, MPI: The Complete Reference, MIT Press, 1996
7 Mattern, F., 'Virtual Time and Global States of Distributed Systems,' Parallel and Distributed Algorithms, pp. 215-226, Elsevier Science, North holland, 1989
8 Damodaran-Kamal, S. K. and J. M. Francioni, 'Testing Races in Parallel Programs with an OtOt Strategy,' Int'l Symp. on Software Testing and Analysis, pp. 216-227, ACM, Aug. 1994   DOI
9 Cypher. R. and E. Leu, 'The Semantics of Blocking and Nonblocking Send and Receive Primitives,' 8th IEEE Intl. Parallel Processing Symp., pp. 729-735, IEEE, Apr. 1994   DOI
10 Kranzlmuller, D., C. Schaubschlager, and J. Volkert, 'Brief Overview of the MAD Debugging Activities,' 4th International Workshop on Automated Debugging (AADEBUG 2000), Aug. 2000
11 Tai, K. C. 'Reachability Testing of Asynchronous Message-Passing Programs.' Int'l. Symp. on Software Engineering for Parallel and Distributed Systems, IEEE. pp. 50-61, IEEE. May 1997   DOI
12 Claudio, AP., J.D. Cunha, and M.B. Carmo, 'Monitoring and Debugging Message Passing Applications with MPVisualizer,' 8th Euromicro Workshop on Parallel and Distributed Processing, pp.376-382, IEEE, Jan. 2000   DOI
13 Gropp, W. and E. L. Lusk, 'Reproducible Measurements of MPI Performance Characteristics,' 6th European PVM/MPI Users' Group Conf., Barcelona, Spain, Lecture Notes in Computer Science, 1697: 11-18, Springer-Verlag, Sept. 1999
14 Lamport, L., 'Time, Clocks, and the Ordering of Events in a Distributed System,' Communications of the ACM. 21(7): 558-565. ACM. July 1978   DOI   ScienceOn
15 Fidge, C. J., 'Partial Orders for Parallel Debugging,' SIGPLAN/SIGOPS Workshop on Parallel and Distributed Debugging, pp. 183-194, ACM, May 1988   DOI
16 Gropp, W. and E. Lusk, User's Guide for Mpich; A Portable Implementation of MPI, TR-ANL-96/6, Argonne National Laboratory, 1996
17 Damodaran-Kamal, S. K., and J. M. Francioni, 'Nondeterminacy: Testing and Debugging in Message Passing Parallel Programs,' ACM/ONR Workshop on Parallel and Distributed Debugging, Sigplan Notices, 28(12): 118-128, ACM, Dec. 1993   DOI
18 Netzer, R. H. B., T. W. Brennan, and K. D. Suresh, 'Debugging Race Conditions in Message-Passing Programs,' SIGMETRICS Symp. on Parallel and Distributed Tools (SPDT), ACM, May 1996   DOI
19 Tai, K. C. 'Race Analysis of Traces of Asynchronous Message-Passing Programs,' Int'l. Conf. Distributed Computing Systems (ICDCS), pp. 261-268, IEEE, May 1997   DOI
20 Netzer, R. H. B., and B. P. Miller, 'Optimal Tracing and Replay for Debugging MessagePassing Parallel Programs,' Supercomputing, pp, 502-511, IEEE/ACM, Nov. 1992   DOI
21 Cypher, R., and E. Leu, 'Efficient Race Detection for Message-Passing Programs with Nonblocking Sends and Receives,' 7th IEEE Symp. on Parallel and Distributed Processing, pp. 534-541, IEEE, San Antonio, Texas, 1995   DOI