Journal of the ACM (JACM)
Hi-index | 0.00 |
We present an adaptive construction of the bitonic balancing network. Our network tunes its width (the degree of parallelism) to the system size in a distributed and local way, and does this with the help of an efficient peer-to-peer lookup service. In contrast, all previously known constructions were static, and had the same width irrespective of the system size.Our technique is quite general: though we describe here the construction of the bitonic balancing network, this could be used in the adaptive construction of any distributed data structure which can be decomposed in a recursive manner.