2010 2nd International Conference on Industrial and Information Systems a New Scheduling Algorithm for Server Farms Load Balancing

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.

[1]  Linus Schrage,et al.  The Queue M/G/1 with the Shortest Remaining Processing Time Discipline , 1966, Oper. Res..

[2]  Bruce J Tromberg,et al.  The need for speed , 2012, Smart Structures.

[3]  C. Saivichit,et al.  Methods for Performance Improvement of The access to Internet Server Farm based on Task Scheduling Techniques , 2007, The 9th International Conference on Advanced Communication Technology.

[4]  Mor Harchol-Balter,et al.  Connection Scheduling in Web Servers , 1999, USENIX Symposium on Internet Technologies and Systems.

[5]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[6]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[7]  Satish K. Tripathi,et al.  The MARUTI hard real-time operating system , 1989, OPSR.

[8]  Erich M. Nahum,et al.  Locality-aware request distribution in cluster-based network servers , 1998, ASPLOS VIII.

[9]  Eric A. Brewer,et al.  Lessons from Giant-Scale Services , 2001, IEEE Internet Comput..

[10]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

[11]  Emiliano Casalicchio,et al.  Static and dynamic scheduling algorithms for scalable Web server farm , 2001, Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing.

[12]  Mor Harchol-Balter,et al.  Web servers under overload: How scheduling can help , 2006, TOIT.

[13]  Jakob Nielsen,et al.  Speed Up Your Site: Web Site Optimization , 2003 .

[14]  SchroederBianca,et al.  Web servers under overload , 2006 .

[15]  Mor Harchol-Balter,et al.  Size-based scheduling to improve web performance , 2003, TOCS.