A task scheduling method after clustering for data intensive jobs in heterogeneous distributed systems

Kazuo Hajikano, Hidehiro Kanemitsu, Moo Wan Kim, Hee Dong Kim

研究成果: Article査読

1 被引用数 (Scopus)

抄録

Several task clustering heuristics are proposed for allocating tasks in heterogeneous systems to achieve a good response time in data intensive jobs. However, one of the challenging problems is the process in task scheduling after task allocation by task clustering. We propose a task scheduling method after task clustering, leveraging worst schedule length (WSL) as an upper bound of the schedule length. In our proposed method, a task in a WSL sequence is scheduled preferentially to make the WSL smaller. Experimental results by simulation show that the response time is improved in several task clustering heuristics. In particular, our proposed scheduling method with the task clustering outperforms conventional list-based task scheduling methods.

本文言語English
ページ(範囲)9-20
ページ数12
ジャーナルJournal of Computing Science and Engineering
10
1
DOI
出版ステータスPublished - 2016 3 1

ASJC Scopus subject areas

  • Computer Science Applications
  • Engineering(all)

フィンガープリント 「A task scheduling method after clustering for data intensive jobs in heterogeneous distributed systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル