DocumentCode
2786613
Title
Pre-synthesis Queue Size Estimation of Streaming Data Flow Graphs
Author
Mondal, S. ; Memik, S.O. ; Bellas, N.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL
fYear
2006
fDate
24-26 April 2006
Firstpage
325
Lastpage
326
Abstract
In this paper the authors propose a pre-synthesis register queue size estimation technique for an unscheduled streaming DFG (sDFG) for pipelined synthesis. Our estimation method first designates a minimum queue size to each communication edge of the sDFG based on the ALAP value of the source node and ASAP value of the sink node of that edge. Our aim is to further refine this initial minimum queue size estimation. Our main tool is based on the likelihood estimation that the source node may actually be producing data before its ALAP time, and likewise, the sink node may actually be consuming data after its ASAP time
Keywords
data flow graphs; maximum likelihood estimation; pipeline processing; queueing theory; ALAP value; likelihood estimation; pipelined synthesis; presynthesis register queue size estimation; unscheduled streaming DFG; Computer architecture; Costs; Fabrics; Flow graphs; Hardware; Job shop scheduling; Reconfigurable logic; Registers; Streaming media; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Field-Programmable Custom Computing Machines, 2006. FCCM '06. 14th Annual IEEE Symposium on
Conference_Location
Napa, CA
Print_ISBN
0-7695-2661-6
Type
conf
DOI
10.1109/FCCM.2006.59
Filename
4020942
Link To Document