Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays最新文献

筛选
英文 中文
The P4->NetFPGA Workflow for Line-Rate Packet Processing 线速率数据包处理的P4->NetFPGA工作流
Stephen Ibanez, G. Brebner, N. McKeown, Noa Zilberman
{"title":"The P4->NetFPGA Workflow for Line-Rate Packet Processing","authors":"Stephen Ibanez, G. Brebner, N. McKeown, Noa Zilberman","doi":"10.1145/3289602.3293924","DOIUrl":"https://doi.org/10.1145/3289602.3293924","url":null,"abstract":"P4 has emerged as the de facto standard language for describing how network packets should be processed, and is becoming widely used by network owners, systems developers, researchers and in the classroom. The goal of the work presented here is to make it easier for engineers, researchers and students to learn how to program using P4, and to build prototypes running on real hardware. Our target is the NetFPGA SUME platform, a 4x10 Gb/s PCIe card designed for use in universities for teaching and research. Until now, NetFPGA users have needed to learn an HDL such as Verilog or VHDL, making it off limits to many software developers and students. Therefore, we developed the P4->NetFPGA workflow, allowing developers to describe how packets are to be processed in the high-level P4 language, then compile their P4 programs to run at line rate on the NetFPGA SUME board. The P4->NetFPGA workflow is built upon the Xilinx P4-SDNet compiler and the NetFPGA SUME open source code base. In this paper, we provide an overview of the P4 programming language and describe the P4->NetFPGA workflow. We also describe how the workflow is being used by the P4 community to build research prototypes, and to teach how network systems are built by providing students with hands-on experience working with real hardware.","PeriodicalId":307909,"journal":{"name":"Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125414656","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}
引用次数: 97
Fast Confidence Detection: One Hot Way to Detect Adversarial Attacks via Sensor Pattern Noise Fingerprinting 快速置信度检测:利用传感器模式噪声指纹技术检测对抗性攻击的一种热门方法
Yazhu Lan, Qingli Guo, Guohe Zhang, Yuanchao Xu, Kent W. Nixon, H. Li, Yiran Chen
{"title":"Fast Confidence Detection: One Hot Way to Detect Adversarial Attacks via Sensor Pattern Noise Fingerprinting","authors":"Yazhu Lan, Qingli Guo, Guohe Zhang, Yuanchao Xu, Kent W. Nixon, H. Li, Yiran Chen","doi":"10.1145/3289602.3293975","DOIUrl":"https://doi.org/10.1145/3289602.3293975","url":null,"abstract":"Deep Neural Networks (DNNs) have shown phenomenal success in a wide range of real-world applications. However, a concerning weakness of DNNs is that they are vulnerable to adversarial attacks. Although there exist methods to detect adversarial attacks, they often suffer constraints on specific attack types and provide limited information to downstream systems. We specifically note that existing adversarial detectors are often binary classifiers, which differentiate clean or adversarial examples. However, detection of adversarial examples is much more complicated than such a scenario. Our key insight is that the confidence probability of detecting an input sample as an adversarial example will be more useful for the system to properly take action to resist potential attacks. In this work, we propose an innovative method for fast confidence detection of adversarial attacks based on integrity of sensor pattern noise embedded in input examples. Experimental results show that our proposed method is capable of providing a confidence distribution model of most of popular adversarial attacks. Furthermore, our presented method can provide early attack warning with even the attack types based on different properties of the confidence distribution models. Since fast confidence detection is a computationally heavy task, we propose an FPGA-Based hardware architecture based on a series of optimization techniques, such as incremental multi-level quantization and etc. We realize our proposed method on an FPGA platform and achieve a high efficiency of 29.740 IPS/W with a power consumption of only 0.7626W.","PeriodicalId":307909,"journal":{"name":"Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115122827","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}
引用次数: 1
A Pixel-Parallel Virtual-Image Architecture for High Performance and Power Efficient Graph Cuts Inference 一种用于高性能和高效图割推理的像素并行虚拟图像架构
Tianqi Gao, Rob A. Rutenbar
{"title":"A Pixel-Parallel Virtual-Image Architecture for High Performance and Power Efficient Graph Cuts Inference","authors":"Tianqi Gao, Rob A. Rutenbar","doi":"10.1145/3289602.3293948","DOIUrl":"https://doi.org/10.1145/3289602.3293948","url":null,"abstract":"A Pixel-Parallel Virtual-Image Architecture for High Performance and Power Efficient Graph Cuts Inference Tianqi Gao, University of Illinois Urbana Champaign Rob A. Rutenbar, University of Pittsburgh Contact: gao19@illinois.edu Graph Cuts is a popular technique for Maximum A Posteriori inference in computer vision. It transforms a Markov Random Field problem into a network flow problem, solved via the Push-Relabel algorithm. While attractively simple, the large size of a typical image and the large number of necessary pixel-level iterations render the technique computationally expensive. Prior accelerator attempts have been reported with GPUs and FPGAs. In [1], the first pixel-parallel architecture was demonstrated in FPGA, but limited to only 256-pixel images. This paper extends this pixel-parallel concept and makes following contributions: a \"Virtual Image\" architecture solves the size limitation: large images are decomposed into \"tiles\", and \"stacked\" on the physical processor array; appropriate addressing mechanisms handle virtual pixels and a range of tile edge effects; scaling up the processor array to 1536 pixels; a novel and hardware-friendly heuristic shortens the convergence. We demonstrate the first working virtual-image Graph Cuts accelerator, applied to standard 640x480 images. Scaling up the hardware and the new heuristic bring 6.5x and 1.65x speedups respectively compared with [1]. The design is 7-20x faster than prior FPGA designs, and roughly comparable in speed to a modern GPU benchmark. However, the architecture also offers significant performance-per-unit-power advantages. Formulating a figure of merit particularly for Graph Cuts inference - Graph Cuts per second per Watt - our architecture is about 4 times better than other implementations. Keywords: FPGA; Machine learning; Hardware Acceleration; Computer Vision DOI: https://doi.org/10.1145/3289602.3293948","PeriodicalId":307909,"journal":{"name":"Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130507036","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
An Energy-Efficient FPGA Implementation of an LSTM Network Using Approximate Computing 基于近似计算的LSTM网络节能FPGA实现
E. Azari, A. Dengi, S. Vrudhula
{"title":"An Energy-Efficient FPGA Implementation of an LSTM Network Using Approximate Computing","authors":"E. Azari, A. Dengi, S. Vrudhula","doi":"10.1145/3289602.3293989","DOIUrl":"https://doi.org/10.1145/3289602.3293989","url":null,"abstract":"Long Short-Term Memory (LSTM) Recurrent Neural network (RNN) is known for its capability in modeling temporal aspects of data and has been shown to produce promising results in sequence learning tasks such as language modeling. However, due to the large number of model parameters and compute-intensive operations, existing FPGA implementations of LSTM cells are not sufficiently energy-efficient as they require large area and exhibit high power consumption. This work describes a substantially different hardware implementation of an LSTM which includes several architectural innovations to achieve high throughput and energy-efficiency. This paper includes extensive exploration of the design trade-offs and demonstrates the advantages for one common application - language modeling. Implementation of the design on a Xilinx Zynq XC7Z030 FPGA for language modeling shows significant improvements in throughput and energy-efficiency as compared to the state-of-the-art designs. It is worth mentioning that the proposed LSTM hardware architecture is also applicable to other applications that use LSTM as part of the neural network model (e.g., CNN-RNN models) or in whole (e.g., RNN models).","PeriodicalId":307909,"journal":{"name":"Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121457537","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}
引用次数: 1
Transistor-Level Optimization Methodology for GRM FPGA Interconnect Circuits GRM FPGA互连电路的晶体管级优化方法
Zhengjie Li, Yuanlong Xiao, Yufan Zhang, Yunbing Pang, Jian Wang, Jinmei Lai
{"title":"Transistor-Level Optimization Methodology for GRM FPGA Interconnect Circuits","authors":"Zhengjie Li, Yuanlong Xiao, Yufan Zhang, Yunbing Pang, Jian Wang, Jinmei Lai","doi":"10.1145/3289602.3293955","DOIUrl":"https://doi.org/10.1145/3289602.3293955","url":null,"abstract":"Due to its dominance in the whole chip area, power and delay, the FPGA interconnect circuits are traditionally designed by full custom design method. We present an automated transistor-level sizing optimization methodology for GRM FPGA interconnect circuits. In order to get accurate and effective predicated area, the commonly used diffusion sharing, transistor folding and inputs sharing are considered. To get the accurate and effective delay value, we avoid the inaccuracy of using linear device model, and use two schemes to build wire model: the wire within a circuit and the wire between interconnect circuits. To decrease simulation time, we propose multi-thread acceleration method and the Minimum-Final-Delay (MFD) algorithm which optimizes interconnect circuit as a whole, not separated part. For switch box optimization, MFD algorithm requires 38% less number of simulations than COFFE's algorithm. We use 65nm CMOS process technology for evaluation. For different optimization strategy, we emphasize either representative critical path delay or overall layout area. Compare to full-custom design method, the global cost can be decrease by 3% ~ 17%. For different transistor sizing combinations, 10/50 threads can be ~ 9X/15X faster than single-thread. Compared with the manual design method, our optimization methodology explores larger design space, and it decreases the circuit design optimization time from months to hours.","PeriodicalId":307909,"journal":{"name":"Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","volume":"468 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121731151","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
Simultaneous Placement and Clock Tree Construction for Modern FPGAs 现代fpga的同步放置和时钟树构造
Wuxi Li, M. E. Dehkordi, Stephen Yang, D. Pan
{"title":"Simultaneous Placement and Clock Tree Construction for Modern FPGAs","authors":"Wuxi Li, M. E. Dehkordi, Stephen Yang, D. Pan","doi":"10.1145/3289602.3293897","DOIUrl":"https://doi.org/10.1145/3289602.3293897","url":null,"abstract":"Modern field-programmable gate array (FPGA) devices often contain complex clocking architectures to achieve high-performance and flexible clock networks. The physical structure of these clock networks, however, are pre-manufactured, unadjustable, and with only limited routing resources. Most conventional FPGA placement algorithms rarely consider clock feasibility, and therefore lead to clock routing failures. Some recent works adopt simplified clock routing models (e.g., the bounding box model) to force clock legality during placement, which, however, can often overestimate clock routing demands and results in unnecessary placement quality degradation. To address these limitations, in this paper, we propose a generic FPGA placement framework that can simultaneously optimize placement quality and ensure clock feasibility by explicit clock tree construction. We demonstrate the effectiveness and efficiency of the proposed approach using the ISPD 2017 Clock-Aware Placement Contest benchmark suite. Compared with other state-of-the-art clock legalization algorithms, the proposed approach can achieve the best routed wirelength with competitive runtime.","PeriodicalId":307909,"journal":{"name":"Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131224400","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}
引用次数: 11
AFFIX 词缀
Sajjad Taheri, Payman Behnam, E. Bozorgzadeh, A. Veidenbaum, A. Nicolau
{"title":"AFFIX","authors":"Sajjad Taheri, Payman Behnam, E. Bozorgzadeh, A. Veidenbaum, A. Nicolau","doi":"10.1145/3289602.3293907","DOIUrl":"https://doi.org/10.1145/3289602.3293907","url":null,"abstract":"Computer vision algorithms are computationally expensive and difficult to implement efficiently. Field Programmable Gate Arrays (FPGA)s offer a promising direction to reduce the computation cost by exploiting hardware parallelism. However, it is difficult to translate vision algorithms to FPGA bitstream efficiently. OpenVX is an industry standard for graph-based representation of vision algorithms. It defines a set of widely used vision kernels and data structures that can be used to form a Directed Acyclic Graph (DAG) to represent a vision algorithm. This paper proposes a framework for automatic FPGA acceleration of computer vision algorithms based on OpenVX specification, called AFFIX. AFFIX receives a vision algorithm formed using the OpenVX and generates a heterogeneous CPU-FPGA implementation. AFFIX incorporates several high level and low-level optimization methods to improve the efficiency of the FPGA implementation. It provides a configurable and extensible framework that enables vision algorithm developers to quickly develop, verify and test FPGA implementations of vision algorithms. We demonstrate the effectiveness of the proposed framework via development and evaluations of multiple vision algorithms.","PeriodicalId":307909,"journal":{"name":"Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114610515","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
Characterization of Long Wire Data Leakage in Deep Submicron FPGAs 深亚微米fpga中长线数据泄漏特性研究
George Provelengios, Chethan Ramesh, S. B. Patil, Ken Eguro, R. Tessier, Daniel E. Holcomb
{"title":"Characterization of Long Wire Data Leakage in Deep Submicron FPGAs","authors":"George Provelengios, Chethan Ramesh, S. B. Patil, Ken Eguro, R. Tessier, Daniel E. Holcomb","doi":"10.1145/3289602.3293923","DOIUrl":"https://doi.org/10.1145/3289602.3293923","url":null,"abstract":"The simultaneous use of FPGAs by multiple tenants has recently been shown to potentially expose sensitive information without the victim's knowledge. For example, neighboring long wires in SRAM-based FPGAs have been shown to allow for clandestine data exfiltration. In this work, we explore distinct characteristics of this signal crosstalk that could be used to enhance or prevent information leakage. First, we develop a mechanism to characterize the crosstalk coupling that exists between neighboring wires at the femtosecond scale. Second, we show that it is possible to reverse engineer channel layouts by determining which pairs of routing resources/links in the channel exhibit coupling to each other even if this information is not provided by the FPGA vendor. To fully characterize these effects, we examine long wire coupling on different types of wires across three devices implemented in different technology nodes from 65 to 20 nm. We experimentally demonstrate that information leakage is apparent for all three FPGA families.","PeriodicalId":307909,"journal":{"name":"Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114799481","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}
引用次数: 35
HopliteBuf: FPGA NoCs with Provably Stall-Free FIFOs HopliteBuf: FPGA noc可证明无失速fifo
Tushar Garg, Saud Wasly, R. Pellizzoni, Nachiket Kapre
{"title":"HopliteBuf: FPGA NoCs with Provably Stall-Free FIFOs","authors":"Tushar Garg, Saud Wasly, R. Pellizzoni, Nachiket Kapre","doi":"10.1145/3289602.3293917","DOIUrl":"https://doi.org/10.1145/3289602.3293917","url":null,"abstract":"Deflection-routed NoCs like Hoplite and HopliteRT take advantage of FPGA-specific features to deliver low-cost, high-frequency, FPGA-friendly communication networks. However, they suffer from long packet deflection penalties, low sustained throughputs, and feature limitations such as out-of-order delivery of packets. In this paper, we introduce the HopliteBuf NoC, and an associated static analysis tool, that eliminates deflections entirely while simultaneously adding in-order delivery feature using (1) small, stall-free FIFOs with provable occupancy bounds, and (2) linearization of vertical rings of the torus Hoplite topology to improve provable link utilization. We implement these FIFOs using cheap LUT SRAMs (Xilinx SRL32s, and Intel MLABs) to absorb packet contention. We evaluate conditions for stall-free behavior using static analysis that compute upper bounds on FIFO occupancy based on the communication pattern. Our static analysis deliver bounds that are not only better (in latency) than HopliteRT but also tighter by 2--3×. Across 100 randomly-generated flowsets mapped to a 5×5 system size, HopliteBuf is able to route a larger fraction of these flowsets with textless 128-deep FIFOs, boost worst-case routing latency by $approx$2× for mutually feasible flowsets. At 20% injection rates, HopliteRT is only able to route 1--2% of the flowsets while HopliteBuf can deliver 40--50% sustainability.","PeriodicalId":307909,"journal":{"name":"Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124702980","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}
引用次数: 6
Scheduling Data in Neural Network Applications 神经网络应用中的数据调度
Thaddeus Koehn, P. Athanas
{"title":"Scheduling Data in Neural Network Applications","authors":"Thaddeus Koehn, P. Athanas","doi":"10.1145/3289602.3293930","DOIUrl":"https://doi.org/10.1145/3289602.3293930","url":null,"abstract":"Neuromorphic computing is becoming common in diverse systems, including time-sensitive, real-time systems. This requires that large data sets be processed quickly with low latency. A stream processing architecture helps achieve this goal by beginning processing as soon as samples are received. In this paper, to achieve a low-latency implementation, neurons are parsed into fine-grain operations and scheduled onto stages of the pipeline. Wide datapaths that process multiple samples in each stage of the pipeline greatly improve throughput and latency. Also, the sparsity of partially connected neural networks allows proposed schedulers to further decrease latency. These schedulers use 'greedy' heuristics based on data dependencies to develop a reduced latency schedule. The schedulers were testing against sets of 1000 partially-connected neural networks, with sets ranging in number of layers from three to fifteen. The set of heuristics developed showed reductions of up to 67% over a sequential schedule.","PeriodicalId":307909,"journal":{"name":"Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129888540","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}
引用次数: 1
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学术官方微信
小红书