Analysis of JSQ policy on soft real-time scheduling in cluster

The "join the shortest queue" (JSQ) policy is studied in this paper, under the context of soft real-time scheduling, and an approximate analytical model is proposed. The result obtained from the approximate analysis is compared against the simulation one, which shows that the approximate analysis is highly accurate. Thus, approximate analysis can be applied to the development of soft real-time systems.