NDLI: Scheduling independent liveness analysis for register binding in high level synthesis

Content Provider	IEEE Xplore Digital Library
Author	Castellana, Vito Giovanni Ferrandi, Fabrizio
Copyright Year	2013
Description	Author affiliation: Politecnico di Milano - Dipartimento di Elettronica ed Informazione, Via Ponzio 34/5, 20133, Milan, Italy (Castellana, Vito Giovanni; Ferrandi, Fabrizio)
Abstract	Classical techniques for register allocation and binding require the definition of the program execution order, since a partial ordering relation between operations must be induced to perform liveness analysis through data-flow equations. In High Level Synthesis (HLS) flows this is commonly obtained through the scheduling task. However for some HLS approaches, such a relation can be difficult to be computed, or not statically computable at all, and adopting conventional register binding techniques, even when feasible, cannot guarantee maximum performances. To overcome these issues we introduce a novel scheduling-independent liveness analysis methodology, suitable for dynamic scheduling architectures. Such liveness analysis is exploited in register binding using standard graph coloring techniques, and unlike other approaches it avoids the insertion of structural dependencies, introduced to prevent run-time resource conflicts in dynamic scheduling environments. The absence of additional dependencies avoids performance degradation and makes parallelism exploitation independent from the register binding task, while on average not impacting on area, as shown through the experimental results.
Starting Page	1571
Ending Page	1574
File Size	494866
Page Count	4
File Format	PDF
ISBN	9781467350716
ISSN	15301591
e-ISBN	9783981537000
DOI	10.7873/DATE.2013.319
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-03-18
Publisher Place	France
Access Restriction	Subscribed
Rights Holder	European Design Automation Association (EDAA)
Subject Keyword	Registers Equations Resource management Dynamic scheduling Schedules Reactive power Standards
Content Type	Text
Resource Type	Article

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

Scheduling independent liveness analysis for register binding in high level synthesis

Register pressure aware scheduling for high level synthesis

Minimal Set of Essential Resource Disjoint Pairs for Exploring Feasible 3D Schedules

Scheduling Register-Allocated Codes in User-Guided High-Level Synthesis

Register binding for predicated execution in DSP applications

Register binding and domain assignment for multi-domain clock skew scheduling-aware high-level synthesis

Low power register allocation algorithm using graph coloring

Minimizing Schedule Length via Cooperative Register Allocation and Loop Scheduling for Embedded Systems

Integrated scheduling and register allocation for multicore architecture

Scheduling independent liveness analysis for register binding in high level synthesis

Similar Documents

Scheduling independent liveness analysis for register binding in high level synthesis

Register pressure aware scheduling for high level synthesis

Minimal Set of Essential Resource Disjoint Pairs for Exploring Feasible 3D Schedules

Scheduling Register-Allocated Codes in User-Guided High-Level Synthesis

Register binding for predicated execution in DSP applications

Register binding and domain assignment for multi-domain clock skew scheduling-aware high-level synthesis

Low power register allocation algorithm using graph coloring

Minimizing Schedule Length via Cooperative Register Allocation and Loop Scheduling for Embedded Systems

Integrated scheduling and register allocation for multicore architecture

Scheduling independent liveness analysis for register binding in high level synthesis