Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251)最新文献

筛选
英文 中文
Dynamic circuit generation for solving specific problem instances of Boolean satisfiability 求解布尔可满足性具体问题实例的动态电路生成
Azra Rashid, J. Leonard, W. Mangione-Smith
{"title":"Dynamic circuit generation for solving specific problem instances of Boolean satisfiability","authors":"Azra Rashid, J. Leonard, W. Mangione-Smith","doi":"10.1109/FPGA.1998.707897","DOIUrl":"https://doi.org/10.1109/FPGA.1998.707897","url":null,"abstract":"Optimization and query problems provide the best clear opportunity for configurable computing systems to achieve a significant performance advantage over ASICs. Programmable hardware can be optimized to solve a specific problem instance that only needs to be solved once, and the circuit can be thrown away after its single execution. This paper investigates the applicability of this technology to solving a specific query problem, known as Boolean Satisfiability. We provide a system for capturing the complete execution cost of this approach, by accounting for CAD tool execution time. The key to this approach is to circumvent the standard CAD tools and directly generate circuits at runtime. A set of example circuits is presented as part of the system evaluation, and a complete implementation on the Xilinx XC6216 FPGA is presented.","PeriodicalId":309841,"journal":{"name":"Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132524503","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
Reconfigurable hardware as shared resource for parallel threads 作为并行线程共享资源的可重构硬件
G. Haug, W. Rosenstiel
{"title":"Reconfigurable hardware as shared resource for parallel threads","authors":"G. Haug, W. Rosenstiel","doi":"10.1109/FPGA.1998.707935","DOIUrl":"https://doi.org/10.1109/FPGA.1998.707935","url":null,"abstract":"Approaches to use FPGAs as reconfigurable coprocessors so far always suffered from two problems. First, the hardware required for communication with the host processor occupied an unacceptable large part of the resources available on the FPGA and second, this communication was so slow that the gained acceleration came to naught. The new Xilinx XC6200 family aims to solve both of these problems. The chips are accessed via an SRAM interface, i.e. the host sees them as part of its memory. Besides the configuration bits, which determine logical behaviour and routing, all internal hip-hops of the XC6200 are accessible for reading as well as for writing. This ensures a high performance, since a 32 bit input or output value can be exchanged between the host and the coprocessor by a single load or store operation. In order to make use of the hardware features of the new Xilinx chip series in workstations and PCs easily, a system is presented which synthesizes hardware out of threads coded in C. The threads are part of the C-program running on the host processor. In this paper this system is referred as the Hardware Thread System (HTS). The run time environment required is called the Universal Coprocessor System (UCS). As hardware platform, a specially designed PCI card is used. Besides the reconfigurable coprocessor XC62xx, it consists of the controller (XC4013e) and buffer/data RAM. The RAM of the card can be mapped into the memory address space of the host; nontheless the controller can transfer data between reconfigurable coprocessor and buffer RAM without disturbing the host.","PeriodicalId":309841,"journal":{"name":"Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130529275","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
The NAPA adaptive processing architecture NAPA自适应处理体系结构
Charlé R. Rupp, Mark Landguth, T. Garverick, Edson Gomersall, H. Holt, J. Arnold, M. Gokhale
{"title":"The NAPA adaptive processing architecture","authors":"Charlé R. Rupp, Mark Landguth, T. Garverick, Edson Gomersall, H. Holt, J. Arnold, M. Gokhale","doi":"10.1109/FPGA.1998.707878","DOIUrl":"https://doi.org/10.1109/FPGA.1998.707878","url":null,"abstract":"The National Adaptive Processing Architecture (NAPA) is a major effort to integrate the resources needed to develop teraops class computing systems based on the principles of adaptive computing. The primary goals for this effort include: (1) the development of an example NAPA component which achieves an order of magnitude cost/performance improvement compared to traditional FPGA based systems, (2) the creation of a rich but effective application development environment for NAPA systems based on the ideas of compile time functional partitioning and (3) significantly improve the base infrastructure for effective research in reconfigurable computing. This paper emphasizes the technical aspects of the architecture to achieve the first goal while illustrating key architectural concepts motivated by the second and third goals.","PeriodicalId":309841,"journal":{"name":"Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131249711","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}
引用次数: 168
The systolic array genetic algorithm, an example of systolic arrays as a reconfigurable design methodology 收缩阵列遗传算法,收缩阵列作为可重构设计方法的一个例子
I. Bland, G. Megson
{"title":"The systolic array genetic algorithm, an example of systolic arrays as a reconfigurable design methodology","authors":"I. Bland, G. Megson","doi":"10.1109/FPGA.1998.707907","DOIUrl":"https://doi.org/10.1109/FPGA.1998.707907","url":null,"abstract":"We have designed and constructed a genetic algorithm engine using a systolic design methodology. The approach has a number of advantages. Firstly the design processes is systematic. A C source code version of the algorithm is used as a starting point and progressively the code is re-written into a form from where systolic cells can be designed. Secondly the modular nature of the arrays allow easy expansion of the design for different requirements (larger populations in this example). Hardware designs are re-used extensively and, in combination with reconfigurable computing techniques, can be swapped in or out on an application specific basis to construct arrays of the correct size. This can also be extended to swapping in and out whole elements of the macro-pipeline so that alternative operators, such as Tournament Selection can be employed. Thirdly, a traditional benefit of systolic arrays applies. The resultant design is massively parallel and significant throughput can be achieved.","PeriodicalId":309841,"journal":{"name":"Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124833726","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}
引用次数: 26
Configuration compression for the Xilinx XC6200 FPGA Xilinx XC6200 FPGA的配置压缩
S. Hauck, Zhiyuan Li, E. Schwabe
{"title":"Configuration compression for the Xilinx XC6200 FPGA","authors":"S. Hauck, Zhiyuan Li, E. Schwabe","doi":"10.1109/FPGA.1998.707891","DOIUrl":"https://doi.org/10.1109/FPGA.1998.707891","url":null,"abstract":"One of the major overheads in reconfigurable computing is the time it takes to reconfigure the devices in the system. This overhead limits the speedups possible in this exciting new paradigm. In this paper we explore one technique for reducing this overhead: the compression of configuration datastreams. We develop an algorithm, targeted to the decompression hardware imbedded in the Xilinx XC6200 series FPGA architecture, that can radically reduce the amount of data needed to transfer during reconfiguration. This results in an overall reduction of almost 4 in total bandwidth required for reconfiguration.","PeriodicalId":309841,"journal":{"name":"Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251)","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114563576","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}
引用次数: 150
Dynamic reconfiguration to support concurrent applications 动态重新配置以支持并发应用程序
Jack S. N. Jean, K. Tomko, Vikram Yavagal, J. Shah, Robert Cook
{"title":"Dynamic reconfiguration to support concurrent applications","authors":"Jack S. N. Jean, K. Tomko, Vikram Yavagal, J. Shah, Robert Cook","doi":"10.1109/FPGA.1998.707926","DOIUrl":"https://doi.org/10.1109/FPGA.1998.707926","url":null,"abstract":"The proposed dynamically reconfigurable system can support multiple applications running concurrently. An FPGA resource manager is developed to allocate and de-allocate FPGA resources and to pre-load FPGA configuration files. For each individual application, different tasks that require FPGA resources are represented as a flow graph which is made available to the resource manager so as to enable efficient resource management and pre-loading. The impact of supporting concurrency and pre-loading in reducing application execution time is demonstrated.","PeriodicalId":309841,"journal":{"name":"Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123991998","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}
引用次数: 71
Frequency-domain sonar processing in FPGAs and DSPs fpga和dsp中的频域声纳处理
P. Graham, B. Nelson
{"title":"Frequency-domain sonar processing in FPGAs and DSPs","authors":"P. Graham, B. Nelson","doi":"10.1109/FPGA.1998.707928","DOIUrl":"https://doi.org/10.1109/FPGA.1998.707928","url":null,"abstract":"Beamforming is a spatial filtering operation performed on data received by an array of sensors, such as antennas, microphones, or hydrophones. It provides a system with the ability to \"listen\" directionally even when the individual sensors in the array are omnidirectional. Over the past year we have been exploring the use of FPGA based custom computing machines for several sonar beamforming applications, including time domain beamforming (P. Graham nd B. Nelson, 1998), frequency domain beamforming, and matched field processing. In many ways sonar processing fits the criteria found by W. Mangione-Smith and B. Hutchings (1997) for good FPGA applications-the computations are data parallel, they require little control, the data sets are large (infinite streams), and the raw sensor data is at most 12 bits. However, they have three characteristics which make them challenging. First, they involve intensive arithmetic (multiply accumulates and trigonometric functions) on real and/or complex data. Second, they require significant memory support, far beyond that indicated in much previously published work. Third, the scale of the computation is large, requiring (possibly) hundreds of FPGAs and high bandwidth interconnections to meet real time constraints. We address the first issue.","PeriodicalId":309841,"journal":{"name":"Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126642310","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
Architecture and design of GE1, an FCCM for Golomb ruler derivation 用于Golomb标尺推导的FCCM GE1的结构与设计
A. Dollas, E. Sotiriades, Apostolos Emmanouelides
{"title":"Architecture and design of GE1, an FCCM for Golomb ruler derivation","authors":"A. Dollas, E. Sotiriades, Apostolos Emmanouelides","doi":"10.1109/FPGA.1998.707880","DOIUrl":"https://doi.org/10.1109/FPGA.1998.707880","url":null,"abstract":"A new architecture for Golomb ruler derivation has been developed, and an FPGA-based custom compute engine of the new architecture has been fully designed. The new FCCM, called GE1, is presented in terms of its datapath, and control path. Portions of the GE1 have been implemented to verify functional correctness and accuracy of the simulation results. The new machine requires twenty Xilinx 5000 series FPGA's for derivation of the 20 mark Golomb ruler, and its performance is roughly 30 times that of a high-end workstation, making its cost-performance ratio exceptionally good for derivation of new rulers.","PeriodicalId":309841,"journal":{"name":"Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124257627","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
A prototype system for rapid application development using dynamically reconfigurable hardware 一个使用动态可重构硬件进行快速应用开发的原型系统
J. Ferreira, J. S. Matos
{"title":"A prototype system for rapid application development using dynamically reconfigurable hardware","authors":"J. Ferreira, J. S. Matos","doi":"10.1109/FPGA.1998.707916","DOIUrl":"https://doi.org/10.1109/FPGA.1998.707916","url":null,"abstract":"This paper explores ways of enhancing the power of computational systems using dynamically reconfigurable hardware. The overall goal is to create an environment that enables the user, not necessarily a hardware-oriented person, to interactively construct and evaluate different solutions. The emphasis is on rapid development, so that new ideas can be evaluated quickly. In our system, the dynamically reconfigurable hardware acts as a co-processor. Therefore it is important to integrate its operations (both computations and reconfigurations) closely with the rest of the application, even when the sequence of reconfiguration operations depends on the application's actual execution path.","PeriodicalId":309841,"journal":{"name":"Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131759601","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
50 kHz pattern recognition on the large FPGA processor Enable++ 在大型FPGA处理器上实现50 kHz模式识别
A. Kugel, K. Kornmesser, R. Lay, J. Ludvig, R. Männer, K. Noffz, S. Rühl, M. Sessler, H. Simmler, H. Singpiel
{"title":"50 kHz pattern recognition on the large FPGA processor Enable++","authors":"A. Kugel, K. Kornmesser, R. Lay, J. Ludvig, R. Männer, K. Noffz, S. Rühl, M. Sessler, H. Simmler, H. Singpiel","doi":"10.1109/FPGA.1998.707908","DOIUrl":"https://doi.org/10.1109/FPGA.1998.707908","url":null,"abstract":"FPGA processors are very well suited for the implementation of image processing and pattern recognition tasks. This paper describes a particularly demanding application of this type and Enable++, the FPGA processor used. The system finds particle trades in high-energy physics detector images at a rate of 100 kHz. This requires to process a data stream of up to 500 MBytes/s in real time. The algorithm and the implementation on Enable++, a general purpose FPGA processor are described. Results from a software implementation are compared with the measurements from an implementation on the CCM. This implementation is 15 times faster than the software implementation on high end computers.","PeriodicalId":309841,"journal":{"name":"Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133627809","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
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学术官方微信