To support incremental replay of message-passing applications. processes must 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 introduce deadlocks in replay, and we introduce a new algorithm that: (i) prevents deadlocks in replay and (ii) enables the tuning of its behavior to meet specific user needs.
Deadlock-free incremental replay of message-passing programs / Zambonelli, Franco; Netzer, Rhb. - In: JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING. - ISSN 0743-7315. - STAMPA. - 61:5(2001), pp. 667-678. [10.1006/jpdc.2001.1703]
Deadlock-free incremental replay of message-passing programs
ZAMBONELLI, Franco;
2001
Abstract
To support incremental replay of message-passing applications. processes must 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 introduce deadlocks in replay, and we introduce a new algorithm that: (i) prevents deadlocks in replay and (ii) enables the tuning of its behavior to meet specific user needs.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
