Iterative algorithm for partitioning and scheduling of area constrained HW-SW systems

Karam S. Chatha, Ranga Vemuri

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Citations (Scopus)

Abstract

This paper presents a technique for integrated partitioning and scheduling of hardware-software systems. The tool takes a task graph and area constraint as input and obtains a mapping and schedule such that the execution time is minimized. The algorithm differs from other approaches which either obtain the mapping during the partitioning stage or the scheduling stage. We use an iterative approach where the partitioner assigns the mapping of only some of the tasks and the remaining tasks are assigned by the scheduler with an objective of minimizing the execution time. The technique takes both the time and area overheads due to inter-processor and intra-processor communication into output. The effectiveness of the approach is demonstrated by the experimental results.

Original languageEnglish (US)
Title of host publicationProceedings of the International Workshop on Rapid System Prototyping
PublisherIEEE
Pages134-139
Number of pages6
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 10th IEEE International Workshop on Rapid System Prototyping (RSP'99) - Clearwater, FL, USA
Duration: Jun 16 1999Jun 18 1999

Other

OtherProceedings of the 1999 10th IEEE International Workshop on Rapid System Prototyping (RSP'99)
CityClearwater, FL, USA
Period6/16/996/18/99

Fingerprint

Scheduling
Hardware
Communication

ASJC Scopus subject areas

  • Software
  • Safety, Risk, Reliability and Quality

Cite this

Chatha, K. S., & Vemuri, R. (1999). Iterative algorithm for partitioning and scheduling of area constrained HW-SW systems. In Proceedings of the International Workshop on Rapid System Prototyping (pp. 134-139). IEEE.

Iterative algorithm for partitioning and scheduling of area constrained HW-SW systems. / Chatha, Karam S.; Vemuri, Ranga.

Proceedings of the International Workshop on Rapid System Prototyping. IEEE, 1999. p. 134-139.

Research output: Chapter in Book/Report/Conference proceedingChapter

Chatha, KS & Vemuri, R 1999, Iterative algorithm for partitioning and scheduling of area constrained HW-SW systems. in Proceedings of the International Workshop on Rapid System Prototyping. IEEE, pp. 134-139, Proceedings of the 1999 10th IEEE International Workshop on Rapid System Prototyping (RSP'99), Clearwater, FL, USA, 6/16/99.
Chatha KS, Vemuri R. Iterative algorithm for partitioning and scheduling of area constrained HW-SW systems. In Proceedings of the International Workshop on Rapid System Prototyping. IEEE. 1999. p. 134-139
Chatha, Karam S. ; Vemuri, Ranga. / Iterative algorithm for partitioning and scheduling of area constrained HW-SW systems. Proceedings of the International Workshop on Rapid System Prototyping. IEEE, 1999. pp. 134-139
@inbook{1010555eb4014c8ea3ff7bf04629f2f6,
title = "Iterative algorithm for partitioning and scheduling of area constrained HW-SW systems",
abstract = "This paper presents a technique for integrated partitioning and scheduling of hardware-software systems. The tool takes a task graph and area constraint as input and obtains a mapping and schedule such that the execution time is minimized. The algorithm differs from other approaches which either obtain the mapping during the partitioning stage or the scheduling stage. We use an iterative approach where the partitioner assigns the mapping of only some of the tasks and the remaining tasks are assigned by the scheduler with an objective of minimizing the execution time. The technique takes both the time and area overheads due to inter-processor and intra-processor communication into output. The effectiveness of the approach is demonstrated by the experimental results.",
author = "Chatha, {Karam S.} and Ranga Vemuri",
year = "1999",
language = "English (US)",
pages = "134--139",
booktitle = "Proceedings of the International Workshop on Rapid System Prototyping",
publisher = "IEEE",

}

TY - CHAP

T1 - Iterative algorithm for partitioning and scheduling of area constrained HW-SW systems

AU - Chatha, Karam S.

AU - Vemuri, Ranga

PY - 1999

Y1 - 1999

N2 - This paper presents a technique for integrated partitioning and scheduling of hardware-software systems. The tool takes a task graph and area constraint as input and obtains a mapping and schedule such that the execution time is minimized. The algorithm differs from other approaches which either obtain the mapping during the partitioning stage or the scheduling stage. We use an iterative approach where the partitioner assigns the mapping of only some of the tasks and the remaining tasks are assigned by the scheduler with an objective of minimizing the execution time. The technique takes both the time and area overheads due to inter-processor and intra-processor communication into output. The effectiveness of the approach is demonstrated by the experimental results.

AB - This paper presents a technique for integrated partitioning and scheduling of hardware-software systems. The tool takes a task graph and area constraint as input and obtains a mapping and schedule such that the execution time is minimized. The algorithm differs from other approaches which either obtain the mapping during the partitioning stage or the scheduling stage. We use an iterative approach where the partitioner assigns the mapping of only some of the tasks and the remaining tasks are assigned by the scheduler with an objective of minimizing the execution time. The technique takes both the time and area overheads due to inter-processor and intra-processor communication into output. The effectiveness of the approach is demonstrated by the experimental results.

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

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

M3 - Chapter

AN - SCOPUS:0032593099

SP - 134

EP - 139

BT - Proceedings of the International Workshop on Rapid System Prototyping

PB - IEEE

ER -