Complexity results for throughput and latency optimization of replicated and data-parallel workflows
From MaRDI portal
Publication:973005
DOI10.1007/S00453-008-9229-4zbMATH Open1209.68110OpenAlexW2153441708MaRDI QIDQ973005FDOQ973005
Publication date: 28 May 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9229-4
Recommendations
- Mapping workflow applications with types on heterogeneous specialized platforms
- Optimizing the reliability of streaming applications under throughput constraints
- Mapping pipeline skeletons onto heterogeneous platforms
- Computing the throughput of probabilistic and replicated streaming applications
- Mapping filtering streaming applications
scheduling algorithmsthroughput maximizationcomplexity resultsbi-criteria optimizationheterogeneous platformsfork graphslatency minimizationpipeline graphs
Cites Work
- Title not available (Why is that?)
- Efficient collective communication in distributed heterogeneous systems.
- Fast optimal load balancing algorithms for 1D partitioning
- Optimal use of mixed task and data parallelism for pipelined computations
- Mapping pipeline skeletons onto heterogeneous platforms
- Efficient partitioning of sequences
- Optimizing execution of component-based applications using group instances
- Title not available (Why is that?)
- Optimizing latency and throughput of application workflows on clusters
- Title not available (Why is that?)
- Broadcast scheduling optimization for heterogeneous cluster systems
Cited In (2)
Uses Software
This page was built for publication: Complexity results for throughput and latency optimization of replicated and data-parallel workflows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973005)
