Deadlock-free incremental replay of message-passing programs

被引：4
|
作者：
Zambonelli, F
Netzer, RHB
机构：
[1] Univ Modena, Dipartimento Sci Ingn, I-41100 Modena, Italy
[2] IP Performance Inc, N Scituate, RI 02857 USA
来源：
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 2001年 / 61卷 / 05期
基金：
美国国家科学基金会;
关键词：
distributed debugging; checkpointing; incremental replay; adaptive logging; deadlock;
D O I：
10.1006/jpdc.2001.1703
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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. (C) 2001 Academic Press.
引用
收藏
页码：667 / 678
页数：12
相关论文
共 50 条
  • [41] Types as models: Model checking message-passing programs
    Chaki, S
    Rajamani, SK
    Rehof, J
    ACM SIGPLAN NOTICES, 2002, 37 (01) : 45 - 57
  • [42] LoGPX: A New Communication Model for Message-Passing Programs
    Lin, Yufei
    Tang, Yuhua
    Guo, Xiaowei
    Xu, Xinhai
    PROCEEDINGS OF THE 2011 INTERNATIONAL SYMPOSIUM ON PERFORMANCE EVALUATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS, 2011, : 213 - 219
  • [43] Efficient reachability testing of asynchronous message-passing programs
    Lei, Y
    Tai, KC
    EIGHTH IEEE INTERNATIONAL CONFERENCE ON ENGINEERING OF COMPLEX COMPUTER SYSTEMS, PROCEEDINGS, 2002, : 35 - 44
  • [44] LoGPC: Modeling network contention in message-passing programs
    Moritz, CA
    Frank, MI
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2001, 12 (04) : 404 - 415
  • [45] Towards Deductive Verification of Message-Passing Parallel Programs
    Luo, Ziqing
    Siegel, Stephen. F.
    PROCEEDINGS OF CORRECTNESS 2018: 2ND IEEE/ACM INTERNATIONAL WORKSHOP ON SOFTWARE CORRECTNESS FOR HPC APPLICATIONS, 2018, : 59 - 68
  • [46] Structural testing criteria for message-passing parallel programs
    Souza, S. R. S.
    Vergilio, S. R.
    Souza, P. S. L.
    Simao, A. S.
    Hausen, A. C.
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2008, 20 (16): : 1893 - 1916
  • [47] Types for Deadlock-Free Higher-Order Programs
    Padovani, Luca
    Novara, Luca
    FORMAL TECHNIQUES FOR DISTRIBUTED OBJECTS, COMPONENTS, AND SYSTEMS, FORTE 2015, 2015, 9039 : 3 - 18
  • [48] A CASE TOOL FOR DESIGNING DEADLOCK-FREE OCCAM PROGRAMS
    CROWE, WD
    HASSON, R
    STRAINCLARK, PED
    DEVELOPING TRANSPUTER APPLICATIONS ( OUG 11 ), 1989, 11 : 23 - 35
  • [49] Decentralized deadlock-free enforcement of message orderings in message-based systems
    Samadi, Mahboubeh
    Ghassemi, Fatemeh
    Khosravi, Ramtin
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2024, 144
  • [50] MINIMUM DEADLOCK-FREE MESSAGE ROUTING RESTRICTIONS IN BINARY HYPERCUBES
    LI, QA
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1992, 15 (02) : 153 - 159
12345