Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution

Authors:
Stephen L. Hary;Füsun Özgüner
Affiliations:
Air Force Research Lab, Wright-Patterson, OH;Ohio State Univ., Columbus, OH
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1999

Citing 8
Cited 7

Task allocation onto a hypercube by recursive mincut bipartitioning

Journal of Parallel and Distributed Computing
Allocating hard real-time tasks: an NP-hard problem made easy

Real-Time Systems
Allocation and Scheduling of Precedence-Related Periodic Tasks

IEEE Transactions on Parallel and Distributed Systems
On Bufferless Routing of Variable Length Messages in Leveled Networks

IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems

IEEE Transactions on Computers
A Framework for Mapping Periodic Real-Time Applications on Multicomputers

IEEE Transactions on Parallel and Distributed Systems
Real-Time Interprocessor Communication for Point-to-Point Networks using Wormhole Routing

WPDRTS '96 Proceedings of the 4th International Workshop on Parallel and Distributed Real-Time Systems

Scheduling Recurrent Precedence-Constrained Task Graphs on a Symmetric Shared-Memory Multiprocessor

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Models and complexity results for performance and energy optimization of concurrent streaming applications

International Journal of High Performance Computing Applications
Optimizing latency and throughput of application workflows on clusters

Parallel Computing
Scheduling streaming applications on a complex multicore platform

Concurrency and Computation: Practice & Experience
Toward optimizing latency under throughput constraints for application workflows on clusters

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A survey of pipelined workflow scheduling: Models and algorithms

ACM Computing Surveys (CSUR)
Multi-objective exploitation of pipeline parallelism using clustering, replication and duplication in embedded multi-core systems

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of scheduling directed acyclic task flow graphs to multiprocessor systems using point-to-point networks is examined. An environment where the application has a strict throughput requirement is assumed. Pipelined parallelism is used to meet the throughput requirement. Communication and computation are completely overlapped. Each task and message has a periodic rate and deadline equal to the throughput requirement. A heuristic procedure based on preclustering, recursive mincut bipartitioning, and iterative improvement is proposed to reduce the maximum contention due to communication in the network, increasing the likelihood that messages meet their deadlines. The task assignment procedure takes into account the topology of the multiprocessor system and the distance between communicating tasks.