IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 5    
Website: http://www.ijser.org
scirp IJSER >> Volume 3,Issue 5,May 2012
Perfomance Evaluation of Resource Scheduling Techniques In Cluster Computing
Full Text(PDF, )  PP.1-14  
Author(s)
Admire Mudzagada, Benard Mapako and Benny M Nyambo
KEYWORDS
Cluster computing, time-slice, service time, response time, waiting time, turnaround time.
ABSTRACT
Resource management and job scheduling are critical tasks in cluster computing. The heterogeneity of resources causes the scheduling of an application to be significantly complicated and a challenging task in a cluster system. The main focus of this paper is to come up with a dynamic way to calculate the time-slice that each process gets based on the service or execution time for each process. The algorithm is based on the traditional round robin scheduling algorithm. The algorithm will provide fairness on scheduling since the calculation of the time-slice is based on the service time of processes in the ready queue. The total service time of all processes in the ready queue is summed and averaged to get the time-slice. As the process arrives or leaves the ready queue the time-slice will be changing dynamically. We want to come up with an algorithm that maximizes the resource utilization and minimize processing time of jobs. The criterion for performance evaluation is based on response time, waiting time and turnaround time. We want to minimize the response time and the waiting time of all process that requests for a certain service whilst increasing throughput.
References
[1] Buyya R, Cortes T, Jin H. Single system image. The International Journal of High Performance Computing Applications 2001; 15(2):124–135.

[2] Chee Shin Yeo and Rajkumar Buyya. A taxonomy of market-based resource management systems for utility-driven cluster computing 2006; 36: 2

[3] Amal S. Khalifa, Reda A. Ammar , Tahany A. Fegrany, Mohamed E. Khalifa. A preemptive version of the Min-Min heuristics for dynamically mapping meta-tasks on a distributed heterogeneous environment; 1

[4] Abhishek Gupta. Cluster Schedulers, B.Tech, 6th Semester, 04010102 Department of Computer Science and Engineering Indian Institute of Technology Guwahati; 5-9

[5] Mark Baker. Cluster Computing Whitepaper CoRR cs.DC/0004014 (2000)

[6] J. D. Ullman, Polynomial complete scheduling problems, Proceedings of the fourth ACM symposium on Operating system principles, Pages: 96 - 101, 1973.

[7] R. van Dantzig, W. Heubers, R. Boontje, I. Herschberg, D. Epema, and J. de Jongh, A Literature was tested against the Min-min algorithm for different Study on Scheduling in Distributed Systems, Computer System group of NIKHEF, October 1992.

[8] Howard Jay Siegel and Shoukat Ali, Techniques for Mapping Tasks to Machines in Heterogeneous Computing Systems, Invited Keynote Paper for the Journal of Systems Architecture Special Issue on Heterogeneous Distributed and Parallel Architectures: Hardware, Software and Design Tools ,June 1999

[9] Samih M. Mostafa, S. Z. Rida & Safwat H. Hamad. Finding Time Quantum of Round Robin CPU Scheduling 2010; 5(1); 1

[10] Saeed Parsa and Reza Entezari-Maleki, RASA: A New Task Scheduling Algorithm in Grid Environment 152-160, 2009; 3

[11][Mullen 1985] B. Mullen, The Multics Scheduler, http://www.multicians.org/mult-sched.html (1995)

[12] E.O. Oyetunji and A. E. Oluleye, Performance Assessment of Some CPU Scheduling Algorithms, Research Journal of Information Technology 1(1): 22-26, 2009;23

[13] Muthucumaru Maheswaran, Shoukat Ali, Howard Jay Siegel, Debra Hensgen and Richard F. Freund, “Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems,” Journal of Parallel and Distributed Computing, volume 59, Pages: 107-131, 1999.

Untitled Page