### 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 |

Number of pages | 1 |

State | Published - 17 Dec 2008 |

Event | 27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing - Toronto, ON, Canada Duration: 18 Aug 2008 → 21 Aug 2008 |

### Other

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

Country | Canada |

City | Toronto, ON |

Period | 18/08/08 → 21/08/08 |

### Fingerprint

### Keywords

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

### Cite this

*PODC'08: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing*

}

*PODC'08: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing.*27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Toronto, ON, Canada, 18/08/08.

**Brief announcement : Efficient pipeline configuration in distributed heterogeneous computing environments.** / Gu, Yi; Wu, Qishi; Zhu, Michelle; Rao, Nageswara S.V.

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

TY - GEN

T1 - Brief announcement

T2 - Efficient pipeline configuration in distributed heterogeneous computing environments

AU - Gu, Yi

AU - Wu, Qishi

AU - Zhu, Michelle

AU - Rao, Nageswara S.V.

PY - 2008/12/17

Y1 - 2008/12/17

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 - http://www.scopus.com/inward/record.url?scp=57549112768&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:57549112768

SN - 9781595939890

BT - PODC'08

ER -