ON THE GRANULARITY AND CLUSTERING OF DIRECTED ACYCLIC TASK GRAPHS

被引:138
|
作者
GERASOULIS, A
YANG, T
机构
[1] Department of Computer Science, Rutgers University, New Brunswick, NJ
基金
美国国家科学基金会;
关键词
CLUSTERING; DAGS; GAUSS-JORDAN ALGORITHM; GRANULARITY; PARALLEL ARCHITECTURES; PARTITIONING; SCHEDULING;
D O I
10.1109/71.242154
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we consider the impact of the granularity on scheduling task graphs. Scheduling consists of two parts, the processors assignment of tasks and the ordering of tasks for execution in each processor. The processor assignment part is also known as clustering in the literature when there is no limitation in the number of processors and the architecture is completely connected. We introduce two types of clusterings, the nonlinear and linear clusterings. A clustering is nonlinear if two parallel tasks are mapped in the same cluster otherwise is linear. Linear clustering fully exploits the natural parallelism of a given DAG while nonlinear clustering sequentializes independent tasks to reduce parallelism. We also introduce a new quantification of the granularity of a DAG and define a coarse grain DAG as the one whose granularity is greater than one. We prove the following interesting result: Every nonlinear clustering of a coarse grain DAG can be transformed into a linear clustering which has less or equal parallel time than the nonlinear. We use this result to prove the optimality of some important linear clusterings used in parallel numerical computing. We also present experiments with an actual architecture that verify our theoretical results. These results provide a justification for the popularity of linear clustering in the literature.
引用
收藏
页码:686 / 701
页数:16
相关论文
共 50 条
  • [21] LCA queries in directed acyclic graphs
    Kowaluk, M
    Lingas, A
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 241 - 248
  • [22] Community detection in directed acyclic graphs
    Speidel, Leo
    Takaguchi, Taro
    Masuda, Naoki
    EUROPEAN PHYSICAL JOURNAL B, 2015, 88 (08):
  • [23] Algebras associated to acyclic directed graphs
    Retakh, Vladimir
    Wilson, Robert Lee
    ADVANCES IN APPLIED MATHEMATICS, 2009, 42 (01) : 42 - 59
  • [24] On counting homomorphisms to directed acyclic graphs
    Dyer, Martin
    Goldberg, Leslie Ann
    Paterson, Mike
    JOURNAL OF THE ACM, 2007, 54 (06)
  • [25] Recursive processing of directed acyclic graphs
    Bianchini, M
    Gori, M
    Scarselli, F
    NEURAL NETS WIRN VIETRI-01, 2002, : 96 - 101
  • [26] Ternary directed acyclic word graphs
    Miyamoto, S
    Inenaga, S
    Takeda, M
    Shinohara, A
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2003, 2759 : 120 - 130
  • [27] HEURISTIC CHAINING IN DIRECTED ACYCLIC GRAPHS
    VENUGOPAL, R
    SRIKANT, YN
    COMPUTER LANGUAGES, 1993, 19 (03): : 169 - 184
  • [28] Broadcasting on Random Directed Acyclic Graphs
    Makur, Anuran
    Mossel, Elchanan
    Polyanskiy, Yury
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (02) : 780 - 812
  • [29] On compact directed acyclic word graphs
    Crochemore, M
    Verin, R
    STRUCTURES IN LOGIC AND COMPUTER SCIENCE: A SELECTION OF ESSAYS IN HONOR OF A. EHRENFEUCHT, 1997, 1261 : 192 - 211
  • [30] Community detection in directed acyclic graphs
    Leo Speidel
    Taro Takaguchi
    Naoki Masuda
    The European Physical Journal B, 2015, 88