机群系统中有状态应用的调度算法研究  

Researches on Scheduling for Session-based Applications on Clusters

作　　者：陈研[1] 徐国治[1] 

机构地区：[1]上海交通大学电子工程系

出　　处：《微计算机信息》2007年第24期179-180,97,共3页Control & Automation

摘　　要：有状态的应用是当今因特网中较为典型的一种应用,利用机群系统可以有效地实现该种应用的扩容。请求调度算法是该种系统的关键技术,它决定机群系统的性能能否充分发挥。本文研究了轮循算法在有状态应用的使用。通过理论分析和实验仿真,指出了影响系统性能的主要因素。研究表明,该法在不同的应用条件下,有显著不同的性能表现。Session-based applications are one of the typical applications in the Interact, and people build such applications on clusters on concern of scalability. Scheduling in such a cluster is a key technology since system performance depends on it. This paper investigates Round-Robin algorithm in the context of session-based applications, and finds the main factor for system performance through both theoretical analysis and simulation. The result shows that this algorithm shows up with significantly different performance under various conditions.

关 键 词：机群系统 网络应用 请求调度算法 轮循算法 

分 类 号：TP302.7[自动化与计算机技术—计算机系统结构]