Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
IEEE Transactions on Parallel and Distributed Systems
Enhanced Algorithms for Multi-site Scheduling
GRID '02 Proceedings of the Third International Workshop on Grid Computing
Theory and Practice in Parallel Job Scheduling
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Developments from a June 1996 seminar on Online algorithms: the state of the art
An Evaluation of Processor Co-allocation for Different System Configurations and Job Structures
SBAC-PAD '02 Proceedings of the 14th Symposium on Computer Architecture and High Performance Computing
TransLight: a global-scale LambdaGrid for e-science
Communications of the ACM - Blueprint for the future of high-performance networking
Evaluating Scheduling and Replica Optimisation Strategies in OptorSim
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
A Realistic Network/Application Model for Scheduling Divisible Loads on Large-Scale Platforms
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Joint computing and network resource scheduling in a lambda grid network
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Multidomain hierarchical resource allocation for grid applications
Journal of Electrical and Computer Engineering - Special issue on Resource Allocation in Communications and Computing
Hi-index | 0.00 |
Due to the large amounts of data required to be processed by the typical Grid job, it is conceivable that the use of optical transport networks in Grid deployment (hence the term "Lambda Grid") will increase. The exact topology of the interconnecting network is obtained by solving a dimensioning problem, and the outcome of this strongly depends on both the expected workload characteristics and Grid scheduling policy. Solving this combined scheduling and dimensioning problem using straightforward ILP modelling is cumbersome; however, for steady-state Grid operation, Divisible Load Theory (DLT) can yield scalable formulations of this problem.In this paper, the on-line hierarchical scheduling on a lambda Grid of workload approaching the Grid's capacity in a two-tier Grid mode of operation is studied. A number of these algorithms are goal-driven, in the sense that target per-resource goals are obtained from the off-line solution to the Divisible Load model. We compare these on-line multiresource scheduling policies for different workloads, Grid interconnection topologies and Grid parameters. We show that these algorithms perform well in the studied scenarios when compared to a fully centralized scheduling algorithm.