DocumentCode
2790480
Title
Pipelining Tradeoffs of Massively Parallel SuperCISC Hardware Functions
Author
Ihrig, Colin J. ; Stander, Justin ; Jones, Alex K.
Author_Institution
Dept. of Electr. & Comput. Eng., Pittsburgh Univ., PA
fYear
2007
fDate
26-30 March 2007
Firstpage
1
Lastpage
8
Abstract
Parallel processing using multiple processors is a well-established technique to accelerate many different classes of applications. However, as the density of chips increases, another technique to accelerate these applications is the use of application specific hardware processing blocks in parallel within a chip. SuperCISC hardware blocks utilize this method to accelerate scientific, signal, and image processing applications. By applying pipelining methodologies to SuperCISC functions, the effective amount of parallelism already present can be further increased. Automated register placement within a combinational dataflow graph (DFG) is governed by the desired maximum operating frequency provided as a parameter to the tool flow, as well as the results of static timing analysis of the circuit. Results presented include the design tradeoffs between increased performance, area, and energy. Additionally, benefits of pipelining compared to hardware replication as a means of achieving further parallelism is studied.
Keywords
data flow graphs; parallel processing; pipeline processing; automated register placement; combinational dataflow graph; multiple processors; parallel SuperCISC hardware function; parallel processing; pipeline processing; static timing circuit analysis; Acceleration; Circuit analysis; Frequency; Hardware; Image processing; Parallel processing; Pipeline processing; Registers; Signal processing; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International
Conference_Location
Long Beach, CA
Print_ISBN
1-4244-0910-1
Electronic_ISBN
1-4244-0910-1
Type
conf
DOI
10.1109/IPDPS.2007.370468
Filename
4228196
Link To Document