Brief announcement: Efficient pipeline configuration in distributed heterogeneous computing environments

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

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 proceeding › Conference contribution › peer-review

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 language	English
Title of host publication	PODC'08
Subtitle of host publication	Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing
Pages	432
Number of pages	1
State	Published - 2008
Event	27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing - Toronto, ON, Canada Duration: Aug 18 2008 → Aug 21 2008

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing
Country/Territory	Canada
City	Toronto, ON
Period	08/18/08 → 08/21/08

Keywords

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

Cite this

@inproceedings{cd2268c44c3b44e6bf59cf1b4ef1f771,

title = "Brief announcement: Efficient pipeline configuration in distributed heterogeneous computing environments",

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.",

keywords = "Heuristic algorithm, Maximum frame rate, Minimum end-to-end delay, NP-complete, Optimization problem",

author = "Yi Gu and Qishi Wu and Mengxia Zhu and Rao, \{Nageswara S.V.\}",

year = "2008",

language = "English",

isbn = "9781595939890",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

pages = "432",

booktitle = "PODC'08",

note = "27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing ; Conference date: 18-08-2008 Through 21-08-2008",

}

Gu, Y, Wu, Q, Zhu, M & Rao, NSV 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. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pp. 432, 27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Toronto, ON, Canada, 08/18/08.

Brief announcement: Efficient pipeline configuration in distributed heterogeneous computing environments. / Gu, Yi; Wu, Qishi; Zhu, Mengxia et al.
PODC'08: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing. 2008. p. 432 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Brief announcement

T2 - 27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

AU - Gu, Yi

AU - Wu, Qishi

AU - Zhu, Mengxia

AU - Rao, Nageswara S.V.

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Heuristic algorithm

KW - Maximum frame rate

KW - Minimum end-to-end delay

KW - NP-complete

KW - Optimization problem

UR - https://www.scopus.com/pages/publications/57549112768

M3 - Conference contribution

AN - SCOPUS:57549112768

SN - 9781595939890

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 432

BT - PODC'08

Y2 - 18 August 2008 through 21 August 2008

ER -

Brief announcement: Efficient pipeline configuration in distributed heterogeneous computing environments

Abstract

Publication series

Conference

Keywords

Other files and links

Fingerprint

Cite this