Complexity results for throughput and latency optimization of replicated and data-parallel workflows

DOI10.1007/s00453-008-9229-4zbMath1209.68110OpenAlexW2153441708MaRDI QIDQ973005

Anne Benoit, Yves Robert

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

zbMATH Keywords

scheduling algorithmsthroughput maximizationcomplexity resultsbi-criteria optimizationheterogeneous platformsfork graphslatency minimizationpipeline graphs

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (1)

Reliability and performance optimization of pipelined real-time systems

Uses Software

• eSkel
• DataCutter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mapping pipeline skeletons onto heterogeneous platforms
• Optimizing latency and throughput of application workflows on clusters
• 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
• Broadcast Scheduling Optimization for Heterogeneous Cluster Systems
• Efficient partitioning of sequences
• Optimizing execution of component-based applications using group instances

This page was built for publication: Complexity results for throughput and latency optimization of replicated and data-parallel workflows