Dynamic segregation scheduling policy for Web cluster
Xia Chen · Computer Engineering and Applications Journal · 2008
Static Segregation Scheduling Policy(SSSP) can’t allocate server resources efficiently.Proposed Dynamic Segregation Scheduling Policy(DSSP) uses different servers to serve static and dynamic requests,schedules static and dynamic requests in unit of requested files and user sessions respectively.The dispatcher monitors the status of back-end servers,and classifies them into three categories:lightly loaded,heavily loaded and over loaded.Lightly loaded servers continue to accept new request units,heavily loaded servers don’t accept new request units,but keep on serving accepted request units,over loaded servers transfer some of their accepted request units to lightly loaded servers.Experiment shows that DSSP is better than SSSP.