ACM Home Page
Please provide us with feedback. Feedback
Percolation based synthesis
Full text PdfPdf (733 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 27th ACM/IEEE Design Automation Conference table of contents
Orlando, Florida, United States
Pages: 444 - 449  
Year of Publication: 1991
ISBN:0-89791-363-9
Authors
Roni Potasman  Dept. of Electrical and Computer Engineering, University of California, Irvine, CA
Joseph Lis  Information and Computer Science Department, University of California, Irvine, CA
Alexandru Nicolau  Information and Computer Science Department, University of California, Irvine, CA
Daniel Gajski  Information and Computer Science Department, University of California, Irvine, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Citation Count: 32
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/123186.123333
What is a DOI?

ABSTRACT

A new approach called Percolation Based Synthesis for the scheduling phase of High Level Synthesis (HLS) is presented. We discuss some new techniques (which are implemented in our tools) for compaction of flow graphs beyond basic blocks limits, which can produce order of magnitude speed ups versus serial execution. Our algorithm applies to programs with conditional jumps, loops and multicycle pipelined operations. In order to schedule under resource constraints we start by first finding the optimal schedule (without constraints) and then add heuristics to map the optimal schedule onto the given system. We argue that starting from an optimal schedule is one of the most important factors in scheduling because it offers the user flexibility to tune the heuristics and gives him a good bound for the resource constrained schedule. This scheduling algorithm is integrated with synthesis tool which uses VHDL as input description and produces a structural netlist of generic register-transfer components and a unit based control table as output. We show that our algorithm obtains better results than previously published algorithms.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
AiNi88a
AiNi88b
 
AlKe82
J. R. Allen and K. Kennedy. P FC: A program to convert Fortran to parallel form. Technical Report MASC TR 82-6, Rice University, 1982.
EbNi89
GVDM89
 
KuWhKa85
 
LiGa88
J. Lis and D. Gajski. Synthesis from VHDL. Proc. Intl. Conf. on Computer Design (ICCD), Nov. 1988, pp. 378-381.
 
NeChMi84
Y. Neuvo, D. Chengyu and S. K. Mitra. Interpolated Finite impulse Response Filters. IEEE Trans. ASSP, Vol. ASSP-32, No. 3, June 1984.
 
Ni85
A. Nicolau. Uniform Parallelism Exploitation in Ordinary Programs. Procs. of ICPP, August 1985.
 
NPA88
A. Nicolau, K. Pingali and A. S. Aiken. Fine Grain Compilation for Pipelined Machines. Journal of Supercomputing, August 1988.
 
PaGa86
B. M. PangHe and D. D. Gajski. States Synthesis and Connectivity Binding for Microa~chitecture compilation. Proc. of ICCAD ,Nov. 1986, pp. 210-213.
 
PaKn89
P. G. Paulin and J. P. Knight. Force-Directed scheduling for the Behavioral Synthesis of ASIC's. IEEE Trans. on CAD, Vol. 8,No. 6, June 1989.
 
PaPa88
N. Park and A. C. Parker. Sehwa: A Software Package for Synthesis of Pipelines from Behavioral Specifications. IEEE Trans. on CAD, Vol. 7,No. 3, Ma~ch 1988.
 
TjFl70
G. S. Tja~ien and M. J. Fiynn. Detection and p~rallel execution of independent instructions. IEEE Trans. on Computers, Vol. 19, No. 10, October 1970.
 
Tr87
H. Tfickey. Fl~mel: A High-Level Haxdwate Compiler. IEEE Trans. on CAD, Vol. CAD-6, No. 2, March 1987.

CITED BY  32

Collaborative Colleagues:
Roni Potasman: colleagues
Joseph Lis: colleagues
Alexandru Nicolau: colleagues
Daniel Gajski: colleagues