Logically Instantaneous communication on top of distributed memory parallel machines

被引:0
|
作者
Mostéfaoui, A
Raynal, M
Verissimo, P
机构
[1] Inst Rech Informat & Syst Aleatoires, F-35042 Rennes, France
[2] Univ Lisbon, P-1700 Lisbon, Portugal
来源
关键词
asynchronous distributed system; communication protocol; logical time; Logically Instantaneous communication; Rendezvous;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Communication is Logically Instantaneous (LI) if it is possible to timestamp communication events with integers in such a way that (1) timestamps increase within each process and (2) the sending and the delivery events associated with each message have the same timestamp. So, there is a logical time frame in which for each message, the send event and the corresponding delivery events occur simultaneously. LI is stronger than Causally Ordered (CO) communication, but weaker than Rendezvous (RDV) communication. This paper explores Logically Instantaneous communication and provides a simple and efficient protocol that implements LI on top of asynchronous distributed systems. LI is attractive as it includes co and provides more concurrency than RDV. Moreover it allows to adopt the following approach: first design a distributed application assuming Rendezvous communication, and then run it on top of an asynchronous distributed system providing only LI communication.
引用
收藏
页码:258 / 270
页数:13
相关论文
共 50 条
  • [1] The logically instantaneous communication mode:: a communication abstraction
    Mostéfaoui, A
    Raynal, M
    Veríssimo, P
    [J]. FUTURE GENERATION COMPUTER SYSTEMS, 2001, 17 (06) : 669 - 678
  • [2] Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication
    Calvin, C
    [J]. PARALLEL COMPUTING, 1996, 22 (09) : 1255 - 1279
  • [3] Parallel numerical algorithms for distributed memory machines
    Bassomo, P
    Sakho, I
    Corbel, A
    [J]. PARALLEL COMPUTATION, 1999, 1557 : 581 - 583
  • [4] ON THE DESIGN OF PARALLEL PROGRAMS FOR MACHINES WITH DISTRIBUTED MEMORY
    GOMM, D
    HECKNER, M
    LANGE, KJ
    RIEDLE, G
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 487 : 381 - 391
  • [5] Parallel Computation of Component Trees on Distributed Memory Machines
    Goetz, Markus
    Cavallaro, Gabriele
    Geraud, Thierry
    Book, Matthias
    Riedel, Morris
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2018, 29 (11) : 2582 - 2598
  • [6] Parallel algorithms for perceptual grouping on distributed memory machines
    Chung, YW
    Wang, CL
    Prasanna, VK
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1998, 50 (1-2) : 123 - 143
  • [7] PARALLEL TALBOT ALGORITHM FOR DISTRIBUTED-MEMORY MACHINES
    DEROSA, MA
    GIUNTA, G
    RIZZARDI, M
    [J]. PARALLEL COMPUTING, 1995, 21 (05) : 783 - 801
  • [8] Modular parallel programming in mpC for distributed memory machines
    Arapov, D
    Ivannikov, V
    Kalinov, A
    Lastovetsky, A
    Ledovskih, I
    Lewis, T
    [J]. SECOND AIZU INTERNATIONAL SYMPOSIUM ON PARALLEL ALGORITHMS/ARCHITECTURE SYNTHESIS, PROCEEDINGS, 1997, : 248 - 255
  • [9] Parallel algorithms for linear approximation on distributed memory machines
    Chung, YW
    Prasanna, VK
    Wang, CL
    [J]. IMAGE UNDERSTANDING WORKSHOP, 1996 PROCEEDINGS, VOLS I AND II, 1996, : 1465 - 1472
  • [10] LOGICALLY INSTANTANEOUS MESSAGE-PASSING IN ASYNCHRONOUS DISTRIBUTED SYSTEMS
    SONEOKA, T
    IBARAKI, T
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (05) : 513 - 527