Network-Oblivious Algorithms

@article{Bilardi2007NetworkObliviousA,
  title={Network-Oblivious Algorithms},
  author={Gianfranco Bilardi and Andrea Pietracaprina and Geppino Pucci and Michele Scquizzato and Francesco Silvestri},
  journal={2007 IEEE International Parallel and Distributed Processing Symposium},
  year={2007},
  pages={1-10}
}
A framework is proposed for the design and analysis of network-oblivious algorithms, namely algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capabilities. The framework prescribes that a network-oblivious algorithm be specified on a parallel model of computation where the only parameter is the problem’s input size, and then evaluated on a model with two parameters, capturing parallelism granularity… CONTINUE READING