カネミツ　ヒデヒロ   Hidehiro Kanemitsu   金光　永煥    所属   コンピュータサイエンス学部 コンピュータサイエンス学科    職種   専任講師
言語種別	英語
発行・発表の年月	2017/11
形態種別	学術論文
査読	査読あり
標題	Prior node selection for scheduling workflows in a heterogeneous system
執筆形態	共著
掲載誌名	Journal of Parallel and Distributed Computing (Elsevier JPDC)
掲載区分	国外
出版社・発行元	Elsevier
巻・号・頁	Vol.109,pp.155-177
著者・共著者	Hidehiro Kanemitsu, Masaki Hanada, and Hidenori Nakazato
概要	Many workflow scheduling algorithms for heterogeneous systems have been developed to satisfy multiple requirements such as minimizing schedule length while maximizing throughput. In particular, in list-based scheduling approaches, the schedule length depends on the given nodes as well as the task allocation and ordering policies. This is because the scheduling priority is derived by averaging the execution time and communication time of the given nodes. If the set of nodes can be adjusted before the scheduling tasks, a small schedule length can be achieved. In this paper, we propose a prior node selection algorithm, called lower bound based candidate node selection (LBCNS) to select a subset of given nodes to minimize the schedule length while fairly scheduling each job. Our proposal has two approaches: (i) LBCNS_DEFAULT, which considers the job characteristics and each node's performance, and (ii) priority-based LBCNS, which additionally takes each scheduling priority into account for a dedicated task scheduling algorithm. The experimental results of extensive simulations show that LBCNS_DEFAULT has the best fairness for scheduling multiple workflow jobs, while priority-based LBCNS achieves the minimum schedule length with the highest efficiency for a single workflow job and multiple workflow jobs.