RAT
Authors:
Open Access
- 1 January 2009
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Reconfigurable Technology and Systems
- Vol. 1 (4) , 1-31
Abstract
While the promise of achieving speedup and additional benefits such as high performance per watt with FPGAs continues to expand, chief among the challenges with the emerging paradigm of reconfigurable computing is the complexity in application design and implementation. Before a lengthy development effort is undertaken to map a given application to hardware, it is important that a high-level parallel algorithm crafted for that application first be analyzed relative to the target platform, so as to ascertain the likelihood of success in terms of potential speedup. This article presents the RC Amenability Test, or RAT, a methodology and model developed for this purpose, supporting rapid exploration and prediction of strategic design tradeoffs during the formulation stage of application development.Keywords
Funding Information
- Division of Engineering Education and Centers (EEC-0642422)
This publication has 24 references indexed in Scilit:
- Modeling routing demand for early-stage FPGA architecture development2008
- FASE: A Framework for Scalable Performance Prediction of HPC Systems and ApplicationsSIMULATION, 2007
- Achieving High Performance with FPGA-Based ComputingComputer, 2007
- Difficulty of predicting interconnect delay in a timing driven FPGA CAD flow2006
- Methodology for high level estimation of FPGA power consumption2005
- System-level performance evaluation of reconfigurable processorsMicroprocessors and Microsystems, 2004
- LogGP: Incorporating Long Messages into the LogP Model for Parallel ComputationJournal of Parallel and Distributed Computing, 1997
- A stochastic model to predict the routability of field-programmable gate arraysIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- LogP: towards a realistic model of parallel computation1993
- Parallelism in random access machines1978