Optimizing end-to-end performance of data-intensive computing pipelines in heterogeneous network environments
DOI10.1016/J.JPDC.2010.08.003zbMATH Open1219.68076OpenAlexW2011416912MaRDI QIDQ635308FDOQ635308
Publication date: 19 August 2011
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.08.003
Recommendations
- A run-time system for efficient execution of scientific workflows on distributed environments
- Optimal pipeline decomposition and adaptive network mapping to support distributed remote visualization
- Optimal use of mixed task and data parallelism for pipelined computations
- Formalizing compute-aggregate problems in cloud computing
- A data intensive heuristic approach to the two-stage streaming scheduling problem
Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- The directed subgraph homeomorphism problem
- Title not available (Why is that?)
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
- Mapping pipeline skeletons onto heterogeneous platforms
- Configuring sessions in programmable networks.
- Performance of local search heuristics on scheduling a class of pipelined multiprocessor tasks
- Genetic algorithms for task scheduling problem
- A scheduling framework for large-scale, parallel, and topology-aware applications
Cited In (4)
This page was built for publication: Optimizing end-to-end performance of data-intensive computing pipelines in heterogeneous network environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635308)
