The authors present a general solution for reproducing the execution behavior of parallel programs, termed instant replay. During program execution the relative order of significant events are saved as they occur, not the data associated with such events. As a result, the approach requires less time and space to save the information needed for program replay than other methods. This technique is not dependent on any particular form of interprocess communication. It provides for replay of an entire program, rather than individual processes in isolation. No centralized bottlenecks are introduced and there is no need for synchronized clocks or a globally consistent logical time. The authors describe a prototype implementation of instant replay on the BBN Butterfly parallel processor, and discuss how it can be incorporated into the debugging cycle for parallel programs.
|Original language||English (US)|
|Number of pages||12|
|Journal||IEEE Transactions on Computers|
|State||Published - Apr 1987|
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering