The week's pick
Reseach Article
A Performance Analysis of Task Scheduling Algorithms using Qualitative Parameters
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 74 - Number 19 |
| Year of Publication: 2013 |
| Authors: Abhijit A. Rajguru, S. S. Apte |
10.5120/13004-0308
|
Abhijit A. Rajguru, S. S. Apte . A Performance Analysis of Task Scheduling Algorithms using Qualitative Parameters. International Journal of Computer Applications. 74, 19 ( July 2013), 33-38. DOI=10.5120/13004-0308
Abstract
A CPU is the very important part of the computer system; hence it must be utilized efficiently. When the demand for computing power increases, then scheduling problem becomes very important. The problem of task scheduling and load balancing are most important and challenging area of research in computer engineering. Task scheduling can be defined as allocating processes to processor so that total execution time will be minimized, utilization of processors will be optimized. Load balancing is the process of improving the performance of system through a redistribution of load among processor. In this paper, the performance analysis of various task scheduling algorithms based on different qualitative parameters is presented. The analysis indicates that task scheduling algorithms have some advantages as well as disadvantages. The main purpose of this paper is to help in design of new scheduling algorithms in future by studying existing task scheduling algorithms.
References
- Sandeep Sharma, Sarabjit Singh, and Meenakshi Sharma, "Performance Analysis of Load Balancing Algorithms", World Academy of Science, Engineering and Technology, 2008.
- Veeravalli Bharadwaj, Depasish Ghose and Thomas G. Robertazzi, "Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems", Journal of Cluster computing, Vol-6, Issue-1, 2003.
- Sivakumar Viswanathan, Bharadwaj Veeravalli and Thomas G. Robertazzi, "Resource-Aware Distributed Scheduling Strategies for Large-Scale Computational Cluster/Grid Systems", IEEE Transactions on Parallel and Distributed Systems, Vol-18, 2007.
- Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar and Andrew Goldberg, "Quincy: Fair Scheduling for Distributed Computing Clusters", Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles (SOSP '09), 2009.
- M. Nikravan and M. H. Kashani, "A Genetic Algorithm for Process Scheduling in Distributed Operating Systems Considering Load balancing", Proceedings 21st European Conference on Modeling and Simulation (ECMS), 2007.
- Hermann Kopetz, "Real-Time Systems: Design Principles for Distributed Embedded Applications", Springer, second edition.
- Peter Brucker, "Scheduling Algorithms", Springer, fifth edition.
- Giorgio C. Buttazzo, "Hard Real Time Computing Systems: Predictable Scheduling Algorithms and Applications", Springer, Third edition.
- Daniel P. Bovet and Marco Cesati, "Understanding the Linux Kernel", O'Reilly Online Catalogue, October 2000.
- Hermann Kopetz, "Real-Time Systems: Design Principles for Distributed Embedded Applications", Springer, second edition.
- Ishan Khera Ajay Kakkar " Study of Scheduling Algorithms for Real Time Environment" International Journal of Computer Applications , April 2012
Index Terms
Keywords