Using speculative computation and parallelizing techniques to improve scheduling of control based designs

Authors:
Roberto Cordone;Fabrizio Ferrandi;Marco D. Santambrogio;Gianluca Palermo;Donatella Sciuto
Affiliations:
Università Statale di Milano - DTI, via Bramante, Crema, Italy;Politecnico di Milano - DEI, pza Leonardo da Vinci, Milano, Italy;Politecnico di Milano - DEI, pza Leonardo da Vinci, Milano, Italy;Politecnico di Milano - DEI, pza Leonardo da Vinci, Milano, Italy;Politecnico di Milano - DEI, pza Leonardo da Vinci, Milano, Italy
Venue:
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Year:
2006

Citing 10
Cited 2

The program dependence graph and its use in optimization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Integer and combinatorial optimization

Integer and combinatorial optimization
Global scheduling with code-motions for high-level synthesis applications

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Extracting task-level parallelism

ACM Transactions on Programming Languages and Systems (TOPLAS)
MediaBench: a tool for evaluating and synthesizing multimedia and communicatons systems

MICRO 30 Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture
A reordering technique for efficient code motion

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
MAHA: a program for datapath synthesis

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
A global resource-constrained parallelization technique

ICS '89 Proceedings of the 3rd international conference on Supercomputing
A fast algorithm for finding dominators in a flowgraph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic Extraction of Functional Parallelism from Ordinary Programs

IEEE Transactions on Parallel and Distributed Systems

The impact of loop unrolling on controller delay in high level synthesis

Proceedings of the conference on Design, automation and test in Europe
Bound-oriented parallel pruning approaches for efficient resource constrained scheduling of high-level synthesis

Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed control-data flow designs has demonstrated effective results on schedule lengths. In this paper we first analyze the use of the control and data dependence graph as an intermediate representation that provides the possibility of extracting the maximum parallelism. Then we analyze the scheduling problem by formulating an approach based on Integer Linear Programming (ILP) to minimize the number of control steps given the amount of resources. We improve the already proposed ILP scheduling approaches by introducing a new conditional resource sharing constraint which is then extended to the case of speculative computation. The ILP formulation has been solved by using a Branch and Cut framework which provides better results than standard branch and bound techniques.