Referenced Items are not available for this document.
This paper describes a new scheduling algorithm to distribute jobs in server farm systems. The proposed algorithm overcomes the starvation caused by SRPT (Shortest Remaining Processing Time). This algorithm is used in process scheduling in operating system approach. The algorithm was developed to be used in dispatcher scheduling. This algorithm is non-preemptive discipline, similar to SRPT, in which the priority of each job depends on its estimated run time, and also the amount of time it has spent on waiting. Tasks in the servers are served in order of priority to optimize the system response time. The experiments show that the mean round around time is reduced in the server farm system.
Published in:
Industrial and Information Systems (IIS), 2010 2nd International Conference on
(Volume:1
)
Date of Conference: 10-11 July 2010
- Page(s):
- 417 - 420
- Print ISBN:
- 978-1-4244-7860-6
- INSPEC Accession Number:
- 11521066
- Conference Location :
- Dalian
- Digital Object Identifier :
- 10.1109/INDUSIS.2010.5565821
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
