Skip to main content

RaPiD — Reconfigurable pipelined datapath

  • High-Level Design II
  • Conference paper
  • First Online:
Field-Programmable Logic Smart Applications, New Paradigms and Compilers (FPL 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1142))

Included in the following conference series:

Abstract

Configurable computing has captured the imagination of many architects who want the performance of application-specific hardware combined with the reprogrammability of general-purpose computers. Unfortunately, onfigurable computing has had rather limited success largely because the FPGAs on which they are built are more suited to implementing »ndom logic than computing tasks. This paper presents RaPiD, a new coarse-grained FPGA architecture that is optimized for highly repetitive, computation-intensive tasks. Very deep application-specific computation pipelines can be configured in RaPiD. These pipelines make much more efficient use of silicon than traditional FPGAs and also yield much higher performance for a wide range of applications.

This work was supported in part by the Defense Advanced Research Projects Agency under Contract DAAH04-94-G0272. D. Cronquist was supported in part by an IBM fellowship. P. Franklin was supported by an NSF fellowship.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. M. Arnold, D. A. Buell, D. T. Hoang, D. V. Pryor, N. Shirazi, and M. R. Thistle. The Splash 2 processor and applications. In Proceedings IEEE International Conference on Computer Design: VLSI in Computers and Processors, pages 482–5. IEEE Comput. Soc. Press, 1993.

    Google Scholar 

  2. H.T. Kung. Let's design algorithms for VLSI systems. Technical Report CMU-CS-79-151, Carnegie-Mellon University, January 1979.

    Google Scholar 

  3. P. Lee and Z. M. Kedem. Synthesizing linear array algorithms from nested FOR loop algorithms. IEEE Transactions on Computers, 37(12):1578–98, 1988.

    Google Scholar 

  4. D. I. Moldovan and J. A. B. Fortes. Partitioning and mapping algorithms into fixed size systolic arrays. IEEE Transactions on Computers, C-35(1):1–12, 1986.

    Google Scholar 

  5. J. E. Vuillemin, P. Bertin, D. Roncin, M. Shand, H. H. Touati, and P. Boucard. Programmable active memories: reconfigurable systems come of age. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 4(1):56–69, 1996.

    Google Scholar 

  6. M. Wazlowski, L. Agarwal, T. Lee, A. Smith, E. Lam, P. Athanas, H. Silverman, and S. Ghosh. PRISM-II compiler and architecture. In Proceedings IEEE Workshop on FPGAs for Custom Computing Machines, pages 9–16. IEEE Comput. Soc. Press, 1993.

    Google Scholar 

  7. M. E. Wolf and M. S. Lam. A loop transformation theory and an algorithm to maximize parallelism. IEEE Transactions on Parallel and Distributed Systems, 2(4):452–471, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Reiner W. Hartenstein Manfred Glesner

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ebeling, C., Cronquist, D.C., Franklin, P. (1996). RaPiD — Reconfigurable pipelined datapath. In: Hartenstein, R.W., Glesner, M. (eds) Field-Programmable Logic Smart Applications, New Paradigms and Compilers. FPL 1996. Lecture Notes in Computer Science, vol 1142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61730-2_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-61730-2_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61730-3

  • Online ISBN: 978-3-540-70670-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics