EPrints@IIT Delhi >
Faculty Research Publicatons  >
Electrical Engineering >

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

Full metadata record

DC FieldValueLanguage
dc.contributor.authorRavikumar, C P-
dc.identifier.citationComputer-Aided Design, 24(8), 405-410p.en
dc.description.abstractThe paper considers an optimization technique with applications to some resource-allocation problems that arise in high-level synthesis of digital systems. In an abstract sense, the optimization problem is that of the partitioning of a set of line intervals into a minimum number of subsets such that intervals assigned to a subset satisfy certain properties. It is shown that the problem can be solved optically in O(n) time, where n is the number of line intervals. Applications of the problem to memory allocation and task scheduling are discussed. Specifically, a program called is described for the allocation of variables to multiport memories. has been implemented in on a Sun/3 workstation.en
dc.format.extent241700 bytes-
dc.subjectregister allocationen
dc.subjecttask schedulingen
dc.subjectinterval graphsen
dc.subjectclique partitionen
dc.titleInterval partition with bounded overlapen
Appears in Collections:Electrical Engineering

Files in This Item:

File Description SizeFormat
ravikumarint92.pdf236.04 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