By Topic

Detection of first races for debugging message-passing programs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mi-Young Park ; Dept. of Comput. Eng., Pusan Nat. Univ., Pusan ; Sang-Hwa Chung

Message races, which can cause nondeterministic executions of a message-passing program, should be detected for debugging. Especially it is more important to detect the first race that occurs for the first time in a process than to detect affected races that might be side effects of nondeterminism. The previous techniques are not efficient to detect those races because they require more than two runs of a program. This paper presents an efficient technique that requires only one execution to detect the first race in each process. For this, we use a new information, called message history, that consists of send/receive events related to the first race. Also we introduce an algorithm to detect the first races using message history. In the experiment, we show that our technique exactly detects the first race during an execution using several MPI programs.

Published in:

Computer and Information Technology, 2008. CIT 2008. 8th IEEE International Conference on

Date of Conference:

8-11 July 2008