Efficient parallel algorithms
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
An introduction to parallel algorithms
An introduction to parallel algorithms
Wireless digital communications: modulation & spread spectrum applications
Wireless digital communications: modulation & spread spectrum applications
List ranking and list scan on the Cray C90
Journal of Computer and System Sciences
Parallel computation: models and methods
Parallel computation: models and methods
Randomized Initialization Protocols for Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Wireless Sensor Network
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
| Hi-index | 0.00 |
A Broadcast Communication Model (BCM, for short) is a distributed system with no central arbiter populated by n processing units referred to as stations. The stations can communicate by broadcasting/receiving a data packet to one of k distinct communication channels. The main contribution of this paper is to present time and energy optimal list ranking algorithms on the BCM. We first show that the rank of every node in an n-node linked list can be determined in O(n) time slots with no station being awake for more than O(1) time slots on the single-channel n-station BCM. We then extend this algorithm to run on the k-channel BCM. For any small fixed 驴 0, our list ranking algorithm runs in O( n/k ) time slots with no station being awake for more than O(1) time slots, provided that k 驴 n1-驴. Clearly, 驴( n/k ) time is necessary to solve the list ranking problem for an n-node linked list on the k-channel BCM. Therefore, our list ranking algorithm on the k-channel BCM is time and energy optimal.