Summary: Efficient Line Broadcasting in a d­Dimensional Grid
A. Averbuchx Y. Rodittyxy B. Shohamxy
xDepartment of Computer Science
School of Mathematical Sciences
Tel Aviv University
Ramat Aviv, Tel Aviv 69978
Israel
yDepartment of Computer Sciences
The Academic College of Tel­Aviv­Yaffo
Tel­Aviv 61161
Israel
e­mail: jr@math.tau.ac.il
Abstract
The results of Fujita and Farley in [6] and Kane and Peters in [7] on line broad­
casting in paths and cycles are extended into a d­dimensional grid, obtaining optimal
algorithms in most cases.
1 Introduction
Efficient broadcasting is a key component to achieve high performance (throughput) from
parallel and distributed processing.
The motivation of this work was triggered by our interest in the investigation of how

Source: Averbuch, Amir - School of Computer Science, Tel Aviv University

Collections: Computer Technologies and Information Sciences