Static task cluster size determination in homogeneous distributed systems

Hidehiro Kanemitsu*, Gilhyon Lee, Hidenori Nakazato, Takashige Hoshiai, Yoshiyori Urano

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)


In a distributed system, which consists of an unknown number of processors, it is important to derive an appropriate number of processors by which the good schedule length is obtained by a task scheduling. Many task clustering heuristics have been proposed to determine the number of processors and to minimize the schedule length for scheduling a directed acyclic graph (DAG) application. However, those heuristics are not aware of the actual number of existing processors. As a result, the number of processors determined by an existing task clustering may exceed that of actually existing processors. Therefore, conventional approaches adopt merging of each cluster for reducing the number of clusters at the expense of decreasing degree of task parallelism. In this paper, we present a static cluster size determination method, which derives the lower bound of the cluster size with considering the DAG structure and the task size to data size ratio to suppress the schedule length with the small number of processors. Our experimental evaluations by simulations show that the lower bound of each cluster size determined by the proposed method has a good impact on both the schedule length and the processor utilization.

Original languageEnglish
Title of host publicationSoftware Automatic Tuning
Subtitle of host publicationFrom Concepts to State-of-the-Art Results
PublisherSpringer New York
Number of pages24
ISBN (Print)9781441969347
Publication statusPublished - 2010 Dec 1


  • Cluster size
  • DAG
  • Task clustering
  • Task scheduling

ASJC Scopus subject areas

  • Engineering(all)


Dive into the research topics of 'Static task cluster size determination in homogeneous distributed systems'. Together they form a unique fingerprint.

Cite this