The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks

This paper introduces a new network model called a multimedia network. It combines the point-to-point message passing network and the multiaccess channel. To benefit from the combination, the designed algorithms consist of two stages: a local stage which utilizes the parallelism of the point-to-point network and a global stage which utilizes the broadcast capability of the multiaccess channel. To balance the complexities of the two stages a components each of radius O( 4 artition of the network into O(A) connected n) is required. We present efftcient deterministic and randomized partitioning algorithms that run in O(& log* n) time. The deterministic algorithm sends O(m + n log

[1]  Dimitri Konstantas,et al.  A Simulation Study of Retransmission Strategies for the Asynchronous Virtual Time CSMA Protocol , 1983, Performance.

[2]  John D. Spragins,et al.  FISHNET: A Distributed Architecture for High-Performance Local Computer Networks , 1988, IEEE Trans. Computers.

[3]  Baruch Awerbuch,et al.  Applying static network protocols to dynamic networks , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[4]  Gad M. Landau,et al.  The power of multimedia: combining point-to point and multi-access networks , 1988, PODC '88.

[5]  Shahid H. Bokhari,et al.  Finding Maximum on an Array Processor with a Global Bus , 1984, IEEE Transactions on Computers.

[6]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[7]  Adrian Segall,et al.  Distributed network protocols , 1983, IEEE Trans. Inf. Theory.

[8]  Richard Cole,et al.  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.

[9]  Andrew V. Goldberg,et al.  Parallel symmetry-breaking in sparse graphs , 1987, STOC.

[10]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[11]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[12]  Dan E. Willard.  Log-logarithmic protocols for resolving ethernet and semaphore conflicts , 1984, STOC '84.

[13]  Quentin F. Stout,et al.  Meshes with multiple buses , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[14]  Robert Metcalfe,et al.  Ethernet: distributed packet switching for local computer networks , 1976, CACM.

[15]  Albert G. Greenberg.  On the time complexity of broadcast communication schemes (Preliminary Version) , 1982, STOC '82.

[16]  Christos J. Georgiou,et al.  Multipath Hierarchies in Interconnection Networks , 1987, ICS.

[17]  Uzi Vishkin,et al.  Trade-offs between depth and width in parallel computation , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[18]  Decision Systems.,et al.  Distributed minimum hop algorithms , 1982 .

[19]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[20]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[21]  Shmuel Zaks,et al.  Tight lower and upper bounds for some distributed algorithms for a complete network of processors , 1984, PODC '84.

[22]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[23]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.