Scheduling in Compute Cloud With Multiple Data Banks Using Divisible Load Paradigm
- Authors
- Suresh, S.; Huang, Hao; Kim, H. J.
- Issue Date
- 4월-2015
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Citation
- IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, v.51, no.2, pp.1288 - 1297
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS
- Volume
- 51
- Number
- 2
- Start Page
- 1288
- End Page
- 1297
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/94035
- DOI
- 10.1109/TAES.2014.130201
- ISSN
- 0018-9251
- Abstract
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.