Deadlock-free incremental replay of message-passing programs

Citation
F. Zambonelli et Rhb. Netzer, Deadlock-free incremental replay of message-passing programs, J PAR DISTR, 61(5), 2001, pp. 667-678
Citations number
18
Categorie Soggetti
Computer Science & Engineering
Journal title
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
ISSN journal
07437315 → ACNP
Volume
61
Issue
5
Year of publication
2001
Pages
667 - 678
Database
ISI
SICI code
0743-7315(200105)61:5<667:DIROMP>2.0.ZU;2-V
Abstract
To support incremental replay of message-passing applications. processes mu st periodically checkpoint and the content of some messages must be logged, to break dependencies of the current slate of the execution on past events . This paper shows that known adaptive logging algorithms are likely to int roduce deadlocks in replay, and we introduce a new algorithm that: (i) prev ents deadlocks in replay and (ii) enables the tuning of its behavior to mee t specific user needs. (C) 2001 Academic Press.