Comparison of Different Approaches to Trace PVM Program Execution

Authors:
Marcin Neyman
Affiliations:
-
Venue:
Proceedings of the 7th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Year:
2000

Citing 5
Cited 0

Debugging Parallel Programs with Instant Replay

IEEE Transactions on Computers
Optimal tracing and replay for debugging message-passing parallel programs

The Journal of Supercomputing
Efficient Replay of PVM Programs

Proceedings of the 6th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
RENEW: A Tool for Fast and Efficient Implementation of Checkpoint Protocols

FTCS '98 Proceedings of the The Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing
Systematic Assessment of the Overhead of Tracing Parallel Programs

PDP '96 Proceedings of the 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed application suffer from nondeterminism thus may behave in a different way for subsequent executions with the same input. To be able to ensure determinism of replay the sequence of received messages should be recorded for each process. The paper deals with comparison of various strategies for tracing PVM programs. It concerns centralised and distributed approach for tracing as well as techniques with and without race detection.