Decomposing Partial Order Execution Graphs to Improve Message Race Detection

In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the execution should be the same for all distinct orderings of messages delivery. Finding an ordering that produces a different outcome then reveals a message race. Assuming that the Partial Order Execution Graph (POEG) capturing the causality between events is known for a reference execution, the present paper describes techniques for identifying independent sets of messages and within each set equivalent message orderings. Orderings of messages belonging to different sets may then be reexecuted independently from each other, thereby reducing the number of orderings that must be tested to detect message races. We integrated the presented techniques into the Dynamic Parallel Schedules parallelization framework, and applied our approach on an image processing, a linear algebra, and a neighborhood-dependent parallel...

• Type: Conference
• Year: 2007
• Where: IPPS
• Authors: Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
• Keywords: Distributed And Parallel Computing, IPPS 2007, Message Races, Message-passing Parallel Applications, Order Execution Graph