Efficient pipeline configuration in distributed heterogeneous computing environments

  • Authors:
  • Yi Gu;Qishi Wu;Mengxia Zhu;Nageswara S.V. Rao

  • Affiliations:
  • University of Memphis, Memphis, TN, USA;University of Memphis, Memphis, TN, USA;Southern Illinois University, Carbondale, IL, USA;Oak Ridge National Laboratory, Oak Ridge, TN, USA

  • Venue:
  • Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider six classes of linear pipeline configuration problems with different mapping objectives and network constraints in distributed heterogeneous computing environments. We prove that two of them are polynomially solvable and the rest are NP-complete, for each of which, an optimal or heuristic algorithm based on dynamic programming is designed. Extensive simulation results illustrate the efficacy of these algorithms in comparison with existing methods.