Multi-layer task graph clustering for mapping and scheduling onto embedded systems

Research output: Contribution to journalArticle

Abstract

This work is motivated by the general trend that embedded systems design has high tolerance to longer compilation time. Based on this added flexibility in compilation, this work proposes a multilevel (multi-layer) graph partitioning framework for solving the mapping and scheduling problem for distributed heterogeneous embedded systems. However, this work concentrates on developing a multi-layer task graph clustering scheme as a part of a multi-step scheduling approach. This work introduces linear clustering techniques for vertex matching in Directed Acyclic Graphs (DAGs) that enable the construction of multi-layer coarsened DAGs with different granularity levels. This paper addresses the major obstacle facing the DAG contraction process, which is the formation of cycles, and discusses this issue for direct and chained dependence cycles. Solutions are provided that establish the basis for performing cycle testing in order to avoid the formation of cycles under certain conditions. This research shows, by analysis, that the upper-bound time complexity of the proposed cycle testing method is O(|V|3), where V is the set of task nodes. Also, this research shows, by analysis, that the complexity of the proposed multi-layer DAG coarsening scheme is O(|V|6). The simulation results verify the cost-effectiveness of the proposed scheme, and show its capabilities in generating clusters at different granularities.

Original languageEnglish
Pages (from-to)187-202
Number of pages16
JournalInternational Journal of Computers and their Applications
Volume19
Issue number3
Publication statusPublished - Sep 2012

Fingerprint

Embedded systems
Scheduling
Testing
Coarsening
Cost effectiveness
Systems analysis

Keywords

  • Distributed real-time systems
  • Embedded multiprocessor systems
  • Inter-process communication
  • Mapping and scheduling
  • Multilevel graph partitioning
  • Task clustering

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

@article{1ad764275fa245e58255f103d9f2c89b,
title = "Multi-layer task graph clustering for mapping and scheduling onto embedded systems",
abstract = "This work is motivated by the general trend that embedded systems design has high tolerance to longer compilation time. Based on this added flexibility in compilation, this work proposes a multilevel (multi-layer) graph partitioning framework for solving the mapping and scheduling problem for distributed heterogeneous embedded systems. However, this work concentrates on developing a multi-layer task graph clustering scheme as a part of a multi-step scheduling approach. This work introduces linear clustering techniques for vertex matching in Directed Acyclic Graphs (DAGs) that enable the construction of multi-layer coarsened DAGs with different granularity levels. This paper addresses the major obstacle facing the DAG contraction process, which is the formation of cycles, and discusses this issue for direct and chained dependence cycles. Solutions are provided that establish the basis for performing cycle testing in order to avoid the formation of cycles under certain conditions. This research shows, by analysis, that the upper-bound time complexity of the proposed cycle testing method is O(|V|3), where V is the set of task nodes. Also, this research shows, by analysis, that the complexity of the proposed multi-layer DAG coarsening scheme is O(|V|6). The simulation results verify the cost-effectiveness of the proposed scheme, and show its capabilities in generating clusters at different granularities.",
keywords = "Distributed real-time systems, Embedded multiprocessor systems, Inter-process communication, Mapping and scheduling, Multilevel graph partitioning, Task clustering",
author = "Arafeh, {Bassel R.}",
year = "2012",
month = "9",
language = "English",
volume = "19",
pages = "187--202",
journal = "International Journal of Computers and their Applications",
issn = "1076-5204",
publisher = "International Society for Computers and Their Applications (ISCA)",
number = "3",

}

TY - JOUR

T1 - Multi-layer task graph clustering for mapping and scheduling onto embedded systems

AU - Arafeh, Bassel R.

PY - 2012/9

Y1 - 2012/9

N2 - This work is motivated by the general trend that embedded systems design has high tolerance to longer compilation time. Based on this added flexibility in compilation, this work proposes a multilevel (multi-layer) graph partitioning framework for solving the mapping and scheduling problem for distributed heterogeneous embedded systems. However, this work concentrates on developing a multi-layer task graph clustering scheme as a part of a multi-step scheduling approach. This work introduces linear clustering techniques for vertex matching in Directed Acyclic Graphs (DAGs) that enable the construction of multi-layer coarsened DAGs with different granularity levels. This paper addresses the major obstacle facing the DAG contraction process, which is the formation of cycles, and discusses this issue for direct and chained dependence cycles. Solutions are provided that establish the basis for performing cycle testing in order to avoid the formation of cycles under certain conditions. This research shows, by analysis, that the upper-bound time complexity of the proposed cycle testing method is O(|V|3), where V is the set of task nodes. Also, this research shows, by analysis, that the complexity of the proposed multi-layer DAG coarsening scheme is O(|V|6). The simulation results verify the cost-effectiveness of the proposed scheme, and show its capabilities in generating clusters at different granularities.

AB - This work is motivated by the general trend that embedded systems design has high tolerance to longer compilation time. Based on this added flexibility in compilation, this work proposes a multilevel (multi-layer) graph partitioning framework for solving the mapping and scheduling problem for distributed heterogeneous embedded systems. However, this work concentrates on developing a multi-layer task graph clustering scheme as a part of a multi-step scheduling approach. This work introduces linear clustering techniques for vertex matching in Directed Acyclic Graphs (DAGs) that enable the construction of multi-layer coarsened DAGs with different granularity levels. This paper addresses the major obstacle facing the DAG contraction process, which is the formation of cycles, and discusses this issue for direct and chained dependence cycles. Solutions are provided that establish the basis for performing cycle testing in order to avoid the formation of cycles under certain conditions. This research shows, by analysis, that the upper-bound time complexity of the proposed cycle testing method is O(|V|3), where V is the set of task nodes. Also, this research shows, by analysis, that the complexity of the proposed multi-layer DAG coarsening scheme is O(|V|6). The simulation results verify the cost-effectiveness of the proposed scheme, and show its capabilities in generating clusters at different granularities.

KW - Distributed real-time systems

KW - Embedded multiprocessor systems

KW - Inter-process communication

KW - Mapping and scheduling

KW - Multilevel graph partitioning

KW - Task clustering

UR - http://www.scopus.com/inward/record.url?scp=84866548041&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84866548041&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84866548041

VL - 19

SP - 187

EP - 202

JO - International Journal of Computers and their Applications

JF - International Journal of Computers and their Applications

SN - 1076-5204

IS - 3

ER -