An implementation of a concurrent gang scheduler for a PC‐based cluster system
Kazuki Hyoudou, Yasuyuki Kozakai, Yasuichi Nakayama · Systems and Computers in Japan · 2007
Abstract In recent years PC‐based cluster systems have been used more and more due to their excellent cost performance and high degree of flexibility. With a view to constructing systems at lower costs and with sufficient performance capacity, we have designed and implementedFireClusterthat consists of a PC‐based cluster system in which nodes are connected via the IEEE 1394 interface. Parallel job scheduling is important to use modern multiprocessor parallel computers efficiently. For example,gang schedulingis suitable for cluster systems that provide a user‐level communication library and many gang schedulers have been implemented for such systems. However, on low‐cost cluster systems with relatively low communication performance, the communications costs associated with a gang scheduling system whereby all nodes are synchronized each time the system switches jobs can be a significant problem. Therefore, we focus onconcurrent gang schedulingand have implemented a concurrent gang scheduler for PC‐based cluster systems. The experimental results show that the system is able to perform synchronization with low communications costs, switch jobs with a low overhead, and is highly scalable to increases in the number of nodes. © 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(3): 39–48, 2007; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/scj.20458