|
EPrints@IIT Delhi >
Faculty Research Publicatons >
Electrical Engineering >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2074/2487
|
| Title: | Interval partition with bounded overlap |
| Authors: | Ravikumar, C P |
| Keywords: | register allocation
task scheduling
interval graphs
clique partition |
| Issue Date: | 1992 |
| Citation: | Computer-Aided Design, 24(8), 405-410p. |
| Abstract: | The 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. |
| URI: | http://eprint.iitd.ac.in/dspace/handle/2074/2487 |
| Appears in Collections: | Electrical Engineering
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| ravikumarint92.pdf | | 236Kb | Adobe PDF | View/Open |
|
Show full item record
All items in DSpace are protected by copyright, with all rights reserved.
|
