skip to main content
10.1145/1582716.1582795acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
short-paper

Brief announcement: complexity analysis and algorithm design for pipeline configuration in distributed networks

Published: 10 August 2009 Publication History

Abstract

Supporting high-performance computing pipelines in wide-area networks is crucial to enabling large-scale distributed scientific applications that require minimizing end-to-end delay for fast user interaction or maximizing frame rate for smooth data flow. We formulate and categorize the linear pipeline configuration problems into six classes with two mapping objectives, i.e. minimum end-to-end delay and maximum frame rate, and three network constraints, i.e. no, contiguous, and arbitrary node reuse. We design a dynamic programming-based optimal solution to the configuration problem for minimum end-to-end delay with arbitrary node reuse and prove the NP-completeness of the rest five problems, for each of which, a heuristic algorithm based on a similar optimization procedure is proposed. Performance superiorities of these heuristics are illustrated by extensive experimental results in comparison with existing methods.

References

[1]
B. Agarwalla, N. Ahmed, D. Hilley, and U. Ramachandran. Streamline: a scheduling heuristic for streaming application on the grid. In The 13th Multimedia Computing and Networking Conf., San Jose, CA, 2006.
[2]
S. Fortune, J. Hopcroft, and J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10:111--121, 1980.
[3]
M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York, 1979.
[4]
Q. Wu, Y. Gu, M. Zhu, and N. Rao. Optimizing network performance of computing pipelines in distributed environments. In Proc. of the 22nd IEEE IPDPS, Miami, Florida, Apr. 14--18 2008.
[5]
Y. Zhu and B. Li. Overlay network with linear capacity constraints. IEEE TPDS, 19:159--173, Feb. 2008.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing
August 2009
356 pages
ISBN:9781605583969
DOI:10.1145/1582716

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 August 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. dynamic programming
  2. end-to-end delay
  3. frame rate
  4. heuristic algorithm
  5. np-complete
  6. optimization problem

Qualifiers

  • Short-paper

Conference

PODC '09

Acceptance Rates

PODC '09 Paper Acceptance Rate 27 of 110 submissions, 25%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 126
    Total Downloads
  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media