Iterative algorithm for hardware-software partitioning, hardware design space exploration and scheduling

Karam S. Chatha, Ranga Vemuri

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

The paper proposes a novel heuristic technique for integrated hardware-software partitioning, hardware design space exploration and scheduling. The technique maps an application specified as a task graph on a heterogeneous architecture with an objective to minimize the latency of the task graph subject to the area constraint on the hardware coprocessor. The technique uses an iterative approach where the partitioner decides the processor mapping and HW design points of some tasks. The scheduler then simultaneously decides the processor mapping, HW design point and schedule time of the remaining tasks. There exists a tight coupling between the two design stages allowing them to produce superior quality designs in fewer iterations. The technique accounts for the time overheads due to inter-processor/intra-processor communication and shared memory access conflicts. It can therefore be used for both communication intensive and computation intensive applications. The technique also considers dynamic reconfiguration capability of the hardware coprocessor. The technique performs tradeoff analysis and maps hardware tasks to mutually exclusive temporal segments if this results in lower latency. The effectiveness of the technique is demonstrated by a case study of the JPEG image compression algorithm, comparison with an optimal ILP based approach and experimentation with synthetic graphs.

Original languageEnglish (US)
Pages (from-to)281-293
Number of pages13
JournalDesign Automation for Embedded Systems
Volume5
Issue number3
StatePublished - Aug 2000
Externally publishedYes

Fingerprint

Scheduling
Hardware
Inductive logic programming (ILP)
Communication
Image compression
Data storage equipment
Coprocessor

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Hardware and Architecture
  • Software

Cite this

Iterative algorithm for hardware-software partitioning, hardware design space exploration and scheduling. / Chatha, Karam S.; Vemuri, Ranga.

In: Design Automation for Embedded Systems, Vol. 5, No. 3, 08.2000, p. 281-293.

Research output: Contribution to journalArticle

@article{a306d2b865eb4cd1b54b09a43aea11fb,
title = "Iterative algorithm for hardware-software partitioning, hardware design space exploration and scheduling",
abstract = "The paper proposes a novel heuristic technique for integrated hardware-software partitioning, hardware design space exploration and scheduling. The technique maps an application specified as a task graph on a heterogeneous architecture with an objective to minimize the latency of the task graph subject to the area constraint on the hardware coprocessor. The technique uses an iterative approach where the partitioner decides the processor mapping and HW design points of some tasks. The scheduler then simultaneously decides the processor mapping, HW design point and schedule time of the remaining tasks. There exists a tight coupling between the two design stages allowing them to produce superior quality designs in fewer iterations. The technique accounts for the time overheads due to inter-processor/intra-processor communication and shared memory access conflicts. It can therefore be used for both communication intensive and computation intensive applications. The technique also considers dynamic reconfiguration capability of the hardware coprocessor. The technique performs tradeoff analysis and maps hardware tasks to mutually exclusive temporal segments if this results in lower latency. The effectiveness of the technique is demonstrated by a case study of the JPEG image compression algorithm, comparison with an optimal ILP based approach and experimentation with synthetic graphs.",
author = "Chatha, {Karam S.} and Ranga Vemuri",
year = "2000",
month = "8",
language = "English (US)",
volume = "5",
pages = "281--293",
journal = "Design Automation for Embedded Systems",
issn = "0929-5585",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - Iterative algorithm for hardware-software partitioning, hardware design space exploration and scheduling

AU - Chatha, Karam S.

AU - Vemuri, Ranga

PY - 2000/8

Y1 - 2000/8

N2 - The paper proposes a novel heuristic technique for integrated hardware-software partitioning, hardware design space exploration and scheduling. The technique maps an application specified as a task graph on a heterogeneous architecture with an objective to minimize the latency of the task graph subject to the area constraint on the hardware coprocessor. The technique uses an iterative approach where the partitioner decides the processor mapping and HW design points of some tasks. The scheduler then simultaneously decides the processor mapping, HW design point and schedule time of the remaining tasks. There exists a tight coupling between the two design stages allowing them to produce superior quality designs in fewer iterations. The technique accounts for the time overheads due to inter-processor/intra-processor communication and shared memory access conflicts. It can therefore be used for both communication intensive and computation intensive applications. The technique also considers dynamic reconfiguration capability of the hardware coprocessor. The technique performs tradeoff analysis and maps hardware tasks to mutually exclusive temporal segments if this results in lower latency. The effectiveness of the technique is demonstrated by a case study of the JPEG image compression algorithm, comparison with an optimal ILP based approach and experimentation with synthetic graphs.

AB - The paper proposes a novel heuristic technique for integrated hardware-software partitioning, hardware design space exploration and scheduling. The technique maps an application specified as a task graph on a heterogeneous architecture with an objective to minimize the latency of the task graph subject to the area constraint on the hardware coprocessor. The technique uses an iterative approach where the partitioner decides the processor mapping and HW design points of some tasks. The scheduler then simultaneously decides the processor mapping, HW design point and schedule time of the remaining tasks. There exists a tight coupling between the two design stages allowing them to produce superior quality designs in fewer iterations. The technique accounts for the time overheads due to inter-processor/intra-processor communication and shared memory access conflicts. It can therefore be used for both communication intensive and computation intensive applications. The technique also considers dynamic reconfiguration capability of the hardware coprocessor. The technique performs tradeoff analysis and maps hardware tasks to mutually exclusive temporal segments if this results in lower latency. The effectiveness of the technique is demonstrated by a case study of the JPEG image compression algorithm, comparison with an optimal ILP based approach and experimentation with synthetic graphs.

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

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

M3 - Article

AN - SCOPUS:0034248162

VL - 5

SP - 281

EP - 293

JO - Design Automation for Embedded Systems

JF - Design Automation for Embedded Systems

SN - 0929-5585

IS - 3

ER -