๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the 18th annual ACM/SIGDA international symposium - Monterey, California, USA (2010.02.21-2010.02.23)] Proceedings of the 18th annual ACM/SIGDA international symposium on Field programmable gate arrays - FPGA '10 - FPMR

โœ Scribed by Shan, Yi; Wang, Bo; Yan, Jing; Wang, Yu; Xu, Ningyi; Yang, Huazhong


Book ID
126454344
Publisher
ACM Press
Year
2010
Tongue
English
Weight
903 KB
Category
Article
ISBN
160558911X

No coin nor oath required. For personal study only.

โœฆ Synopsis


Machine learning and data mining are gaining increasing attentions of the computing society. FPGA provides a highly parallel, low power, and flexible hardware platform for this domain, while the difficulty of programming FPGA greatly limits its prevalence. MapReduce is a parallel programming framework that could easily utilize inherent parallelism in algorithms. In this paper, we describe FPMR, a MapReduce framework on FPGA, which provides programming abstraction, hardware architecture, and basic building blocks to developers.

An on-chip processor scheduler is implemented to maximize the utilization of computation resources and achieve better load balancing. An efficient data access scheme is carefully designed to maximize data reuse and throughput. Meanwhile, the FPMR framework hides the task control, synchronization, and communication away from designers so that more attention can be paid to the application itself. A case study of RankBoost acceleration based on FPMR demonstrates that FPMR efficiently helps with the development productivity; and the speedup is 31.8x versus CPU-based implementation. This performance is comparable to a fully manually designed version, which achieves 33.5x speedup. Two other applications: SVM, PageRank are also discussed to show the generalization of the framework.


๐Ÿ“œ SIMILAR VOLUMES


[ACM Press the 2007 ACM/SIGDA 15th inter
โœ Lamoureux, Julien; Lemieux, Guy G.; Wilton, Steven J. E. ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› ACM Press ๐ŸŒ English โš– 433 KB

This paper describes a technique that reduces dynamic power in FPGAs by reducing the number of glitches in the global routing resources. The technique involves adding programmable delay elements within the logic blocks of an FPGA to programmably align the arrival times of early-arriving signals to t