NDLI: An in-place search algorithm for the resource constrained scheduling problem during high-level synthesis

Content Provider	ACM Digital Library
Author	Yu, Cheng-Juei Wang, Sheng-De Wu, Yi-Hsin
Copyright Year	2010
Abstract	We propose an in-place search algorithm for computing the exact solutions to the resource constrained scheduling problem. This algorithm supports operation chaining, pipelining and multicycling in the underlying scheduling problem. Based on two lower-bound estimation mechanisms that are capable of predicting the criterion values of search nodes represented by partially scheduled data flow graphs, the proposed algorithm can effectively prune the nonpromising search space and finds the optimum usually several times faster than existing techniques. As opposed to existing search-based scheduling techniques whose space complexity is squared or exponential in the search depth, our approach requires only a constant storage space during the traversal of the search tree. The low space complexity is accomplished by using a combination-generating algorithm, which leads our approach to visit search nodes in such a way that each one is obtained by making only a small change to its sibling without keeping any parent nodes in memory. Experimental results on several well known benchmarks with varying resource constraints show the effectiveness of the proposed algorithm.
Starting Page	1
Ending Page	13
Page Count	13
File Format	PDF
ISSN	10844309
e-ISSN	15577309
DOI	10.1145/1835420.1835422
Volume Number	15
Issue Number	4
Journal	ACM Transactions on Design Automation of Electronic Systems (TODAES)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-10-07
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Design automation Exact scheduling High-level synthesis Optimal scheduling Resource-constrained scheduling
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Computer Science Applications Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A fast approach to computing exact solutions to the resource-constrained scheduling problem

Lower-bound performance estimation for the high-level synthesis scheduling problem

Efficient scheduling of conditional behaviors for high-level synthesis

Constraints-driven scheduling and resource assignment

Energy-efficient datapath scheduling using multiple voltages and dynamic clocking

Bitwise scheduling to balance the computational cost of behavioral specifications

Recent developments in high-level synthesis

Bridging the domains of high-level and logic synthesis

FAMOS: an efficient scheduling algorithm for high-level synthesis

An in-place search algorithm for the resource constrained scheduling problem during high-level synthesis

Similar Documents

A fast approach to computing exact solutions to the resource-constrained scheduling problem

Lower-bound performance estimation for the high-level synthesis scheduling problem

Efficient scheduling of conditional behaviors for high-level synthesis

Constraints-driven scheduling and resource assignment

Energy-efficient datapath scheduling using multiple voltages and dynamic clocking

Bitwise scheduling to balance the computational cost of behavioral specifications

Recent developments in high-level synthesis

Bridging the domains of high-level and logic synthesis

FAMOS: an efficient scheduling algorithm for high-level synthesis

An in-place search algorithm for the resource constrained scheduling problem during high-level synthesis