Execution replay of parallel procedural programs

This article describes an execution model for the parallel procedural programming paradigm, which combines multithreading and communications. The model is used to prove sufficient conditions to guarantee the equivalence between two executions of the same program. An efficient mechanism for recording...

Full description

Saved in:
Bibliographic Details
Published in:Journal of systems architecture Vol. 46; no. 10; pp. 835 - 849
Main Authors: de Kergommeaux, J.Chassin, Fagot, A.
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 01.08.2000
Elsevier
Elsevier Sequoia S.A
Subjects:
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Execution replay
Game theory
Operational research and scientific management
Operational research. Management science
Parallel debugging
Parallel processing
Remote procedure call
Software
Studies
Systems design
Threads
Threads
Remote procedure call
Parallel debugging
Execution replay
Procedural language
Sufficient condition
Parallel programming
Prototype
Program execution
Debugging
Time measurement
Modeling
Communication
ISSN:1383-7621, 1873-6165
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article describes an execution model for the parallel procedural programming paradigm, which combines multithreading and communications. The model is used to prove sufficient conditions to guarantee the equivalence between two executions of the same program. An efficient mechanism for recording and replaying deterministically parallel procedural programs is derived from the model and implemented in a prototype. Performed on the prototype, systematic measurements of the time overhead of recording traces for replaying various program models indicate that this overhead remains very low.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1383-7621
1873-6165
DOI:10.1016/S1383-7621(99)00042-9