The Complexity of Optimal Queuing Network Control
Mathematics of Operations Research
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Scheduling Distributed Applications: the SimGrid Simulation Framework
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
A study of meta-scheduling architectures for high throughput computing: Pull versus Push
ISPDC '05 Proceedings of the The 4th International Symposium on Parallel and Distributed Computing
A batch scheduler with high level components
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Workload characteristics of a multi-cluster supercomputer
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Workload analysis of a cluster in a grid environment
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
A mean field approach for optimization in particle systems and applications
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
A mean field approach for optimization in discrete time
Discrete Event Dynamic Systems
The price of forgetting in parallel and non-observable queues
Performance Evaluation
Job allocation strategies for energy-aware and efficient Grid infrastructures
Journal of Systems and Software
ATLAS grid workload on NDGF resources: analysis, modeling, and workload generation
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
In this paper we propose a new routing policy to route jobs to clusters in computational grids. This routing policy is based on index tables computed at each cluster. These tables can be computed off-line or on-line. Their computations use predictions about the average future behavior of the grid. We show how can be used in practice for task allocations in computational grids. We also report numerous simulations providing numerical evidence of the efficiency of our index routing policy compared with the classical brokers used in most production grids today.