Bangtian Liu, H. Fu, L. Gan, Wenlai Zhao, Guangwen Yang
{"title":"Optimizing Residue Number Reverse Converters through Bitwise Arithmetic on FPGAs","authors":"Bangtian Liu, H. Fu, L. Gan, Wenlai Zhao, Guangwen Yang","doi":"10.1109/FCCM.2015.38","DOIUrl":"https://doi.org/10.1109/FCCM.2015.38","url":null,"abstract":"As a promising number representation method to provide inspiring operational performance, the Residue Number System (RNS) has been widely applied in many key applications for data pocessing. However, a highly-efficient and general-purpose reverse converter, which is the key component in an RNS system, is still less to be seen, due to the costly and complex operators that require large amounts of computing resources and a long latency to accomplish. In this paper, we are targeting at reverse converters that are highly efficient and can support general moduli sets. We first propose optimizing methods based on the bit wise arithmetic to improve the performance of general reverse converters such as CRT and New CRT. The methods are capable of replacing expensive operations such as additions and multiplications with bit wise operations. We also optimize the performance of specific reverse converter through condition reduction and pre-calculation methods. Furthermore, we develop a user controlled FPGA design generator that can produce optimized reverse converter designs for a number of different moduli sets. Compared with the existing optimized converter designs, our proposed methods can further reduce the latency and resource consumption by 54.2% to 84.6% and 65% to 88.5% respectively.","PeriodicalId":356953,"journal":{"name":"2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134328502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Zedwulf: Power-Performance Tradeoffs of a 32-Node Zynq SoC Cluster","authors":"P. Moorthy, Nachiket Kapre","doi":"10.1109/FCCM.2015.37","DOIUrl":"https://doi.org/10.1109/FCCM.2015.37","url":null,"abstract":"Commodity SoCs with hybrid architectures that combine CPUs with programmable FPGA fabric such as the Xilinx Zynq SoC have become a competitive energy-efficient platform for addressing irregular parallelism in graph problems. In this paper, we prototype a 32-node cluster composed from these Zynq SoC chips to accelerate communication-bound sparse graph-oriented applications such as neural network simulations. We develop specialized MPI routines specifically developed for irregular accelerator-to-accelerator communication of small message traffic. We use the ARM processor for handling the MPI stack while offloading compute-intensive calculations to the FPGA. For graphs with 32M nodes and 32M edges, Zedwulf delivers the highest 94 MTEPS (Million Traversed Edges Per Second)throughput over other x86 multi-threaded platforms in our study by 1.2 -- 1.4×. For this experiment, Zedwulf operates at an efficiency of 0.49 MTEPS/W when using ARM+FPGA which is1.2× better than using ARMv7 CPUs alone, and within 8% of the Intel Core i7-4770k platform.","PeriodicalId":356953,"journal":{"name":"2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines","volume":"251 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133638701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Novel High-Throughput Acceleration Engine for Read Alignment","authors":"Yu-Ting Chen, J. Cong, Jie Lei, Peng Wei","doi":"10.1109/FCCM.2015.27","DOIUrl":"https://doi.org/10.1109/FCCM.2015.27","url":null,"abstract":"The Smith-Waterman (S-W) algorithm is widely adopted by the state-of-the-art DNA sequence aligners. Existing wave front-based methods ignored the fact that the S-W algorithm is fed with significantly varied-size inputs in modern aligners, in which the S-W algorithm is further optimized by exerting extensive pruning. In this paper, we propose an architecture, tailored for varied input sizes as well as harnessing software pruning strategies, to accelerate S-W. Our implementation demonstrates a 26.4x speedup over a 24-thread Intel Has well Xeon server, and outperforms wave front-based implementations by up to 6x with the same FPGA resource.","PeriodicalId":356953,"journal":{"name":"2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131356156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient Overlay Architecture Based on DSP Blocks","authors":"A. Jain, Suhaib A. Fahmy, D. Maskell","doi":"10.1109/FCCM.2015.15","DOIUrl":"https://doi.org/10.1109/FCCM.2015.15","url":null,"abstract":"Design productivity and long compilation times are major issues preventing the mainstream adoption of FPGAs in general purpose computing. Several overlay architectures have emerged to tackle these challenges, but at the cost of increased area and performance overheads. This paper examines a coarse grained overlay architecture designed using the flexible DSP48E1 primitive on Xilinx FPGAs. This allows pipelined execution at significantly higher throughput without adding significant area overheads to the PE. We map several benchmarks, using our custom mapping tool, and show that the proposed overlay architecture delivers a throughput of up to 21.6 GOPS and provides an 11 -- 52% improvement in throughput compared to Vivado HLS implementations.","PeriodicalId":356953,"journal":{"name":"2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127587381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
X. Iturbe, D. Keymeulen, P. Yiu, D. Berisford, K. Hand, R. Carlson, Emre Ozer
{"title":"A Highly-Efficient, Adaptive and Fault-Tolerant SoC Implementation of a Fourier Transform Spectrometer Data Processing","authors":"X. Iturbe, D. Keymeulen, P. Yiu, D. Berisford, K. Hand, R. Carlson, Emre Ozer","doi":"10.1109/FCCM.2015.26","DOIUrl":"https://doi.org/10.1109/FCCM.2015.26","url":null,"abstract":"We present here one of the first research efforts conducted at Jet Propulsion Laboratory (JPL) to implement on a single chip (Xilinx Zynq) all the functionality necessary to control a NASA instrument, namely a Fourier Transform Spectrometer (FTS) that is proposed for deployment on future missions to Jupiter's moon Europa. The system requires custom logic to process the data delivered by the instrument, and software, to perform floating-point operations and to drive the interface with the main spacecraft computer. Three features are central in our SoC FTS implementation: (1) Efficiency, as the system achieves a high data processing throughput at relatively low power consumption, (2) Adaptivity, as the system can be configured from Earth based on the data observed while exploring a priori unknown space environments and (3) Fault-Tolerance, as the system needs to operate in the harsh radiation Jupiter magnetosphere where Europa orbits.","PeriodicalId":356953,"journal":{"name":"2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127627926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
F. P. Russell, P. Düben, Xinyu Niu, W. Luk, T. Palmer
{"title":"Architectures and Precision Analysis for Modelling Atmospheric Variables with Chaotic Behaviour","authors":"F. P. Russell, P. Düben, Xinyu Niu, W. Luk, T. Palmer","doi":"10.1109/FCCM.2015.52","DOIUrl":"https://doi.org/10.1109/FCCM.2015.52","url":null,"abstract":"The computationally intensive nature of atmospheric modelling is an ideal target for hardware acceleration. Performance of hardware designs can be improved through the use of reduced precision arithmetic, but maintaining appropriate accuracy is essential. We explore reduced precision optimisation for simulating chaotic systems, targeting atmospheric modelling in which even minor changes in arithmetic behaviour can have a significant impact on system behaviour. Hence, standard techniques for comparing numerical accuracy are inappropriate. We use the Hellinger distance to compare statistical behaviour between reduced-precision CPU implementations to guide FPGA designs of a chaotic system, and analyse accuracy, performance and power efficiency of the resulting implementations. Our results show that with only a limited loss in accuracy corresponding to less than 10% uncertainly in input parameters, a single Xilinx Virtex 6 SXT475 FPGA can be 13 times faster and 23 times more power efficient than a 6-core Intel Xeon X5650 processor.","PeriodicalId":356953,"journal":{"name":"2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128743533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sicheng Li, Chunpeng Wu, Hai Helen Li, Boxun Li, Yu Wang, Qinru Qiu
{"title":"FPGA Acceleration of Recurrent Neural Network Based Language Model","authors":"Sicheng Li, Chunpeng Wu, Hai Helen Li, Boxun Li, Yu Wang, Qinru Qiu","doi":"10.1109/FCCM.2015.50","DOIUrl":"https://doi.org/10.1109/FCCM.2015.50","url":null,"abstract":"Recurrent neural network (RNN) based language model (RNNLM) is a biologically inspired model for natural language processing. It records the historical information through additional recurrent connections and therefore is very effective in capturing semantics of sentences. However, the use of RNNLM has been greatly hindered for the high computation cost in training. This work presents an FPGA implementation framework for RNNLM training acceleration. At architectural level, we improve the parallelism of RNN training scheme and reduce the computing resource requirement for computation efficiency enhancement. The hardware implementation primarily targets at reducing data communication load. A multi-thread based computation engine is utilized which can successfully mask the long memory latency and reuse frequent accessed data. The evaluation based on the Microsoft Research Sentence Completion Challenge shows that the proposed FPGA implementation outperforms traditional class-based modest-size recurrent networks and obtains 46.2% in training accuracy. Moreover, experiments at different network sizes demonstrate a great scalability of the proposed framework.","PeriodicalId":356953,"journal":{"name":"2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122967198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Reconfigurable Multiclass Support Vector Machine Architecture for Real-Time Embedded Systems Classification","authors":"Jason Kane, R. Hernandez, Qing Yang","doi":"10.1109/FCCM.2015.24","DOIUrl":"https://doi.org/10.1109/FCCM.2015.24","url":null,"abstract":"A great architectural challenge facing many of today's embedded systems is in combining physical sensory inputs with often power constrained computational elements to timely and accurately achieve an understanding of the current operating environment. Classification processing is one manner in which some designs accomplish this task. Support Vector Machines (SVMs) encompass one field of classification that has proven to yield high accuracy and has recently seen increased widespread use, however, the required computational intensity places a challenge on computer architects to design a hardware structure capable of performing real-time classifications while maintaining low power consumption. This paper proposes the first ever fully pipelined, floating point based, multi-use reconfigurable hardware architecture designed to act in conjunction with embedded processing as an accelerator for multiclass SVM classification. Several tasks, involving an extensive sample set of over 100,000 classifications, are evaluated for speed and accuracy against the same suite running on both an Intel Core i7-2600 system with lib SVM and an Nvidia GT 750M graphics card GPU. Our promising results show that our architecture is able to achieve a measure able speed increase in performance of up to 53x while matching 99.95% of all lib SVM predictions.","PeriodicalId":356953,"journal":{"name":"2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126070426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jeevan Sirkunan, C. Y. Ooi, Muhammad N. Shaikh-Husin, Y. Hau, M. N. Marsono
{"title":"Adaptive Configurable Transactional Memory for Multi-processor FPGA Platforms","authors":"Jeevan Sirkunan, C. Y. Ooi, Muhammad N. Shaikh-Husin, Y. Hau, M. N. Marsono","doi":"10.1109/FCCM.2015.41","DOIUrl":"https://doi.org/10.1109/FCCM.2015.41","url":null,"abstract":"Hardware Transactional memory (HTM) performance is application-specific and is dependent on its version management and conflict management configurations. An adaptive mechanism is needed to adapt its configurations based on multiple application behaviour.","PeriodicalId":356953,"journal":{"name":"2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128230755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Enabling High Throughput and Virtualization for Traffic Classification on FPGA","authors":"Yun Qu, V. Prasanna","doi":"10.1109/FCCM.2015.20","DOIUrl":"https://doi.org/10.1109/FCCM.2015.20","url":null,"abstract":"As an important network management task, Internet traffic classification requires high throughput. Virtualization is a technique sharing the same piece of hardware for multiple users. We present a high-throughput and virtualized architecture for online traffic classification. To explore massive parallelism, we provide a conversion from a decision-tree into a compact rule set table, we employ modular processing elements and map the table to a 2-dimensional pipelined architecture. To support hardware virtualization, we develop a novel dynamic update mechanism, it requires small resource overhead and has little impact on the overall throughput. To evaluate the performance of this architecture, we implement an online traffic classification engine on a state-of-the-art FPGA. Post place-and-route results show that, our classification engine achieves 5-fold throughput compared with existing dynamically up datable online traffic classification engines on FPGA.","PeriodicalId":356953,"journal":{"name":"2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134430376","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}