High throughput pipelined data path synthesis by conserving the regularity of nested loops
Pages 450 - 453
References
[1]
N. Park and A. C. Parker, "Schwa: A Software Package for Synthesis of Pipelines from Behavioral Specifications," IEEE Trans. CAD, vol. 7, pp. 356-370, 1988.
[2]
N. Park and F. J. Kurdahi, "Module Assignment and Interconnect Sharing in Register-Transfer Synthesis of Pipelined Data Path," Proc. Int. Conf. on CAD, 1989, pp. 16-19.
[3]
P.G. Paulln, and J. P. Knight, "Force-Directed Scheduling for the Behavioral Synthesis of ASIC's," IEEE Trans. CAD, vol.8, pp. 661-679~ June 1989.
[4]
E.F. Girczyc~ "Loop Winding-A Data Flow Approach to Functional Pipelining," Proc. IEEE ISCAS, Philadephla, May 1987, pp. 382-385.
[5]
G. Goossens, J. Rabaey, J. Vandewalle, and Hugo De Man~ "An Efficient Microcode Compiler for Application Specific DSP Processors," IEEE Trans. CAD, vol.9, Sept. 1990.
[6]
R. Potasman, J. liD, Alexandru Nicolau, and Daniel Gajski, "Percolation Based Synthesis," Proc. 27th DAC, 1990
[7]
S. Note, W. Geurts, F. Catthoor, and Hugo De Man, "Cathedral-III ~ Architecture-Driven High-Level Synthesis for High Throughput DSP Applications," Proc. 28th DAC, 1991, pp. 1597-602.
[8]
K.S. Hwang, A. E. Casavant, C. T. Chang and lVl. A. d'Abreu, "Scheduling and Hardware Sharing in Pipelined Data Paths," Proc. Int. Conf. on CAD~ Nov. 1989
[9]
C.T. Hwang, Y.C. H:su, and Y.L. Lin, "Scheduling for Functional Pipelining and Loop Winding," Proc. 28th DAC~ 1991~ pp. 764-769.
[10]
B.S. Haroun, and M. I. Elmasry, "Architectural Synthesis for DSP Silicon Compilers~" IEEE Trans. CAD, vol.8, pp. 431-447~ Apr. 1989.
[11]
F. Catthoor~ and H. De Man, "Application-specific architectural methodologies for high-throughput digital signal and image processing"' I}~EE Trans. on ASSP, vol. 38, pp. 339-349, Feb. 1990.
[12]
D.A. Padua, D.J. Kuck, and D.H. Lawrie, "Highspeed multiprocessors and compilation techniques," IEEE Trans. on Comp. vol. C-29~ Sept. 1980.
[13]
J.E. Nymann, "On the Probability that k Positive Integers are l~elatively Prime," Journal of Number Theory No. 4, pp.469-473~ 1972.
[14]
C.N. Zhang, and D. Y. Y. Yun, "Multi-Dimenslonal Systolic Networks for Discrete Fourier Transformation," Proce. 11th Annual IEEE/ACM Syrup. on Comp. Archi., 1984.
[15]
F.S. Tsai, and Y. C. Hsu, "STAR: An Automatic Data Path Allocator," IEEE Trans. on CAD, vol. 11, NO. 9, pp. I053-I064, Sept. 1992.
[16]
M.M. Jamali, P. Bumrungthum, and N. Mohankrishnan~ "A Parallel Algorithm for Linear Predictive Coding," Signal Processing IV: Theories and Applications, Elsevier Science Publishers B.V., North- Holland.
[17]
F. Glover, and M. Laguna~ "Tabu Search~" Center for Applied Artificial Intelligence, University of Colorado at Boulder, Boulder, CO July. 1992.
[18]
W. Shang, J. A.B. Fortes, "Time optimal linear schedules for algorithms with uniform dependenmes,IEEE Trans. Computer, vol. 40, pp. 7"23-742~ 1991.
[19]
W.F.J. Verhaegh, P.E.R. Lippens, E.H.L. Aarts, J.H.M. Korst, J.L. van Meerbergen, A. van der Werf, "Modeling periodicity by PHIDEO stream," 6th Iut. Workshop on High Level Synthesis, Irvine~ California~ 1992, pp. 256-266.
[20]
F.H.M. Franssen, M.F.X.B. van Swaaij, F.V.M. Catthoor, and Hugo J. De Man, "Modellng piece-wlse linear and data dependent signal indexing for multidimensional signal processing, 6th Int. Workshop on High Level Synthesis~ 1992.
[21]
S.Y. Kung, VLSI Array Processors, Prentice-Hall Co., 1988.
[22]
K.K. Parhi~ and D.G. Messerschmitt~ "Static rateoptimal scheduling of iterative data-flow programs via optimal unfolding," IEEE Trans. on Comp., vol.40, Feb.~ 1991.
Recommendations
Exploiting vectorization in high level synthesis of nested irregular loops
Synthesis of DoAll loops is a key aspect of High Level Synthesis since they allow to easily exploit the potential parallelism provided by programmable devices. This type of parallelism can be implemented in several ways: by duplicating the ...
Parallelizing tightly nested loops
IPPS '91: Proceedings of the Fifth International Parallel Processing SymposiumPresents a new technique to parallelize nested loops at the statement level. It transforms sequential nested loops, either vectorizable or not, into parallel ones. Previously, the wavefront method was used to parallelize non-vectorizable nested loops. ...
Software Pipelining of Nested Loops
CC '01: Proceedings of the 10th International Conference on Compiler ConstructionSoftware pipelining is a technique to improve the performance of a loop by overlapping the execution of several iterations. The execution of a software-pipelined loop goes through three phases: prolog, kernel, and epilog. Software pipelining works best ...
Comments
Information & Contributors
Information
Published In
Sponsors
- SIGDA: ACM Special Interest Group on Design Automation
- IEEE-CS: Computer Society
Publisher
IEEE Computer Society Press
Washington, DC, United States
Publication History
Published: 07 November 1993
Check for updates
Qualifiers
- Article
Conference
ICCAD '93
Sponsor:
- SIGDA
- IEEE-CS
ICCAD '93: International Conference on Computer Aided Design
November 7 - 11, 1993
California, Santa Clara, USA
Acceptance Rates
Overall Acceptance Rate 457 of 1,762 submissions, 26%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 109Total Downloads
- Downloads (Last 12 months)7
- Downloads (Last 6 weeks)5
Reflects downloads up to 01 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in