Scheduling moldable tasks for dynamic SMP clusters in soc technology

Authors:
Lukasz Masko;Pierre–Francois Dutot;Gregory Mounie;Denis Trystram;Marek Tudruj
Affiliations:
Institute of Computer Science of the Polish Academy of Sciences, Warsaw, Poland;Laboratoire Informatique et Distribution, IMAG, Montbonot St. Martin, France;Laboratoire Informatique et Distribution, IMAG, Montbonot St. Martin, France;Laboratoire Informatique et Distribution, IMAG, Montbonot St. Martin, France;Institute of Computer Science of the Polish Academy of Sciences, Warsaw, Poland
Venue:
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Year:
2005

Citing 6
Cited 6

Scheduling precedence graphs in systems with interprocessor communication times

SIAM Journal on Computing
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors

IEEE Transactions on Parallel and Distributed Systems
Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Dynamic SMP Clusters with Communication on the Fly in NoC Technology for Very Fine Grain Computations

ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
Scheduling malleable tasks with precedence constraints

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Atomic operations for task scheduling for systems based on communication on-the-fly between SMP clusters

ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing

Multi-CMP module system based on a look-ahead configured global network

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Comparison of program task scheduling algorithms for dynamic SMP clusters with communication on the fly

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Multi-CMP system with data communication on the fly

The Journal of Supercomputing
Scheduling architecture---supported regions in parallel programs

PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume Part I
Multiple Workflow Scheduling Strategies with User Run Time Estimates on a Grid

Journal of Grid Computing
Scheduling parallel programs based on architecture: supported regions

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on the fly. The algorithm is based on the concept of moldable computational tasks. First, an initial program graph is decomposed into sub–graphs, which are then treated as moldable tasks. So identified moldable tasks are then scheduled using an algorithm with warranted schedule length.