The main challenge in a compute cloud system is to design a scheduling strategy for heterogeneous computing resources with shared data banks. The cloud user's job arrives at the Web role, which distributes the load to the worker rules for concurrent processing. The worker role retrieves the respective data from the shared data banks. According to divisible load theory, the scheduling problem is formulated as relevant recursive equations and constraints that are derived from the continuity of processing time due to retrieval from multiple data banks. The scheduling problem in a compute cloud is formulated as a linear programming problem. Finally, we present a satellite image classification problem in a compute cloud as an example to show the adequacy of the proposed solution.
Scheduling in compute cloud with multiple data banks using divisible load paradigm
IEEE Transactions on Aerospace and Electronic Systems ; 51 , 2 ; 1288-1297
2015-04-01
1370506 byte
Article (Journal)
Electronic Resource
English
A Scheduling Algorithm with Divisible Load in Wireless Sensor Networks
British Library Online Contents | 2012
|An Optimization Model for Divisible-Load Scheduling Considering Processor Time-Window
British Library Online Contents | 2017
|PAPERS - Divisible Load Scheduling on Single-Level Tree Networks with Buffer Constraints
Online Contents | 2000
|