The week's pick
Random Articles
Reseach Article
Parallel Job Scheduling in Cloud with Lookahead and Workload Consolidation
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 99 - Number 19 |
| Year of Publication: 2014 |
| Authors: Swathi S, Thushara A, Shabi Kamal |
10.5120/17483-8386
|
Swathi S, Thushara A, Shabi Kamal . Parallel Job Scheduling in Cloud with Lookahead and Workload Consolidation. International Journal of Computer Applications. 99, 19 ( August 2014), 23-26. DOI=10.5120/17483-8386
Abstract
The cloud computing paradigm enables consumers to run their applications in remote data centers. Many of these applications may be complex which requires parallel processing capabilities. Parallel job scheduling techniques mainly focus on improving responsiveness and utilization. For a data center that deals with parallel jobs, it is important to devise an optimal schedule which results in maximal utilization of available node capacity. For that, this paper propose a parallel job scheduling technique which uses the key concepts such as workload consolidation through virtualization technologies and backfilling with look ahead mechanism. The proposed method is compared to scheduling using backfilling technique with workload consolidation. The results show that the proposed method with lookahead mechanism has shown better performance.
References
- D. Feitelson, L. Rudolph, U. Schwiegelshohn, K. Sevcik, and P. Wong, "Theory and Practice in Parallel Job Scheduling," Proc. Workshop Job Scheduling Strategies for Parallel Processing, pp. 1-34,1997
- U. Schwiegelshohn and R. Yahyapour, "Analysis of First-ComeFirst-Serve Parallel Job Scheduling,"Proc. Ninth Ann. ACM-SIAM Symp. Discrete Algorithms,pp. 629-638, 1998.
- D. Feitelson and M. Jettee, "Improved Utilization and Responsiveness with Gang Scheduling," Proc. Workshop Job Scheduling Strategies for Parallel Processing,pp. 238-261, 1997.
- J. K. Ousterhout, "Scheduling techniques for concurrent systems," Proceedings of Third International Conference on Distributed Computing Systems, May 1982, pp. 20-30.
- A. Mu'alem and D. Feitelson, "Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM sp2 with Backfilling,"IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 6, pp. 529-543, June 2001.
- Edi Shmueli, Dror G. Feitelson, "Backfilling with lookahead to optimize the packing of parallel jobs," Elsevier ScienceDirect Journal of Parallel and Distributed Computing. July 2005
- Y. Wiseman and D. Feitelson, "Paired Gang Scheduling,"IEEE Trans. Parallel and Distributed Systems,vol. 14, no. 6, pp. 581-592, June 2003.
- Y. Zhang, H. Franke, J. Moreira, and A. Sivasubramaniam, "An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration," IEEE Trans. Parallel and Distributed Systems,vol. 14, no. 3, pp. 236-247, Mar. 2003.
- Marco Xiaocheng Liu, Chen Wang, Bing Bing Zhou, Junliang Chen, Ting Yang, and Albert Y. Zomaya, Fellow, "Priority-Based Consolidation of Parallel Workloads in the Cloud", IEEE Transactions On Parallel And Distributed Systems, Vol. 24, No. 9, September 2013.
- Rajkumar Buyya, Rajiv Ranjan and Rodrigo N. Calheiros, "Modeling and Simulation of Scalable Cloud ComputingEnvironments and the CloudSim Toolkit: Challenges and Opportunities," 2009.
Index Terms
Keywords