Optimal mapping of sequences of data parallel tasks
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Optimal latency-throughput tradeoffs for data parallel pipelines
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Scheduling flowshops with finite buffers and sequence-dependent setup times
Computers and Industrial Engineering
Efficient collective communication in distributed heterogeneous systems
Journal of Parallel and Distributed Computing
Efficient Collective Communication in Distributed Heterogeneous Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Mapping pipeline skeletons onto heterogeneous platforms
Journal of Parallel and Distributed Computing
ACO-based scheduling of parallel batch processing machines to minimize the total weighted tardiness
CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
Modular architecture of the microfactories for automatic micro-assembly
Robotics and Computer-Integrated Manufacturing
| Hi-index | 0.00 |
We tackle pipeline workflow applications that are executed on a distributed platform with setup times. Several computation stages are interconnected as a linear application graph, and each stage holds a buffer of limited size where intermediate results are stored and a processor setup time occurs when passing from one stage to another. In this paper, we focus on interval mappings (consecutive stages mapped on a same processor), and the objective is the throughput optimization. Even when neglecting setup times, the problem is NP-hard on heterogeneous platforms and we therefore restrict to homogeneous resources. We provide an optimal algorithm for constellations with identical buffer capacities. When buffer sizes are not fixed, we deal with the problem of allocating the buffers in shared memory and present a b/(b+1)-approximation algorithm.