skip to main content
10.1145/1046192.1046263acmconferencesArticle/Chapter ViewAbstractPublication PagesfpgaConference Proceedingsconference-collections
Article

Reconfigurable computers: an empirical analysis (abstract only)

Published: 20 February 2005 Publication History

Abstract

Reconfigurable Computers are parallel systems that are designed around multiple general-purpose processors and multiple field programmable gate array (FPGA) chips. These systems can leverage the synergism between conventional processors and FPGAs to provide low-level hardware functionality at the same level of programmability as general-purpose computers. In this work we conduct an experimental study using one of the state-of-the-art reconfigurable computers and a representative set of applications to assess the field, uncover the challenges, propose solutions, and conceive a realistic evolution path. We consider issues of concern including performance/cost. We also consider productivity in the sense of development, compiling, running, and system reliability. It will be shown that for some applications, the performance/cost can be orders of magnitude better than conventional computers. It will be also shown that programming such machines may still require some hardware knowledge, similar to hardware knowledge computer programmers must acquire to write scalable programs.

Cited By

View all
  • (2007)Scalable and Modular Algorithms for Floating-Point Matrix Multiplication on Reconfigurable Computing SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2007.100118:4(433-448)Online publication date: 1-Apr-2007

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
FPGA '05: Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays
February 2005
288 pages
ISBN:1595930299
DOI:10.1145/1046192
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 February 2005

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

FPGA05
Sponsor:

Acceptance Rates

Overall Acceptance Rate 125 of 627 submissions, 20%

Upcoming Conference

FPGA '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2007)Scalable and Modular Algorithms for Floating-Point Matrix Multiplication on Reconfigurable Computing SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2007.100118:4(433-448)Online publication date: 1-Apr-2007

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media