UET scheduling with unit interprocessor communication delays
Discrete Applied Mathematics
Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
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
Operations Research
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
On the robust shortest path problem
Computers and Operations Research
High Performance Cluster Computing: Architectures and Systems
High Performance Cluster Computing: Architectures and Systems
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
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
Operating Systems Theory
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
A New Clustering Algorithm for Large Communication Delays
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
LSSC '01 Proceedings of the Third International Conference on Large-Scale Scientific Computing-Revised Papers
Sensitivity Analysis for Scheduling Problems
Journal of Scheduling
Complexity of minimizing the total flow time with interval data and minmax regret criterion
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
NP-complete scheduling problems
Journal of Computer and System Sciences
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
Operations Research Letters
A New Genetic Algorithm for Scheduling for Large Communication Delays
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Stochastic DAG scheduling using a Monte Carlo approach
Journal of Parallel and Distributed Computing
Robust static resource allocation of DAGs in a heterogeneous multicore system
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
New distributed computing platforms (grids) are based on interconnections of a large number of processing elements. A most important issue for their effective utilization is the optimal use of resources through proper task scheduling. It consists of allocating the tasks of a parallel program to processors on the platform and to determine at what time the tasks will start their execution. As data may be subject to uncertainties or disturbances, it is practically impossible to precisely predict the input parameters of the task scheduling problem.We briefly survey existing approaches for dealing with data uncertainties and discuss their relevance in the context of grid computing. We describe the stabilization process and analyze a scheduling algorithm that is intrinsically stable (i.e., it mitigates the effects of disturbances in input data at runtime). This algorithm is based on a decomposition of the application graph into convex sets of vertices. Finally, it is compared experimentally to pure on-line and well-known off-line algorithms.