Title :
Analysis of JSQ policy on soft real-time scheduling in cluster
Author_Institution :
Dept. of Comput. Sci. & Electr. Eng., Queensland Univ., Qld., Australia
Abstract :
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.
Keywords :
approximation theory; concurrency theory; processor scheduling; real-time systems; workstation clusters; JSQ policy; accuracy; approximate analytical model; cluster computing; join-the-shortest-queue policy; simulation; soft real-time scheduling;
Conference_Titel :
High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on
Conference_Location :
Beijing, China
Print_ISBN :
0-7695-0589-2
DOI :
10.1109/HPC.2000.846562
