Implementation of Gang-Scheduling on Workstation Cluster (1996)
| Citations: | 22 - 6 self |
BibTeX
@MISC{Hori96implementationof,
author = {Atsushi Hori and Hiroshi Tezuka and Yutaka Ishikawa and Noriyuki Soda and Hiroki Konaka and Munenori Maeda},
title = {Implementation of Gang-Scheduling on Workstation Cluster},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The goal of this paper is to determine how efficiently we can implement an adequate parallel programming environment on a workstation cluster without modifying the existing operating system. We have implemented a runtime environment for parallel programs and gang-scheduling on a workstation cluster. In this paper, we report the techniques used to implement gang-scheduling on a workstation cluster and the problems we faced. The most important technique is "network preemption" and a unique feature of our approach is that the gang-scheduling is also written in a parallel language. Our evaluation shows that gangscheduling on workstation clusters can be practical. 1 Introduction Workstation clusters are gathering attentions to an alternative of parallel machines [1, 2, 13]. If a workstation cluster can be made to imitate a parallel machine, then it would be a cost-effective and familiarto -use parallel execution environment. To prove this, we have implemented a parallel program execution e...
