Scheduling of a parallel computation-bound application and sequential applications executing concurrently on a cluster - a case study
Wong, Adam and Goscinski, Andrzej 2004, Scheduling of a parallel computation-bound application and sequential applications executing concurrently on a cluster - a case study, Lecture notes in computer science, vol. 3358/2005, pp. 648-655.
Attached Files
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name
Description
MIMEType
Size
Downloads
Title
Scheduling of a parallel computation-bound application and sequential applications executing concurrently on a cluster - a case study
Studies have shown that most of the computers in a non-dedicated cluster are often idle or lightly loaded. The underutilized computers in a non-dedicated cluster can be employed to execute parallel applications. The aim of this study is to learn how concurrent execution of a computation-bound and sequential applications influence their execution performance and cluster utilization. The result of the study has demonstrated that a computation-bound parallel application benefits from load balancing, and at the same time sequential applications suffer only an insignificant slowdown of execution. Overall, the utilization of a non-dedicated cluster is improved.