Multiple message broadcasting in the postal model

✍ Scribed by Bar-Noy, Amotz; Kipnis, Shlomo

• Publisher: John Wiley and Sons
• Year: 1997
• Tongue: English
• Weight: 144 KB
• Volume: 29
• Category: Article
• ISSN: 0028-3045
• DOI: 10.1002/(sici)1097-0037(199701)29:1<1::aid-net1>3.0.co;2-p

✦ Synopsis

Broadcasting is an important operation in many message-passing systems that has been widely investigated. Most existing broadcasting algorithms, however, do not address several emerging trends in distributed-memory parallel computers and high-speed communication networks. These trends include (i) treating the system as being fully connected with all processors equally distant, (ii) packetizing large amounts of data into sequences of messages, and (iii) tolerating communication latencies. In this paper, we explore the broadcasting problem in the postal model that addresses these issues. We provide two efficient algorithms for broadcasting m messages in a fully connected message-passing system with n processors and communication latency l. A lower bound on the time required for this problem is (m 0 1) / f l (n), where f l (n) is the optimal time for broadcasting one message. We present two algorithms: The first is Algorithm PARTITION, the running time of which is at most m / n / 2l when m ¢ n and 3m / f l (n) / 2l when m °n. The second is Algorithm D-D-TREES, the running time of which is at most m / 2 f l (n) / O( l) for any value of m.