Scheduling Divisible Loads to Optimize the Computation Time and Cost
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.
KeywordsScheduling Divisible Load Time/cost Optimization
Unable to display preview. Download preview PDF.
- 1.Abdullaha, M., Othman, M.: Cost-based multi-QoS job scheduling using divisible load theory in cloud computing. In: Proceedings of the 2013 International Conference on Computational Science (ICCS), pp. 928–935 (2013)Google Scholar
- 6.Choi, K., Robertazzi, T.G.: Cost performance analysis in multi-level tree networks. In: Proceedings of the Ninth International Symposium on Parallel and Distributed Computing (ISPDC), pp. 41–48 (2010)Google Scholar
- 7.Chuprat, S., Baruah, S.: Real-time divisible load theory: incorporating computation costs. In: Proceedings of the 17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pp. 33–37 (2011)Google Scholar
- 9.Hu, M., Luo, J., Veeravalli, B.: Optimal provisioning for scheduling divisible loads with reserved cloud resources. In: Proceedings of the IEEE International Conference on Networks (ICON), pp. 204–209 (2012)Google Scholar
- 12.Lin, W., Liang, C., Wang, J.Z., Buyya, R.: Bandwidth-aware divisible task scheduling for cloud computing. Software: Practice and Experience (accepted, available online, 2013)Google Scholar
- 16.Yu, J., Buyya, R., Ramamohanarao, K.: Workflow Scheduling Algorithms for Grid Computing. In: Xhafa, F., Abraham, A. (eds.) Meta. for Sched. in Distri. Comp. Envi. SCI, vol. 146, pp. 173–214. Springer, Heidelberg (2008)Google Scholar