Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Journal of the ACM (JACM)
Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
MapReduce Programming Model for .NET-Based Cloud Computing
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
The impact of virtualization on network performance of amazon EC2 data center
INFOCOM'10 Proceedings of the 29th conference on Information communications
Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
CLOUDCOM '10 Proceedings of the 2010 IEEE Second International Conference on Cloud Computing Technology and Science
Towards Profitable Virtual Machine Placement in the Data Center
UCC '11 Proceedings of the 2011 Fourth IEEE International Conference on Utility and Cloud Computing
Hi-index | 0.00 |
We consider the problem of running a large amount of independent equal-sized tasks in the cloud with a budget constraint from the perspective of the cloud users. We model the cloud infrastructure by a node-weighted edge-weighted star-shaped graph and focus on the maximisation of the steady-state throughput. We show that the specific budget-constrained steady-state throughput maximisation problem can be formulated and solved as a linear programming (LP) problem. We incorporate the compute nodes of different communication capacity into our problem formulation in a unified way. We identify two modes of the system where closed-form solutions exist, i.e., the budget-bound mode and the communication-bound mode. The best scheduling scheme is benefit-first (resp. communication-first) when the system is budget-bound (resp. communication-bound), where tasks should be scheduled onto the compute nodes in the descending order of the effective benefit (resp. bandwidth). When the system is under conditions other than these two modes, we propose a simple heuristic to solve it instead of resolving to the conventional numerical algorithms for the LP. Simulation results show that the simple heuristic outperforms other intuitive heuristics under varied sampled system setups.