GSM:a Dynamic Load Balance Scheduling Model of Multi-Server Systems
Jin Chen · Mini-micro Systems · 2004
Suppose: ① a multi server system is composed of n service nodes and 1 central load balance scheduling node; ② all of the servers have the same processing capability; ③ the arrivals of tasks are a Poisson stream of rate nλ; ④ the service time for a task on a server is exponentially distributed with mean 1/μ, here λμ; ⑤ both load information gathering time and task scheduling time can be omitted under ideal conditions. Based on these assumptions, a Generalized Supermarket Model (GSM) is presented, and the solution properties of the model are analyzed and proved in details. The result shows that: by use of the Generalized Supermarket Model scheduling strategy for large scale of multi server systems, comparing with that of random service node choice strategy, the mean loss time for a task on a server can be exponentially decreased; and comparing with the results of literatures , it can reach the minimum of them.