Scheduling of a parallel computation-bound application and sequential applications executing concurrently on a cluster: a case study

  • Authors:
  • Adam K. L. Wong;Andrzej M. Goscinski

  • Affiliations:
  • School of Information Technology, Deakin University, Geelong, Vic, Australia;School of Information Technology, Deakin University, Geelong, Vic, Australia

  • Venue:
  • ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.