Efficient pipeline configuration in distributed heterogeneous computing environments
Yi Gu, Qishi Wu, Mengxia Zhu, Nageswara S. V. Rao · 2008
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.