Approximate Performance analysis for the Double Servers in the Asynchronous Schedule Mechanism of Polling

Full Text (PDF, 138KB), PP.8-13

Views: 0 Downloads: 0

Author(s)

BAO Li-yong 1,* ZHAO Dong-feng 1 ZHAO Yi-fan 1

1. School of Information Engineering, Yunnan University Kunming, 650091, China

* Corresponding author.

DOI: https://doi.org/10.5815/ijeme.2012.09.02

Received: 25 May 2012 / Revised: 11 Jul. 2012 / Accepted: 22 Aug. 2012 / Published: 29 Sep. 2012

Index Terms

Web server, multiqueue double servers polling, asynchronous schedule mechanism, approximate analysis Algorithm

Abstract

With the popularity of network, web is becoming one of the most effective ways in information sharing. However, with the increase of clicking index, a high-function server can hardly meet the increasing demand for service. This thesis provides the schedule strategy in the asynchronous mechanism of multiqueue double servers polling, which is conducted based on theory of polling multi-access and simulation experiments on computer, along with consideration to the load features of Web. It concludes that this strategy enables Web server to take on the features of good extendibility, utility and function.

Cite This Paper

BAO Li-yong,ZHAO Dong-feng,ZHAO Yi-fan,"Approximate Performance analysis for the Double Servers in the Asynchronous Schedule Mechanism of Polling", IJEME, vol.2, no.9, pp.8-13, 2012. DOI: 10.5815/ijeme.2012.09.02

Reference

[1] V. Cardellini, M. Colajanni, P.S. Yu, “Dynamic load balancing on Web-server systems,” IEEE Internet Computing, vol.3, pp.28–39, 1999.

[2] Luciano Bertini, Julius C.B. Leite, Daniel Mossé, “Power optimization for dynamic configuration in heterogeneous web server clusters,” Journal of Systems and Software vol.83, pp.585-598, April.2010

[3] Seungmin Baek, Hwakyung Rim, Sungchun Kim. “Socket-based RR scheduling scheme for tightly coupled clusters providing single-name images,” Journal of Systems Architecture, Volume 50, Issue 6, pp. 299-308, June. 2004.

[4] Lin Chuang ,YANG Shi qiang, “Performance Analysis of Scheduling Schemes in Multiserver Multiqueue Systems, ” Acta Elacta Electronica Sinica, vol.28,pp. 17-20, May. 2000.

[5] Lin Chuang , “Performance Analysis of Request Dispatching and Selecting in Web Server Clusters,” Chinese J Computer, vol.23,pp. 500-508,May. 2000. (in Chinese)

[6] Takagi H. Analysis of Polling Systems[M]. Cambridge, MA: The M.I.T. Press, 1986.

[7] Zhao Dongfeng, Zheng Sumin, “Message Waiting Time Analysis for a Polling System with Gated Service,” Journal of China Institute of Communications, vol. 15, pp. 18-23, February. 1994. (in Chinese)

[8] Zhao Dongfeng, Zheng Sumin, “Analysis of a Polling Model with Exhaustive Service,” Acta. Electronica Sinica, vol.22, pp. 102-107, May.1994. (in Chinese)

[9] LEI YingChun, ZHOU You Ying, and L I J un, “Evaluation on High Performance L52Dispatcher,” Journal of Computer Research and Development, vol.40 ,pp.475-482, May.2003. (in Chinese)