Computer Science ›› 2016, Vol. 43 ›› Issue (8): 199-203.doi: 10.11896/j.issn.1002-137X.2016.08.040

Previous Articles     Next Articles

Multi-objective Dynamic Priority Request Scheduling Based on Reward-driven Request Classification

CHEN Mei-mei   

  • Online:2018-12-01 Published:2018-12-01

Abstract: The general target of request scheduling is to maximize throughput and minimize response time under the condition that existing system resource is in full use.But for a busy business Web system with the goal of revenue gene-ration,it is crucial to increase the completion rate of transaction related requests and requests from VIP.Aiming at the multiple objectives of request scheduling for business Web server,the multi-dimension criterion for reward-driven request classification was firstly presented.Then,based on the definitions of request priority and scheduling priority,the algorithm of multi-objectives dynamic priority scheduling was proposed,which can provide DiffServ and QoS guarantee adaptively for business Web system under the variety workload.At the same time,the dynamic scheduling mechanism was introduced based on one-step-ahead overload estimation instead of the workload measurement to avoid the control delay.Simulation experiment shows the validity of this scheduling mechanism and algorithm.Through the comparison of the completion rate of transaction requests as well as the average response time with that of the traditional method FCFS,MODP proves its preferential principle under not only lower workload but also overload condition.

Key words: Request classification,Request priority,Request scheduling,Scheduling optimization,Business Web server

[1] Loh S,Wives L K,de Oliveira J P.Concept-based knowledge discovery in texts extracted from the Web[J].SIGKDD Explorations,2000,2(1):29-39
[2] Schroeder B,Harchol-Baher M.Web servers under overload:how scheduling can help[J].ACM Trans.on Internet Technology,2006,6(1):20-52
[3] Menasce D A,Almeida V A F,Riedi R,et al.In search of Inva-riants for e-business workload[C]∥Proceedings of 2000 ACM Conference in E-commerce,Minneapolis.MN,2000:17-20
[4] Elnikety S,Nahum E,Tracey J,et al.A Method for Transparent Admission Control and Request Scheduling in E-commerce Web Sites[C]∥Proceedings of the 13th International Conference on World Wide Web.New York,USA:ACM Press,May 2004:276-286
[5] Cherkasova L.Scheduling strategy to improve response time for web applications[C]∥Proceedings High Performance Computing and Networking.Amsterdam,Apr.1998:305-314
[6] Guitart J,Carrera D,Beltran V,et al.Session-based adaptiveoverload control for secure dynamic web applications [C]∥Proceedings of the 2005 International Conference on Parallel Processing.Oslo,Norway,Jun.2005:341-349
[7] Singhmar N,Mathur V,Apte V,et al.A combined LIFO-priority scheme for overload control of e-commerce Web servers[C]∥International Infrastructure Survivability Workshop.Lisbon,Portugal,2006:5-8
[8] Doshi B T,Heffes H .Overload performance of several processor queuing disciplines for the M/M/1 queue[J].IEEE Transactions on Communications,1986,4(6):538-546
[9] Cao Lin-qi,Xiao Xiao-qiang,et al.DPSP:A client request sche-duling policy based on Web content[J].Journal of Computer Research and Development,2002,9(12):142-147(in Chinese) 曹林奇,肖晓强,等.DPSP:一种基于内容的客户请求调度策略[J].计算机研究与发展,2002,9(12):142-147
[10] Martin F A,Carey L W.Web server workload characterization:The search for invariants[C]∥Proceedings of ACM SIGM ETR ICS 1996.Philadelphia,1996:126-137
[11] Guan He-qing,Zhang Wen-bo,et al.An application-aware web service requests scheduling strategy[J].Chinese Journal of Computers,2006,9(7):1189-1198(in Chinese) 官荷卿,张文博,等.一种应用敏感的Web服务请求调度策略[J].计算机学报,2006,9(7):1189-1198

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!