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

### Keywords

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

## Fingerprint Dive into the research topics of 'Brief announcement: Efficient pipeline configuration in distributed heterogeneous computing environments'. Together they form a unique fingerprint.

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