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

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Wong, A. K. L., & Goscinski, A. M. (2004). Scheduling of a parallel computation-bound application and sequential applications executing concurrently on a cluster - A case study. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3358, 648–655. https://doi.org/10.1007/978-3-540-30566-8_76

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free