2021 IEEE 29th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)最新文献

筛选
英文 中文
Scalable FPGA Median Filtering via a Directional Median Cascade 通过方向性中值级联的可扩展FPGA中值滤波
Oscar Rahnama, S. Golodetz, Tommaso Cavallari, Philip H. S. Torr
{"title":"Scalable FPGA Median Filtering via a Directional Median Cascade","authors":"Oscar Rahnama, S. Golodetz, Tommaso Cavallari, Philip H. S. Torr","doi":"10.1109/FCCM51124.2021.00058","DOIUrl":"https://doi.org/10.1109/FCCM51124.2021.00058","url":null,"abstract":"The 2-D median filter, one of the oldest and most well-established image-filtering techniques, still sees widespread use throughout computer vision. Despite its relative algorithmic simplicity, accelerating the 2-D median filter via a hardware implementation becomes increasingly challenging as the window size increases, since the resources required grow quartically with the window size. Previous works, in a non-FPGA context, have shown that separately applying several directional median filters to an image, and then taking the median of their results, yields performance that is competitive with, and in some cases even better than, that of a classic 2-D window median. Inspired by these approaches, we propose a novel way of substituting a 2-D median filter on an FPGA with a sequence of directional median filters, in our case arranged as a pipeline, in the pursuit of an FPGA implementation that achieves better scalability and hardware efficiency without sacrificing accuracy. We empirically show that the combination of three particular directional filters, in any order, achieves this, whilst requiring quadratically fewer resources on the FPGA and allowing for much higher throughput.","PeriodicalId":430997,"journal":{"name":"2021 IEEE 29th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115458922","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}
引用次数: 2
3D-VNPU: A Flexible Accelerator for 2D/3D CNNs on FPGA 3D- vnpu: FPGA上2D/3D cnn的灵活加速器
Huipeng Deng, Jian Wang, Huafeng Ye, Shanlin Xiao, Xiangyu Meng, Zhiyi Yu
{"title":"3D-VNPU: A Flexible Accelerator for 2D/3D CNNs on FPGA","authors":"Huipeng Deng, Jian Wang, Huafeng Ye, Shanlin Xiao, Xiangyu Meng, Zhiyi Yu","doi":"10.1109/FCCM51124.2021.00029","DOIUrl":"https://doi.org/10.1109/FCCM51124.2021.00029","url":null,"abstract":"Three-dimensional convolutional neural networks (3D CNNs) have proven to be outstanding in applications such as video analysis, 3-dimension geometric data, and 3-dimension medical image diagnosis. Compared to 2D CNNs, 3D CNNs require high computational complexity to get spatio-temporal features while Winograd algorithm can significantly reduce the amount of computation. Prior works based on 3D Winograd accelerators are only applied to stride-1 convolution, however, most of the popular 3D CNNs contain stride-2 convolution layers. In this paper, we propose a novel flexible Winograd-based decomposition method (FWDM) to apply the 3D Winograd to different strides convolution. Evaluation results show that FWDM reduces computational complexity by a factor of 3.2 for C3D, 2.9 for 3D ConvNet, and 2.6 for 3D ResNet-18. Furthermore, we design a flexible computing engine to stretch the use range of the decomposition method. Coupling FWDM and computing engine, a Winograd-based, 2D/3D CNNs compatible, highly efficient, and flexible accelerator (3D-VNPU) is proposed. Finally, we demonstrate the effectiveness of 3D-VNPU on FPGA platform (Xilinx ZCU102) and achieve 1.35TOPS for C3D, 1.2TOPS for 3D ResNet-18, and 1.1TOPS for VGG-16. DSP efficiency outperforms other CNNs accelerators 2.57∼15.3x compared with prior works in FPGA of C3D. Compared to GPU and CPU, our accelerator achieves improvement up to 37.9x in performance relative to CPU and 11.8x in energy efficiency relative to GPU.","PeriodicalId":430997,"journal":{"name":"2021 IEEE 29th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115466783","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}
引用次数: 10
FERMAT: FPGA-Accelerated Heterogeneous Computing Platform Near NVMe Storage 靠近NVMe存储的fpga加速异构计算平台
Yu Zou, Mingjie Lin
{"title":"FERMAT: FPGA-Accelerated Heterogeneous Computing Platform Near NVMe Storage","authors":"Yu Zou, Mingjie Lin","doi":"10.1109/FCCM51124.2021.00049","DOIUrl":"https://doi.org/10.1109/FCCM51124.2021.00049","url":null,"abstract":"This paper proposes FERMAT, a versatile FPGA-accelerated near-storage computing platform that aims at significantly reducing data latency and energy consumption for data-intensive applications running on a heterogeneous computing system. Two key ideas are contributing to FERMAT’s success. Firstly, FERMAT, through creating direct and parallel I/O channels between a processor and NVMe (Non-Volatile Memory Express) storage with reconfigurable digital fabric as well as bypassing all OS software stack, can significantly reduce unnecessary data movements in order to deliver low-latency and high- bandwidth I/O. Secondly, FERMAT, through \"pre-computing\" a large amount of data near NVMe storage with FPGA-based computing engines, can effectively shift part of computing in a target application to the data source. To further facilitate the deployment of FERMAT, we provide general system-level support and an effective abstraction to the near-storage computing such that FERMAT can be used on any platform equipped with an NVMe storage and achieve overall higher performance.To fully validate this proposed approach, in hardware, we have designed and implemented an open-source FPGA-based self-managed NVMe controller that 1) directly connects an FPGA-based accelerator with the storage while bypassing all software stacks, and 2) transforms an FPGA device into an in-line computing engine, where multiple user-programmable streaming accelerators concurrently process file streams, that greatly improves data-intensive applications’ performance. In software, 3) we designed a dedicated software stack equipping FPGA-accelerated storage with a user-space filesystem supporting all the common file operations on modern Linux systems and a flexible and thread-safe compute engine programming interface to ease user control on the compute engine’s functionality. We measured the performance of FERMAT against the baseline with five benchmarks from three categories: security, graph query, and graph analysis. FERMAT demonstrated significant speedups ranging from 1.8x to 782.5x in processing throughput.","PeriodicalId":430997,"journal":{"name":"2021 IEEE 29th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114870634","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}
引用次数: 2
GAME: Gaussian Mixture Model Mapping and Navigation Engine on Embedded FPGA 游戏:基于嵌入式FPGA的高斯混合模型映射和导航引擎
Yuanfan Xu, Zhaoliang Zhang, Jincheng Yu, Jianfei Cao, Haolin Dong, Zhengfeng Huang, Yu Wang, Huazhong Yang
{"title":"GAME: Gaussian Mixture Model Mapping and Navigation Engine on Embedded FPGA","authors":"Yuanfan Xu, Zhaoliang Zhang, Jincheng Yu, Jianfei Cao, Haolin Dong, Zhengfeng Huang, Yu Wang, Huazhong Yang","doi":"10.1109/FCCM51124.2021.00015","DOIUrl":"https://doi.org/10.1109/FCCM51124.2021.00015","url":null,"abstract":"3D mapping is a fundamental task in robot applications. The traditional mapping methods mainly rely on spatial discretization, in which the amount of data that needs to be stored is large, and the representation ability is limited. As a continuous probability model, the Gaussian Mixture Model (GMM) has a small memory footprint and high-fidelity representation ability. Thus the GMM map is superior to discrete map representations in basic robot tasks such as navigation and localization. The general method of building GMM maps is the iterative Expectation-Maximization (EM) algorithm with K-means initialization. The EM and K-means algorithms are computation-intensive, making it challenging to meet real-time 30 fps mapping requirements on the embedded robot systems. This paper proposes a Gaussian mixture model mapping and navigation engine (GAME) on embedded FPGA to accelerate the mapping process. To achieve fully pipelined with minimal hardware resource cost, we design a unified dataflow and hardware architecture for both K-means and EM for GMM. We analyze different quantization strategies for higher parallelism and find a low-bit quantization method with mixed 8/16-bit data representation, bringing negligible loss in accuracy. Combining the unified dataflow and the mixed-bit data quantization, GAME enables real-time GMM mapping and navigation on embedded robots. The experimental results on ZCU102 show that our proposed hardware-software co-optimization framework on FPGA can run over 60× faster than on a GeForce 1080Ti GPU and over 490× faster than on an Nvidia Jetson TX2, and achieves 59 fps.","PeriodicalId":430997,"journal":{"name":"2021 IEEE 29th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127054043","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}
引用次数: 2
Heterogeneous Dual-Core Overlay Processor for Light-Weight CNNs 轻量级cnn的异构双核叠加处理器
Tiandong Zhao, Yunxuan Yu, Kun Wang, Lei He
{"title":"Heterogeneous Dual-Core Overlay Processor for Light-Weight CNNs","authors":"Tiandong Zhao, Yunxuan Yu, Kun Wang, Lei He","doi":"10.1109/FCCM51124.2021.00051","DOIUrl":"https://doi.org/10.1109/FCCM51124.2021.00051","url":null,"abstract":"Convolutional neural networks (CNNs) have achieved extensive success on miscellaneous artificial intelligence applications such as image classification and object detection. A plethora of models emerge with different operators and architectures, gradually shifting attention from accuracy to efficiency in terms of speed and power, since VGG-like architecture from early stage has significant redundancy. Light-weight CNNs are proposed to reduce computation complexity and parameter amount. MobileNets, one typical example of light-weight CNNs, adopt depthwise separable convolution, while others such as SqueezeNet alter model topology to spare computation power.","PeriodicalId":430997,"journal":{"name":"2021 IEEE 29th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133445137","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}
引用次数: 4
Near-Storage Acceleration of Database Query Processing with SmartSSDs 基于smartssd的近存储加速数据库查询处理
M. Soltaniyeh, Veronica L. M. Reis, Matt Bryson, R. Martin, Santosh Nagarakatte
{"title":"Near-Storage Acceleration of Database Query Processing with SmartSSDs","authors":"M. Soltaniyeh, Veronica L. M. Reis, Matt Bryson, R. Martin, Santosh Nagarakatte","doi":"10.1109/FCCM51124.2021.00052","DOIUrl":"https://doi.org/10.1109/FCCM51124.2021.00052","url":null,"abstract":"Smart solid-state drives (SmartSSDs) with onboard FPGAs are becoming mainstream, providing opportunities for near-storage computation, which is appealing for increasing the performance of data-intensive workloads such as database query processing. This paper demonstrates the performance and energy improvements by offloading the filter and aggregation operations to the FPGA on a SmartSSD with real-system experiments. We make the observation that efficiently handling null entries in the data is important. Hence, we propose a novel design to manage the metadata to handle null entries. Our real system evaluation shows that offloading the query operations to the FPGA results in 9.6× improvement in performance while consuming 10.9× less energy compared to a conventional CPU-only query processing.","PeriodicalId":430997,"journal":{"name":"2021 IEEE 29th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124699589","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}
引用次数: 4
Time-Domain FPGA Power Delivery Network Characterization Methodology 时域FPGA功率传输网络表征方法
Yanran P. Chen, M. Voogel, E. Priest, Qian Wang, Ranjeeth Doppalapudi, Praful Jain
{"title":"Time-Domain FPGA Power Delivery Network Characterization Methodology","authors":"Yanran P. Chen, M. Voogel, E. Priest, Qian Wang, Ranjeeth Doppalapudi, Praful Jain","doi":"10.1109/FCCM51124.2021.00064","DOIUrl":"https://doi.org/10.1109/FCCM51124.2021.00064","url":null,"abstract":"Designing power distribution or delivery networks (PDNs) for field-programmable gate arrays (FPGAs) has become increasingly challenging. This makes PDN technology look-ahead prior to product design cycle extremely crucial in helping modern FPGAs to cope with rapidly-increasing power delivery challenges.","PeriodicalId":430997,"journal":{"name":"2021 IEEE 29th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127636846","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}
引用次数: 0
Particle Mesh Ewald for Molecular Dynamics in OpenCL on an FPGA Cluster 基于FPGA集群的OpenCL分子动力学粒子网格Ewald
Lawrence C. Stewart, C. Pascoe, Emery Davis, B. W. Sherman, Martin C. Herbordt, Vipin Sachdeva
{"title":"Particle Mesh Ewald for Molecular Dynamics in OpenCL on an FPGA Cluster","authors":"Lawrence C. Stewart, C. Pascoe, Emery Davis, B. W. Sherman, Martin C. Herbordt, Vipin Sachdeva","doi":"10.1109/FCCM51124.2021.00055","DOIUrl":"https://doi.org/10.1109/FCCM51124.2021.00055","url":null,"abstract":"Molecular Dynamics (MD) simulations play a central role in physics-driven drug discovery. MD applications often use the Particle Mesh Ewald (PME) algorithm to accelerate electrostatic force computations, but efficient parallelization has proven difficult due to the high communication requirements of distributed 3D FFTs. In this paper, we present the design and implementation of a scalable PME algorithm that runs on a cluster of Intel Stratix 10 FPGAs and can handle FFT sizes appropriate to address real-world drug discovery projects (grids up to 1283). To our knowledge, this is the first work to fully integrate all aspects of the PME algorithm (charge spreading, 3D FFT/IFFT, and force interpolation) within a distributed FPGA framework. The design is fully implemented with OpenCL for flexibility and ease of development and uses 100 Gbps links for direct FPGA-to-FPGA communications without the need for host interaction. We present experimental data up to 4 FPGAs (e.g., 206 microseconds per timestep for a 65536 atom simulation and 643 3D FFT), outperforming GPUs. Additionally, we discuss design scalability on clusters with differing topologies up to 64 FPGAs (with expected performance greater than all known GPU implementations) and integration with other hardware components to form a complete molecular dynamics application. We predict best-case performance of 6.6 microseconds per timestep on 64 FPGAs.","PeriodicalId":430997,"journal":{"name":"2021 IEEE 29th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125386170","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}
引用次数: 2
HAO: Hardware-aware Neural Architecture Optimization for Efficient Inference 面向高效推理的硬件感知神经结构优化
Zhen Dong, Yizhao Gao, Qijing Huang, J. Wawrzynek, Hayden Kwok-Hay So, K. Keutzer
{"title":"HAO: Hardware-aware Neural Architecture Optimization for Efficient Inference","authors":"Zhen Dong, Yizhao Gao, Qijing Huang, J. Wawrzynek, Hayden Kwok-Hay So, K. Keutzer","doi":"10.1109/FCCM51124.2021.00014","DOIUrl":"https://doi.org/10.1109/FCCM51124.2021.00014","url":null,"abstract":"Automatic algorithm-hardware co-design for DNN has shown great success in improving the performance of DNNs on FPGAs. However, this process remains challenging due to the intractable search space of neural network architectures and hardware accelerator implementation. Differing from existing hardware-aware neural architecture search (NAS) algorithms that rely solely on the expensive learning-based approaches, our work incorporates integer programming into the search algorithm to prune the design space. Given a set of hardware resource constraints, our integer programming formulation directly outputs the optimal accelerator configuration for mapping a DNN subgraph that minimizes latency. We use an accuracy predictor for different DNN subgraphs with different quantization schemes and generate accuracy-latency pareto frontiers. With low computational cost, our algorithm can generate quantized networks that achieve state-of-the-art accuracy and hardware performance on Xilinx Zynq (ZU3EG) FPGA for image classification on ImageNet dataset. The solution searched by our algorithm achieves 72.5% top-1 accuracy on ImageNet at framerate 50, which is 60% faster than MnasNet [37] and 135% faster than FBNet [43] with comparable accuracy.","PeriodicalId":430997,"journal":{"name":"2021 IEEE 29th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128015834","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}
引用次数: 25
NullaNet Tiny: Ultra-low-latency DNN Inference Through Fixed-function Combinational Logic NullaNet Tiny:通过固定功能组合逻辑的超低延迟DNN推理
M. Nazemi, A. Fayyazi, Amirhossein Esmaili, Atharva Khare, S. Shahsavani, M. Pedram
{"title":"NullaNet Tiny: Ultra-low-latency DNN Inference Through Fixed-function Combinational Logic","authors":"M. Nazemi, A. Fayyazi, Amirhossein Esmaili, Atharva Khare, S. Shahsavani, M. Pedram","doi":"10.1109/FCCM51124.2021.00053","DOIUrl":"https://doi.org/10.1109/FCCM51124.2021.00053","url":null,"abstract":"While there is a large body of research on efficient processing of deep neural networks (DNNs) [1]–[31], ultra-low-latency realization of these models for applications with stringent, sub-microsecond latency requirements continues to be an unresolved, challenging problem. Field-programmable gate array (FPGA)-based DNN accelerators are gaining traction as a serious contender to replace graphics processing unit/central processing unit-based platforms considering their performance, flexibility, and energy efficiency. NullaNet (2018) [32], LUTNet (2019) [33], and LogicNets (2020) [34] are among accelerators specifically designed to benefit from FPGAs’ capabilities.","PeriodicalId":430997,"journal":{"name":"2021 IEEE 29th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126443476","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}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书