论文部分内容阅读
Nowadays session-based applications are one of the typical applications in the Internet,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. In this paper,we investigate the Round-Robin algorithm in the context of Session-based applications. An analyzing model for such sys-tems is proposed. Through both theoretical analysis and simulation,we find the main factor for system performance. And the result also shows that this algorithm shows up with significantly different performance under various conditions.
Nowadays session-based applications are one of the typical applications in the Internet, 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 on. In this paper, we investigate the Round-Robin algorithm in the context of Session-based applications. An analyzing model for such sys-tems is proposed. Through both theoretical analysis and simulation, we find the main factor for system performance. And the result also shows that this algorithm shows up with significantly different performance under various conditions.