Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

CiteULike is a free service for managing and discovering scholarly references - click here to get started.

Sign In to gain access to subscriptions and/or personal tools.
International Journal of High Performance Computing Applications
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Choi, G. S.
Right arrow Articles by Yoo, A. B.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

Performance Comparison of Coscheduling Algorithms for Non-Dedicated Clusters Through a Generic Framework

Gyu Sang Choi

Samsung Advanced Institute of Technology, Samsung Electronics, MT. 14-1, Nong-Seo-Dong, Giheung-Gu, Yongin-Si, Gyeonggi-Do, Korea 446-712, gsc121.choi{at}samsung.com

Saurabh Agarwal

Ross School of Business, University of Michigan, 701 Tappan Street, Ann Arbor, MI 48109

Jin-Ha Kim

Samsung Networks, 8F, Asem Tower, World Trade Center, 159-1, Samsung-Dong, Kangnam-Ku, Seoul, Korea 135-798

Chita R. Das

The Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA 16802

Andy B. Yoo

Lawrence Livermore National Laboratory, Livermore, CA 94551

In this paper, we address several key issues in designing coscheduling algorithms for clusters. First, we propose a generic framework for deploying coscheduling techniques by providing a reusable and dynamically loadable kernel module. Second, we implement several communication-driven coscheduling algorithms [dynamic coscheduling (DCS), spin block (SB) and periodic boost (PB)] on a 16- node Linux cluster using the above framework. Third, with exhaustive experimentation using mixed workloads, we observe that unlike PB, which provided the best performance on a Solaris platform, the SB scheme outperforms all other techniques on a Linux platform. Finally, we investigate the impact of several job placement strategies, multiprogramming level (MPL), communication intensity and CPU and I/O intensive jobs on the performance of these coscheduling schemes. The experimental results show that the blocking-based coscheduling scheme (SB) has better tolerance to system workload variation compared with the spin-based schemes (DCS and PB), and overall, the blocking-based coscheduling scheme seems a better choice for non-dedicated Linux clusters.

Key Words: scheduling • measurements • distributed applications • cluster

International Journal of High Performance Computing Applications, Vol. 21, No. 1, 91-105 (2007)
DOI: 10.1177/1094342006074868
Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?