Chakhlevitch, N (2013) Scheduling divisible loads to optimize the computation time and cost. In: Lecture Notes in Computer Science. 10th International Conference “Economics of Grids, Clouds, Systems, and Services” (GECON 2013), 18-20 Sep 2013, Zaragoza, Spain. Springer , 138 - 148. ISBN 978-3-319-02413-4
Abstract
Efficient load distribution plays an important role in grid and cloud applications. In a typical problem, a divisible load should be split into parts and allocated to several processors, with one processor responsible for the data transfer. Since processors have different speed and cost characteristics, selecting the processor order for the transmission and defining the chunk sizes affect the computation time and cost. We perform a systematic study of the model analysing the properties of Pareto optimal solutions. We demonstrate that the earlier research has a number of limitations. In particular, it is generally assumed that the load should be distributed so that all processors have equal completion times, while in fact this property is satisfied only for some deadlines; for many optimal schedules this property does not hold. Moreover, fixing the processor sequence in the non-decreasing order of the cost-characteristic may be appropriate only for Pareto-optimal solutions with relatively large deadlines; optimal schedules for tight deadlines may have a different order of processors. We conclude with an efficient algorithm for finding the time-cost trade-off.
Metadata
Authors/Creators: |
|
---|---|
Keywords: | Scheduling; divisible load; time/cost optimization |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 26 Mar 2014 10:23 |
Last Modified: | 19 Dec 2022 13:26 |
Published Version: | http://dx.doi.org/10.1007/978-3-319-02414-1_10 |
Status: | Published |
Publisher: | Springer |
Identification Number: | https://doi.org/10.1007/978-3-319-02414-1_10 |