Brief announcement: Efficient pipeline configuration in distributed heterogeneous computing environments

Yi Gu, Qishi Wu, Mengxia Zhu, Nageswara S.V. Rao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

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.

Original languageEnglish
Title of host publicationPODC'08
Subtitle of host publicationProceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing
Number of pages1
StatePublished - 17 Dec 2008
Event27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing - Toronto, ON, Canada
Duration: 18 Aug 200821 Aug 2008

Other

Other27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing
CountryCanada
CityToronto, ON
Period18/08/0821/08/08

    Fingerprint

Keywords

  • Heuristic algorithm
  • Maximum frame rate
  • Minimum end-to-end delay
  • NP-complete
  • Optimization problem

Cite this

Gu, Y., Wu, Q., Zhu, M., & Rao, N. S. V. (2008). Brief announcement: Efficient pipeline configuration in distributed heterogeneous computing environments. In PODC'08: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing