Complexity of scheduling parallel task systems
SIAM Journal on Discrete Mathematics
PYRROS: static task scheduling and code generation for message passing multiprocessors
ICS '92 Proceedings of the 6th international conference on Supercomputing
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
A Framework for Exploiting Task and Data Parallelism on Distributed Memory Multicomputers
IEEE Transactions on Parallel and Distributed Systems
LogGP: incorporating long messages into the LogP model for parallel computation
Journal of Parallel and Distributed Computing
Efficient approximation algorithms for scheduling malleable tasks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Compiler support for task scheduling in hierarchical execution models
Journal of Systems Architecture: the EUROMICRO Journal - Special issue on tools and environments for parallel program development
Scheduling malleable and nonmalleable parallel tasks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A Transformation Approach to Derive Efficient Parallel Implementations
IEEE Transactions on Software Engineering - Special issue on architecture-independent languages and software tools parallel processing
Condor: a distributed job scheduler
Beowulf cluster computing with Linux
Parallax: A Tool for Parallel Program Scheduling
IEEE Parallel & Distributed Technology: Systems & Technology
CASCH: A Tool for Computer-Aided Scheduling
IEEE Concurrency
Hypertool: A Programming Aid for Message-Passing Systems
IEEE Transactions on Parallel and Distributed Systems
Symbolic Performance Modeling of Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
A Low-Cost Approach towards Mixed Task and Data Parallel Scheduling
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
CPR: Mixed Task and Data Parallel Scheduling for Distributed Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Task Scheduling Algorithms for Heterogeneous Processors
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
One-Step Algorithm for Mixed Data and Task Parallel Scheduling without Data Replication
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Performance modelling for task-parallel programs
Performance analysis and grid computing
GRASP: A Grid Resource Allocation System based on OGSA
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Critical Path and Area Based Scheduling of Parallel Task Graphs on Heterogeneous Platforms
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A Comparison of Scheduling Approaches for Mixed-Parallel Applications on Heterogeneous Platforms
ISPDC '07 Proceedings of the Sixth International Symposium on Parallel and Distributed Computing
A $\frac32$-Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
SIAM Journal on Computing
A Transformation Framework for Communicating Multiprocessor-Tasks
PDP '08 Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)
New challenges of parallel job scheduling
JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing
Optimizing layer-based scheduling algorithms for parallel tasks with dependencies
Concurrency and Computation: Practice & Experience
A scheduling toolkit for multiprocessor-task programming with dependencies
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Task graph pre-scheduling, using Nash equilibrium in game theory
The Journal of Supercomputing
| Hi-index | 0.00 |
Programs using parallel tasks can be represented by task graphs so that scheduling algorithms can be used to find an efficient execution order of the parallel tasks. This article proposes a flexible, component-based and extensible scheduling framework called SEParAT that supports the scheduling of a parallel program in multiple ways. The article describes the functionality and the software architecture of SEParAT. The flexible interfaces enable the cooperation with other programming tools, e.g., tools exploiting a specification of the parallel task structure of an application. The core component of SEParAT is an extensible scheduling algorithm library that provides an infrastructure to determine efficient schedules for task graphs. Homogeneous as well as heterogeneous platforms can be handled. The article also includes detailed experimental results comprising the evaluation of SEParAT as well as the evaluation of a variety of scheduling algorithms.