Calibrating embedded protocols on asynchronous systems

被引:4
|
作者
Yamauchi, Yukiko [1 ]
Bein, Doina [2 ]
Masuzawa, Toshimitsu [1 ]
Morales, Linda [2 ]
Sudborough, I. Hal [2 ]
机构
[1] Osaka Univ, Grad Sch Informat Sci & Technol, Osaka 5608531, Japan
[2] Univ Texas Dallas, Dept Comp Sci, Richardson, TX 75083 USA
基金
日本学术振兴会;
关键词
Asynchronous system; Channel system; Distributed system; Graph embedding; Virtual topology; Fault tolerance; Transient fault; RELIABLE BROADCAST; FAULT; DECIDABILITY; SCHEME;
D O I
10.1016/j.ins.2009.08.029
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Embedding is a method of projecting one topology into another. In one-to-one node embedding, paths in the target topology correspond to links in the original topology. A protocol running on the original topology can be modified to be executed on a target topology by means of embedding. However, if the protocol is tolerant to a number of faults - faults that affect the data but not the code of a distributed protocol executed by the nodes in a distributed systems - then the adapted protocol will not have the fault tolerance property preserved, due to the fact that links in the original topology can be embedded into paths of length greater than one: faults at the intermediate nodes on such paths are not accounted for in the protocol. We propose a communication protocol in the target topology that preserves the fault tolerance characteristics of any protocol designed for the original topology, namely by our mechanism the modification preserves fault tolerance. (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码:1793 / 1801
页数:9
相关论文
共 50 条
  • [21] PROCESSOR MEMBERSHIP IN ASYNCHRONOUS DISTRIBUTED SYSTEMS
    MOSER, LE
    MELLIARSMITH, PM
    AGRAWALA, V
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (05) : 459 - 473
  • [22] Asynchronous spiking neural P systems
    Cavaliere, Matteo
    Ibarra, Oscar H.
    Paun, Gheorghe
    Egecioglu, Omer
    Ionescu, Mihai
    Woodworth, Sara
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (24-25) : 2352 - 2364
  • [23] Asynchronous protocols to meet real-time constraints: Is it really sensible? How to proceed?
    Hurfin, M
    Raynal, M
    FIRST INTERNATIONAL SYMPOSIUM ON OBJECT-ORIENTED REAL-TIME DISTRIBUTED COMPUTING (ISORC '98), 1998, : 290 - 297
  • [24] Threshold protocols in survivor set systems
    Junqueira, Flavio P.
    Marzullo, Keith
    Herlihy, Maurice
    Penso, Lucia Draque
    DISTRIBUTED COMPUTING, 2010, 23 (02) : 135 - 149
  • [25] Genuine atomic multicast in asynchronous distributed systems
    Guerraoui, R
    Schiper, A
    THEORETICAL COMPUTER SCIENCE, 2001, 254 (1-2) : 297 - 316
  • [26] Dynamic FTSS in asynchronous systems: The case of unison
    Dubois, Swan
    Potop-Butucaru, Maria
    Tixeuil, Sebastien
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (29) : 3418 - 3439
  • [27] Asynchronous Multi-Agent Multisorted Systems
    O. P. Kuznetsov
    Automation and Remote Control, 2021, 82 : 294 - 307
  • [28] Access cost for asynchronous Byzantine quorum systems
    Bazzi, RA
    DISTRIBUTED COMPUTING, 2001, 14 (01) : 41 - 48
  • [29] Asynchronous Multi-Agent Multisorted Systems
    Kuznetsov, O. P.
    AUTOMATION AND REMOTE CONTROL, 2021, 82 (02) : 294 - 307
  • [30] Soft core based embedded systems in critical aerospace applications
    Cuenca-Asensi, Sergio
    Martinez-Alvarez, Antonio
    Restrepo-Calle, Felipe
    Palomo, Francisco R.
    Guzman-Miranda, Hipolito
    Aguirre, Miguel A.
    JOURNAL OF SYSTEMS ARCHITECTURE, 2011, 57 (10) : 886 - 895