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 条
  • [21] Bounded Phase Analysis of Message-Passing Programs
    Bouajjani, Ahmed
    Emmi, Michael
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2012, 2012, 7214 : 451 - 465
  • [22] Distributed breakpoint detection in message-passing programs
    Drummond, LMD
    Barbosa, VC
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1996, 39 (02) : 153 - 167
  • [23] Orthogonal processor groups for message-passing programs
    Rauber, T
    Reilein, R
    Rünger, G
    HIGH-PERFORMANCE COMPUTING AND NETWORKING, 2001, 2110 : 363 - 372
  • [24] Collective Contracts for Message-Passing Parallel Programs
    Luo, Ziqing
    Siegel, Stephen F.
    COMPUTER AIDED VERIFICATION, PT II, CAV 2024, 2024, 14682 : 44 - 68
  • [25] ON THE COMPLEXITY OF DEADLOCK-FREE PROGRAMS ON A RING OF PROCESSORS
    CLARK, WE
    MCCOLM, GL
    STARK, WR
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1992, 16 (01) : 67 - 71
  • [26] A minimal property for characterizing deadlock-free programs
    Cholvi, V
    Boronat, P
    INFORMATION PROCESSING LETTERS, 2001, 77 (5-6) : 283 - 290
  • [27] DEADLOCK-FREE MESSAGE ROUTING IN MULTIPROCESSOR INTERCONNECTION NETWORKS
    DALLY, WJ
    SEITZ, CL
    IEEE TRANSACTIONS ON COMPUTERS, 1987, 36 (05) : 547 - 553
  • [28] Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing
    Jacobs, Jules
    Hinrichsen, Jonas Kastberg
    Krebbers, Robbert
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2024, 8 (POPL):
  • [29] Static single assignment form for message-passing programs
    Chakrabarti, DR
    Banerjee, P
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2001, 29 (02) : 139 - 184
  • [30] AUTOMATED SCALABILITY ANALYSIS OF MESSAGE-PASSING PARALLEL PROGRAMS
    SARUKKAI, SR
    MEHRA, P
    BLOCK, RJ
    IEEE PARALLEL & DISTRIBUTED TECHNOLOGY, 1995, 3 (04): : 21 - 32
12345