The week's pick
Random Articles
Reseach Article
Enhancing the Performance of Feedback Scheduling
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 18 - Number 4 |
| Year of Publication: 2011 |
| Authors: Ayan Bhunia |
10.5120/2274-2939
|
Ayan Bhunia . Enhancing the Performance of Feedback Scheduling. International Journal of Computer Applications. 18, 4 ( March 2011), 11-16. DOI=10.5120/2274-2939
Abstract
Feedback scheduling is a kind of process scheduling mechanism where process doesn’t come with any priority. According to the CPU burst needed by the process and the CPU burst remaining the processes are shifted between queues of the feedback scheduler to get completed. In multilevel feedback queue the total architecture is divided into multiple prioritised queues. In this paper, we give an approach for jobs which starve in the lower priority queue for long time to get CPU cycle. As a result response time of those starved processes decreases eight to ten percent and over all turn around time of the whole scheduling process decreases around eight to ten percents. In comparison to other types of MLFQs the performance of the proposed scheduling technique is better and practical according to the consequence.
References
- Hoganson, Kenneth (2009), “Reducing MLFQ Scheduling Starvation with Feedback and Exponential Averaging”, Consortium for Computing Sciences in Colleges, Southeastern Conference, Georgia.
- Liu, Chang, Zhao, Zhiwen and Liu, Fang (2009), “An Insight into the Architecture of Condor –A Distributed Scheduler”, IEEE, Beijing, China.
- Parvar, Mohammad R.E, Parvar, M. E. and Safari, Saeed (2008), “A Starvation Free IMLFQ Scheduling Algorithm Based on Neural Network”, International Journal of Computational Intelligence Research ISSN 0973-1873 Vol.4, No.1 pp. 27–36
- Wolski, Rich, Nurmi, Daniel and Brevik, John (2007), “An Analysis of Availability Distributions in Condor”, IEEE, University of California, Santa Barbara.
- Torrey, L.A., Coleman, J. and Miller, B.P. (2007), “A Comparison of the Interactivity in the Linux 2.6 Scheduler and an MLFQ Scheduler”, Software Practice and Experience, Vol. 37, No 4, pg. 347-364, John Wiley & Sons, Ltd.
- Becchetti, L., Leonardi, S. and Marchetti S.A. (2006), “Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm” Mathematics of Operation Research Vol. 31, No. 1, February, pp. 85–108.
- Abawajy, Jemal H. (2002), “Job Scheduling Policy for High Throughput Computing Environments”, Ninth IEEE International Conferences on Parallel and Distributed Systems , Ottawa, Ontorio, Canada.
- Basney, Jim and Livny, Miron (2000), “Managing Network Resources in Condor”, 9th IEEE Proceedings of the International Symposium on High Performance Distributed Computing, Washington, DC, USA.
- Litzkow, Micheal J., Linvy, Miron and Mutka, Matt W. (1988), “Condor – A Hunter of Idle Workstations” IEEE, Department of Computer Sciences, University of Wisconsin, Madison.
- Scheduling: The Multilevel Feedback Queue. http://pages.cs.wisc.edu/~remzi/Classes/537/Fall2009/Notes/cpu-sched-mlfq.pdf
- Condor Team, University of Winconsin-Madision, “Condor Version 7.2.5 Manual”.
Index Terms
Keywords