高级检索

    一种资源优化的双最小均衡Web集群区分服务调度算法

    A Resource Optimizing Scheduling Algorithm of Differentiated Service of Double Minimum Balance in Web Clusters

    • 摘要: 在一种新的Web集群体系结构的基础上,提出了一种资源优化的双最小均衡区分服务调度算法:首先在前端调度器按资源均衡度将Web请求分配到各后台服务器.然后将Web请求的优先级与资源均衡度两个特征参数结合起来,综合设计后台服务器的Web请求调度顺序,为了评估该算法的性能,进行了大量的模拟实验.在与其他著名调度策略如分离式调度的对比结果显示:双最小均衡调度算法使Web请求的效率提高了11%,同时很好地实现了区分服务.证实了资源优化调度策略具有一定的普遍意义.

       

      Abstract: Based on a new Web cluster architecture, a resource optimizing scheduling algorithm of differentiated service of double minimum balance is proposed. First, Web requests are dispatched to each back end server by resource balancing in the front scheduler. Second, the priority of Web requests and resource balancing are aggregated to design the scheduling queue of Web requests in back end server. In order to estimate the performance of the algorithm, much simulating experiments are conducted. Compared with other notable scheduling policies such as the separate scheduling strategy, the results indicate that the scheduling algorithm of double minimum balance can dramatically enhance the Web request efficiency by 11% and differentiated service is realized very well, which demonstrates the universality of the resource optimizing scheduling algorithm.

       

    /

    返回文章
    返回