Skip Navigation



The Computer Journal Advance Access published online on April 8, 2009

The Computer Journal, doi:10.1093/comjnl/bxp020
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Liu, Q.
Right arrow Articles by Cheung, P. Y.K.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Compiling C-like Languages to FPGA Hardware: Some Novel Approaches Targeting Data Memory Organization1

Qiang Liu1,*, George A. Constantinides1, Konstantinos Masselos2 and Peter Y.K. Cheung1

1 Department of Electrical and Electronic Engineering, Imperial College London, South Kensington Campus, London SW7 2AZ, UK
2 Department of Computer Science and Technology, University of Peloponnese, Tripolis, Greece

* Corresponding author: qiang.liu2{at}imperial.ac.uk

Received 14 October 2008; revised 5 March 2009

This paper describes our approaches to raise the level of abstraction at which hardware suitable for accelerating computationally intensive applications can be specified. Field-programmable gate arrays are becoming adopted as a computational platform by the high-performance computing community, but there are challenges to extract maximum performance from these devices. Unlike other approaches, our focus is on data memory organization and input–output bandwidth considerations, which are the typical stumbling block of existing hardware compilation schemes. We describe our approaches, which are based on formal optimization techniques, and present some results showing the advantage of exposing the interaction between data memory system design and parallelism extraction to the compiler.

Key Words: hardware compilation • data reuse • loop parallelization • FPGA


Handling editor: Erol Gelende

1 A preliminary version of this paper was presented at the BCS08Visions of Computer Science Conference, held on 22–24 September 2008.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.