Broadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few Channels

Authors:
Affiliations:
Venue:
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Year:
1998

Citing 4
Cited 2

Introduction to graph theory

Introduction to graph theory
Tree-Based Broadcasting in Multihop Radio Networks

IEEE Transactions on Computers
Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models

ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Broadcast Communications and Distributed Algorithms

IEEE Transactions on Computers

Energy-Efficient Permutation Routing in Radio Networks

IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Routing in the Broadcast Communication Model

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main contribution of this work is to present elegant broadcast-efficient algorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (BCM, for short) endowed with p processors and k communication channels. We begin by presenting an optimal off-line routing algorithm using n/k broadcast rounds for any k, p, and n. We then go on to develop an on-line routing algorithm that takes 2n/k + k - 1 broadcast rounds on a p-processor, k-channel BCM, whenever k 驴驴p/2. Using this routing algorithm, we develop a ranking algorithm that takes only 3n/k + o(n/k) broadcast rounds, as well as a sorting algorithm that takes 4n/k + o(n/k)) broadcast rounds on a p-processor, k-channel BCM, provided that k 驴驴p/2 and p 驴 o(n). Our algorirhnis offer a Signficant improvement over the state ofthe art.