NDLI: A code-motion pruning technique for global scheduling

Content Provider	ACM Digital Library
Author	Dos santos, Luiz C. V. Jess, J. A. G. Van eijnhoven, J. Van eijk, C. A. J. Heijligers, M. J. M.
Copyright Year	2000
Abstract	In the high-level synthesis of ASICs or in the code generation for ASIPs, the presence of conditionals in the behavioral description represents an obstacle to exploit parallelism. Most existing methods use greedy choices in such a way that the search space is limited by the applied heuristics. For example, they might miss opportunities to optimize across basic block boundaries when treating conditional execution. We propose a constructive method which allows generalized code motions. Scheduling and code motion are encoded in the form of a unified resource-constrained optimization problem. In our approach many alternative solutions are constructed and explored by a search algorithm, while optimal solutions are kept in the search space. Our method can cope with issues like speculative execution and code such duplication. Moreover, it can tackle constraints imposed by the advance choice of a controller, such as pipelined-control delay and limited branch capabilities. The underlying timing models support chaining and multicycling. As tasking code motion into account may lead to a larger search space, a code-motion pruning technique is presented. This pruning is proven to keep optimal solutions in the search space for cost functions in terms of schedule lengths.
Starting Page	1
Ending Page	38
Page Count	38
File Format	PDF
ISSN	10844309
e-ISSN	15577309
DOI	10.1145/329458.329461
Volume Number	5
Issue Number	1
Journal	ACM Transactions on Design Automation of Electronic Systems (TODAES)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2000-01-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Code generation Code motion Global scheduling High-level synthesis Speculative execution
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

Incorporating speculative execution into scheduling of control-flow-intensive designs

Efficient scheduling of conditional behaviors for high-level synthesis

Code generation for fixed-point DSPs

A Code-Motion Pruning Technique for Global Scheduling (2000)

Constraints-driven scheduling and resource assignment

Estimation of lower bounds in scheduling algorithms for high-level synthesis

A Distributed Controller for Managing Speculative Functional Units in High Level Synthesis

A scheduling algorithm for optimization and early planning in high-level synthesis

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

A code-motion pruning technique for global scheduling

Similar Documents

Incorporating speculative execution into scheduling of control-flow-intensive designs

Efficient scheduling of conditional behaviors for high-level synthesis

Code generation for fixed-point DSPs

A Code-Motion Pruning Technique for Global Scheduling (2000)

Constraints-driven scheduling and resource assignment

Estimation of lower bounds in scheduling algorithms for high-level synthesis

A Distributed Controller for Managing Speculative Functional Units in High Level Synthesis

A scheduling algorithm for optimization and early planning in high-level synthesis

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

A code-motion pruning technique for global scheduling