EPrints@IIT Delhi >
Faculty Research Publicatons  >
Computer Science and Engineering >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/1985

Full metadata record

DC FieldValueLanguage
dc.contributor.authorShrivastava, A-
dc.contributor.authorH Kumar-
dc.contributor.authorKapoor, S-
dc.contributor.authorS Kumar-
dc.contributor.authorBalakrishnan, M-
dc.identifier.citationVLSI Design, Thirteenth International Conference on, 110 - 113p.en
dc.description.abstractAn important aspect of hardware-software co-design is partitioning of tasks to be scheduled on the hardware and software resources. Existing approaches separate partitioning and scheduling in two steps. Since partitioning solutions affect scheduling results and vice versa, the existing sequential approaches may lead to sub-optimal results. In this paper, we present an integrated hardware/software scheduling, partitioning and binding strategy. We use dynamic programming techiques to devise an optimal solution for partitioning of a given concurrent task graph which models the co-design problem, for execution on one software (single CPU) and several hardware resources (multiple FPGAs), with the objective of minimizing the total execution time. Our implementation shows that we can solve problem instances where the task graph has 40 nodes and 600 edges in less than a seconden
dc.format.extent42841 bytes-
dc.subjectvice versaen
dc.subjectconcurrent task graphen
dc.titleOptimal hardware/software partitioning for concurrent specification using dynamic programmingen
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
shrivastavaopt2000.pdf41.84 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback