UET scheduling with unit interprocessor communication delays
Discrete Applied Mathematics
Automatic determination of grain size for efficient parallel processing
Communications of the ACM - Special issue: multiprocessing
Towards an architecture-independent analysis of parallel algorithms
SIAM Journal on Computing
PYRROS: static task scheduling and code generation for message passing multiprocessors
ICS '92 Proceedings of the 6th international conference on Supercomputing
ANDES: evaluating mapping strategies with synthetic programs
Journal of Systems Architecture: the EUROMICRO Journal
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
On the Granularity and Clustering of Directed Acyclic Task Graphs
IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
The Complexity of Scheduling Problems with Communication Delays for Trees
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Scheduling multithreaded computations by work stealing
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Genetic Scheduling on Minimal Processing Elements in the Grid
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
A task duplication scheme for resolving deadlocks in clustered DAGs
Parallel Computing
An optimal schedule for Gaussian elimination on an MIMD architecture
Journal of Computational and Applied Mathematics
A New Genetic Algorithm for Scheduling for Large Communication Delays
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
An optimal schedule for Gaussian elimination on an MIMD architecture
Journal of Computational and Applied Mathematics
Optimizing scheduling and intercluster connection for application-specific DSP processors
IEEE Transactions on Signal Processing
Scheduling with uncertainties on new computing platforms
Computational Optimization and Applications
A survey of pipelined workflow scheduling: Models and algorithms
ACM Computing Surveys (CSUR)
Reduction of deformations of the digital terrain model by merging interpolation algorithms
Computers & Geosciences
| Hi-index | 0.02 |
We are interested in this paper in studying the clustering problem in the case of large communication delays for on unbounded number of processors. It has been extensively studied OS a basic step for obtaining effiaent algorithms for scheduling the tasks of a parallel program. We present a new approach for solving this problem based on a recursive decomposition of the precedence task graph.We first establish a general result on a class of clustering algorithms with speafic properties called convex clustering that con theoretically be proved to be within a factor of 2 from the optimal. Then, we propose on algorithm for building conuex clustering. The idea is to determine two sets of independent tasks OS large OS possible that con be executed simultaneously without communications and to apply it recursively on each set. This approach is assessed by some simulations run on some families of structured task graphs.