Evaluation of task clustering algorithm by FFT for heterogeneous distributed system

Shuya Hashimoto, Emilia Ndilokelwa Weyulu, Kazuo Hajikano, Hidehiro Kanemitsu, Moo Wan Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, the evaluation result of a task clustering heuristic algorithm proposed for heterogeneous distributed systems is shown. The proposed heuristic algorithm is based on our original concept, known as 'Worst Schedule Length (WSL)'. It derives the lower bound of the total execution time of the cluster for each processor using WSL, then the processor which contributes to minimize WSL is chosen as an assignment target. Task clustering is then performed to get minimal response time (i.e., minimal schedule length). We show that our proposed method has advantages over existing conventional approaches through the evaluation results.

Original languageEnglish
Title of host publication19th International Conference on Advanced Communications Technology: Opening Era of Smart Society, ICACT 2017 - Proceeding
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages94-97
Number of pages4
ISBN (Electronic)9788996865094
DOIs
Publication statusPublished - 2017 Mar 29
Event19th International Conference on Advanced Communications Technology, ICACT 2017 - Pyeongchang, Korea, Republic of
Duration: 2017 Feb 192017 Feb 22

Other

Other19th International Conference on Advanced Communications Technology, ICACT 2017
CountryKorea, Republic of
CityPyeongchang
Period17/2/1917/2/22

Keywords

  • Big data
  • Distributed processing
  • Fast fourier transform
  • Task graph

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Evaluation of task clustering algorithm by FFT for heterogeneous distributed system'. Together they form a unique fingerprint.

Cite this