Scheduling divisible jobs on hypercubes
Parallel Computing
Distributed processing of divisible jobs with communication startup costs
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better
CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Optimal Algorithms for Scheduling Divisible Workloads on Heterogeneous Systems
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
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
Grid scheduling divisible loads from two sources
Computers & Mathematics with Applications
| Hi-index | 0.00 |
In grid computing environment the workload can be submitted by various grid users. Allocating a load to the resources from various grid users is a challenging task in grid scheduling process. So we need a better resource allocation framework to schedule the tasks from various sources to the dynamic resources. This paper introduces a new divisible load scheduling framework to map the task to the distributed resources in grid computing environment. We have developed a mathematical model to allocate tasks to resource when the task is submitted by various grid users sources with the aim of minimising the completion time of scheduling process with satisfying the budget allotted by the grid user based on divisible load theory. This model helps to estimate the resource usage cost of each source under the fluctuation of resource availability and the performance evaluation of three resource homogeneous resources and the link capacity is presented.