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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Scheduling in compute cloud with multiple data banks using divisible load paradigm


    Contributors:
    Suresh, S. (author) / Hao Huang (author) / Kim, H. J. (author)


    Publication date :

    2015-04-01


    Size :

    1370506 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    A Scheduling Algorithm with Divisible Load in Wireless Sensor Networks

    Dai, L. / Xu, H. / Chen, T. | British Library Online Contents | 2012



    An Optimization Model for Divisible-Load Scheduling Considering Processor Time-Window

    Lai, Junfan / Wang, Yuping / Wang, Xiaoli | British Library Online Contents | 2017