Analysis of JSQ Policy on Soft Real-Time Scheduling in Cluster

摘要

We study the join the shortest queue (JSQ) policy in this paper under the context of soft real-time schedul-ing, and propose an approximate analytical model. The result obtained from the approximate analysis is compared against the simulation one, that shows the approximate analysis is highly accurate. Thus, the ap-proximate analysis can be applied to the development of soft real-time systems.