Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/132716
Title: Lower bound on general minimal resource interval scheduling with arbitrary component selection
Authors: Shen, Z.X. 
Jong, C.C.
Issue Date: 1999
Source: Shen, Z.X., Jong, C.C. (1999). Lower bound on general minimal resource interval scheduling with arbitrary component selection. Proceedings - IEEE International Symposium on Circuits and Systems 6 : VI-378. ScholarBank@NUS Repository.
Abstract: Exploring lower bound of scheduling is an important problem in high-level synthesis. In this paper, we address the problem of computing lower bound on the general minimal resource interval scheduling problem, called n-n-MRIS, in which arbitrary component selections are allowed in stead of the traditional uni-component selection. The problem of n-n-MRIS is proved to be strongly NP hard. An efficient ILP model and a surrogate relaxation technique are proposed to produce a lower bound for the n-n-MRIS problem.
Source Title: Proceedings - IEEE International Symposium on Circuits and Systems
URI: http://scholarbank.nus.edu.sg/handle/10635/132716
ISSN: 02714310
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

9
checked on Jan 14, 2018

Google ScholarTM

Check


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