Skip to main content

Supercomputing with reconfigurable architectures

  • Embedded Systems and Other Applications
  • Conference paper
  • First Online:
Field-Programmable Logic and Applications (FPL 1995)

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

Included in the following conference series:

Abstract

Recently, several research and commercial systems based on reconfigurable logic have been implemented. These machines have demonstrated supercomputer levels of performance for a number of algorithms. While these demonstrations have been impressive, it is not clear that architectures based on reconfigurable logic will necessarily be suitable for algorithms commonly executed on supercomputers. This paper discusses the implementation of Livermore Fortran Kernels for a supercomputer class machine based on reconfigurable logic.

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. Barry Fagin and Cyril Renard. Field programmable gate arrays and floating point arithmetic. IEEE Transactions on Very Large Scale Integrated (VLSI) Systems, 2(3):365–367, September 1994.

    Google Scholar 

  2. John T. Feo. An analysis of the computational and parallel complexity of the livermore loops. Parallel Computing, 7(2):163–185, June 1988.

    Google Scholar 

  3. Martin Fouts. The Livermore Loops in C. NASA Ames Research Center memo, 1994.

    Google Scholar 

  4. Daniel D. Gajski. An algorithm for solving linear recurrence systems on parallel and pipelined machines. IEEE Transactions on Computers, C-30:190–206, March 1981.

    Google Scholar 

  5. Steven A. Guccione. List of FPGA-based computing machines. World Wide Web page http://www.utexas.edu/∼ guccione/HW_list.html, 1994.

    Google Scholar 

  6. Steven A. Guccione and Mario J. Gonzalez. A data-parallel programming model for reconfigurable architectures. In Duncan A. Buell and Kenneth L. Pocek, editors, IEEE Workshop on FPGAs for Custom Computing Machines, pages 79–87, Los Alamitos, CA, April 1993. IEEE Computer Society Press.

    Google Scholar 

  7. Peter M. Kogge. Parallel solution of recurrence problems. IBM Journal of Research and Development, 18(2):138–148, March 1974.

    Google Scholar 

  8. Peter M. Kogge and Harold S. Stone. A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Transactions on Computers, C-22(8):786–793, August 1973.

    Google Scholar 

  9. Frank H. McMahon. The Livermore Fortran kernels: A computer test of the numerical performance range. Technical Report UCRL-53745, Lawrence Livermore National Laboratory, December 1986.

    Google Scholar 

  10. Wayne Pfeiffer, Arnold Alagar, Anke Kamrath, Robert H. Leary, and Jack Rogers. Benchmarking and optimization of scientific codes on the CRAY X-MP, CRAY-2 and SCS-40 vector computers. The Journal of Supercomputing, 4(2):131–152, June 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Will Moore Wayne Luk

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guccione, S.A., Gonzalez, M.J. (1995). Supercomputing with reconfigurable architectures. In: Moore, W., Luk, W. (eds) Field-Programmable Logic and Applications. FPL 1995. Lecture Notes in Computer Science, vol 975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60294-1_133

Download citation

  • DOI: https://doi.org/10.1007/3-540-60294-1_133

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60294-1

  • Online ISBN: 978-3-540-44786-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics