A New Algorithm for the Decentralized Aggregation Problem

  • Akhil Kumar
  • Published 1999 in Distributed and Parallel Databases

Abstract

This paper describes a new algorithm for solving the distributed aggregation problem in which individual values from N nodes have to be aggregated in an associative and commutative manner, and the final result must be either computed at all sites or communicated to them. Our algorithm has a message-delay product of Θ(dN(N $$\Theta (dN(N^{\frac{1}{d… (More)
DOI: 10.1023/A:1026483919295

Topics

3 Figures and Tables

Cite this paper

@article{Kumar1999ANA, title={A New Algorithm for the Decentralized Aggregation Problem}, author={Akhil Kumar}, journal={Distributed and Parallel Databases}, year={1999}, volume={7}, pages={415-427} }