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 条
  • [1] Deadlock prevention in incremental replay of message-passing programs
    Zambonelli, F
    HIGH-PERFORMANCE COMPUTING AND NETWORKING, PROCEEDINGS, 1999, 1593 : 593 - 602
  • [2] Deadlock analysis of synchronous message-passing programs
    Zhou, J
    Tai, KC
    INTERNATIONAL SYMPOSIUM ON SOFTWARE ENGINEERING FOR PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 1999, : 62 - 69
  • [3] Efficient logging algorithm for incremental replay of message-passing applications
    Zambonelli, Franco
    Netzer, Robert H.B.
    Proceedings of the International Parallel Processing Symposium, IPPS, 1999, : 392 - 398
  • [4] An efficient logging algorithm for incremental replay of message-passing applications
    Zambonelli, F
    Netzer, RHB
    IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1999, : 392 - 398
  • [5] OPTIMAL TRACING AND REPLAY FOR DEBUGGING MESSAGE-PASSING PARALLEL PROGRAMS
    NETZER, RHB
    MILLER, BP
    JOURNAL OF SUPERCOMPUTING, 1995, 8 (04): : 371 - 388
  • [6] A DEADLOCK-FREE COMMUNICATION KERNEL FOR LOOP CONNECTED MESSAGE PASSING COMPUTER ARCHITECTURE
    PRAMANIK, P
    DAS, PK
    BANDYOPADHYAY, AK
    FAY, DQM
    MICROPROCESSING AND MICROPROGRAMMING, 1990, 30 (1-5): : 703 - 712
  • [7] Verification of message-passing uninterpreted programs
    Hong, Weijiang
    Chen, Zhenbang
    Zhang, Yufeng
    Yu, Hengbiao
    Du, Yide
    Wang, Ji
    SCIENCE OF COMPUTER PROGRAMMING, 2024, 234
  • [8] Modular Reasoning for Message-Passing Programs
    Lei, Jinjiang
    Qiu, Zongyan
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2014, 2014, 8687 : 277 - 294
  • [9] Modular Reasoning for Message-Passing Programs
    Lei, Jinjiang
    Qiu, Zongyan
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8687 : 277 - 294
  • [10] A transformation to provide deadlock-free programs
    Boronat, P
    Cholvi, V
    COMPUTATIONAL SCIENCE - ICCS 2003, PT II, PROCEEDINGS, 2003, 2658 : 935 - 944
12345