Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines最新文献

筛选
英文 中文
TCP-Stream reassembly and state tracking in hardware 硬件中的tcp流重组和状态跟踪
M. Necker, Didier Contis, D. Schimmel
{"title":"TCP-Stream reassembly and state tracking in hardware","authors":"M. Necker, Didier Contis, D. Schimmel","doi":"10.1109/FPGA.2002.1106687","DOIUrl":"https://doi.org/10.1109/FPGA.2002.1106687","url":null,"abstract":"In this paper we consider a new approach to network intrusion detection. Conventional network intrusion detection systems (NIDS) are software based. We propose to selectively implement portions of the functionality of a state-of-the-art software NIDS in reconfigurable hardware. This increases performance even under hostile loads and will enable efficient intrusion detection in future multi-gigabit networks. Specifically, we consider the problem of TCP-stream reassembly. We present a high-performance TCP stream reassembly and state tracking module targeted for incorporation into an agile reconfigurable network interface based on Xilinx Virtex technology.","PeriodicalId":272235,"journal":{"name":"Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125123681","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}
引用次数: 42
RACER - a rapid prototyping accelerator for pulsed neural networks RACER -脉冲神经网络的快速原型加速器
Cyprian Grassmann, J. Anlauf
{"title":"RACER - a rapid prototyping accelerator for pulsed neural networks","authors":"Cyprian Grassmann, J. Anlauf","doi":"10.1109/FPGA.2002.1106683","DOIUrl":"https://doi.org/10.1109/FPGA.2002.1106683","url":null,"abstract":"In this extended abstract we sketch the employment of programmable logic for the acceleration of the simulation of pulsed neural networks. We compare our approach to solutions which are based on DSPs and digital neuroprocessors. Our solution is a rapid prototyping accelerator board which is based on a data flow concept. The accelerator provides three module sockets with a rather simple 32Bit interface. The design is focused on a maximal data through-put to and from each module. Due to the architecture a very high parallelism between the modules can be achieved Two programmable devices on each module are supported by the on-board programming and test unit, which provides in-circuit programming by the host during operation. As a result the accelerator delivers a high performance and flexibility without introducing a complex interface or handling. Any programmable device, FPGA, CPLD or special architectures like Kress-Arrays may be used on a module of this accelerator board, hence coarse and fine grain architectures can be used.","PeriodicalId":272235,"journal":{"name":"Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125249672","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}
引用次数: 3
Automatic latency-optimal design of FPGA-based systolic arrays 基于fpga的收缩阵列自动延迟优化设计
J. Nash
{"title":"Automatic latency-optimal design of FPGA-based systolic arrays","authors":"J. Nash","doi":"10.1109/FPGA.2002.1106692","DOIUrl":"https://doi.org/10.1109/FPGA.2002.1106692","url":null,"abstract":"\"Systolic\" algorithms have been shown to be suitable for a very large range of structured problems (i.e., linear algebra, graph theory, computational geometry, number-theoretic algorithms, string matching, sorting/searching, dynamic programming, discreet mathematics). Usage of this systolic architecture class has not been widespread in the past, in part because programmable hardware that supported this computing paradigm was not cost-effective to build and no design tools existed. However, suitable hardware has begun to appear. Complex FPGAs now provide an adequate level of speed, density and programmability in the form of reconfigurable computers, boards, and chips with embedded computational support. Such hardware could allow rapid implementation and change of systolic algorithms leading to inexpensive \"programmable\" systolic array hardware. Furthermore, the architectural characteristics of much FPGA hardware matches that required by systolic processing, because this technology is constructed from tiling identical memory and logic blocks along with supporting mesh interconnection networks. The symbolic parallel algorithm development environment (SPADE) described here is being developed to allow a designer to easily and rapidly explore the design space of various systolic algorithm implementations so that FPGA system tradeoffs can be efficiently analyzed. The intention is to allow a user to specify his algorithm with traditional high-level code, set some architectural constraints and then view the results in a meaningful graphical format.","PeriodicalId":272235,"journal":{"name":"Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116978078","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
Analysis and implementation of the discrete element method using a dedicated highly parallel architecture in reconfigurable computing 可重构计算中离散元方法的高度并行分析与实现
Benjamin Carrión Schäfer, S. Quigley, A. Chan
{"title":"Analysis and implementation of the discrete element method using a dedicated highly parallel architecture in reconfigurable computing","authors":"Benjamin Carrión Schäfer, S. Quigley, A. Chan","doi":"10.1109/FPGA.2002.1106672","DOIUrl":"https://doi.org/10.1109/FPGA.2002.1106672","url":null,"abstract":"The Discrete Element Method (DEM) is a numerical model to describe the mechanical behaviour of discontinuous bodies. It has been traditionally used to simulate particle flows (e.g. sand, sugar), but is becoming more popular as a method to represent solid materials. The DEM is very computationally expensive, but has properties that make it amenable to acceleration by reconfigurable computing. This paper describes the implementation of a dedicated hardware architecture for the DEM implemented on an FPGA, which is capable of giving a speed-zip of about 30 times compared to an optimised software version running on a fast microprocessor.","PeriodicalId":272235,"journal":{"name":"Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134499093","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}
引用次数: 12
Module generators driving the compilation for adaptive computing systems 模块生成器驱动自适应计算系统的编译
A. Koch, Nico Kasprzyk
{"title":"Module generators driving the compilation for adaptive computing systems","authors":"A. Koch, Nico Kasprzyk","doi":"10.1109/FPGA.2002.1106689","DOIUrl":"https://doi.org/10.1109/FPGA.2002.1106689","url":null,"abstract":"We present GLACE, the Generic Library for Adaptive Computing Systems, which offers a comprehensive set of user-extensible module generators and associated meta-data (e.g., timing, interfaces, topology, etc.). Furthermore, we will discuss some of the issues that need to be addressed when using GLACE from a high-level compilation How.","PeriodicalId":272235,"journal":{"name":"Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122273148","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
On implementing a configware/software SAT solver 实现一个组态/软件SAT求解器
N. A. Reis, J. Sousa
{"title":"On implementing a configware/software SAT solver","authors":"N. A. Reis, J. Sousa","doi":"10.1109/FPGA.2002.1106685","DOIUrl":"https://doi.org/10.1109/FPGA.2002.1106685","url":null,"abstract":"This paper presents an implementation of the configware/software SAT solver proposed in de Sousa, Abramovici and da Silva (2001). This is the first actually implemented hardware accelerated solver that can dispense with instance-specific compilation, and is capable of handling SAT formulas of virtually any size.","PeriodicalId":272235,"journal":{"name":"Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125502349","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}
引用次数: 13
Queue machines: hardware compilation in hardware 队列机:硬件中的硬件编译
H. Schmit, B. Levine, Benjamin Ylvisaker
{"title":"Queue machines: hardware compilation in hardware","authors":"H. Schmit, B. Levine, Benjamin Ylvisaker","doi":"10.1109/FPGA.2002.1106670","DOIUrl":"https://doi.org/10.1109/FPGA.2002.1106670","url":null,"abstract":"In this paper we hypothesize that reconfigurable computing is not more widely used because of the logistical difficulties caused by the close coupling of applications and hardware platforms. As an alternative, we propose computing machines that use a single, serial instruction representation for the entire reconfigurable computing application. We show how it is possible to convert, at runtime, the parallel portions of the application into a spatial representation suitable for execution on a reconfigurable fabric. The conversion to spatial representation is facilitated by the use of an instruction set architecture based on an operand queue. We describe techniques to generate code for queue machines and hardware virtualization techniques necessary to allow any application to execute on any platform.","PeriodicalId":272235,"journal":{"name":"Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126505023","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}
引用次数: 44
An FPGA implementation of triangle mesh decompression 三角网格解压缩的FPGA实现
T. Mitra, T. Chiueh
{"title":"An FPGA implementation of triangle mesh decompression","authors":"T. Mitra, T. Chiueh","doi":"10.1109/FPGA.2002.1106658","DOIUrl":"https://doi.org/10.1109/FPGA.2002.1106658","url":null,"abstract":"This paper presents an FPGA-based design and implementation of a three dimensional (3D)) triangle mesh decompressor. Triangle mesh is the dominant representation of 3D geometric models. The prototype decompressor is based on a simple and highly efficient triangle mesh compression algorithm, called BFT mesh encoding. To the best of our knowledge, this is the first hardware implementation of triangle mesh decompression. The decompressor can be added at the front-end of a 3D graphics card sitting on the PCI/AGP bus. It can reduce the bandwidth requirement on the bus between the host and the graphics card by up to 80% compared to standard triangle mesh representations. Other mesh decompression algorithms with comparable compression efficiency to BFT mesh encoding are too complex to be implemented in hardware.","PeriodicalId":272235,"journal":{"name":"Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127281392","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}
引用次数: 18
FPGA-based template matching using distance transforms 基于fpga的模板匹配,使用距离变换
Stefan Hezel, A. Kugel, R. Männer, D. Gavrila
{"title":"FPGA-based template matching using distance transforms","authors":"Stefan Hezel, A. Kugel, R. Männer, D. Gavrila","doi":"10.1109/FPGA.2002.1106664","DOIUrl":"https://doi.org/10.1109/FPGA.2002.1106664","url":null,"abstract":"This paper presents a high-performance FPGA solution to generic shape-based object detection in images. The underlying detection method involves representing the target object by binary templates containing positional and directional edge information. A particular scene image is preprocessed by edge segmentation, edge cleaning and distance transforms. Matching involves correlating the templates with the distance-transformed scene image and determining the locations where the mismatch is below a certain user-defined threshold. Although successful in the past, a significant drawback of these matching methods has been their large computational cost when implemented on a sequential general-purpose processor. In this paper we present a step by step implementation of the components of such object detection systems, taking advantage of the data and logical parallelism opportunities offered by an FPGA architecture. The realization of a pipelined calculation of the preprocessing and correlation on FPGA is presented in detail.","PeriodicalId":272235,"journal":{"name":"Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122371792","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}
引用次数: 45
A massively parallel RC4 key search engine 一个大规模并行RC4密钥搜索引擎
K. H. Tsoi, Kin-Hong Lee, P. Leong
{"title":"A massively parallel RC4 key search engine","authors":"K. H. Tsoi, Kin-Hong Lee, P. Leong","doi":"10.1109/FPGA.2002.1106657","DOIUrl":"https://doi.org/10.1109/FPGA.2002.1106657","url":null,"abstract":"A massively parallel implementation of an RC4 key search engine on an FPGA is described. The design employs parallelism at the logic level to perform many operations per cycle, uses on-chip memories to achieve very high memory bandwidth, floorplanning to reduce routing delays and multiple decryption units to achieve further parallelism. A total of 96 RC4 decryption engines were integrated on a single Xilinx Virtex XCV1000-E field programmable gate array (FPGA). The resulting design operates at a 50 MHz clock rate and achieves a search speed of 6.06 /spl times/ 10/sup 6/ keys/second, which is a speedup of 58 over a 1.5 GHz Pentium 4 PC.","PeriodicalId":272235,"journal":{"name":"Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines","volume":"468 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127805654","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}
引用次数: 52
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学术文献互助群
群 号:481959085
Book学术官方微信