SIGARCH Comput. Archit. News最新文献

筛选
英文 中文
PARSEC3.0: A Multicore Benchmark Suite with Network Stacks and SPLASH-2X PARSEC3.0:一个带有网络栈和SPLASH-2X的多核基准测试套件
SIGARCH Comput. Archit. News Pub Date : 2017-02-13 DOI: 10.1145/3053277.3053279
Xusheng Zhan, Yungang Bao, Christian Bienia, Kai Li
{"title":"PARSEC3.0: A Multicore Benchmark Suite with Network Stacks and SPLASH-2X","authors":"Xusheng Zhan, Yungang Bao, Christian Bienia, Kai Li","doi":"10.1145/3053277.3053279","DOIUrl":"https://doi.org/10.1145/3053277.3053279","url":null,"abstract":"Benchmarks play a very important role in accelerating the development and research of CMP. As one of them, the PARSEC suite continues to be updated and revised over and over again so that it can offer better support for researchers. The former versions of PARSEC have enough workloads to evaluate the property of CMP about CPU, cache and memory, but it lacks of applications based on network stack to assess the performance of CMPs in respect of network. In this work, we introduce PARSEC3.0, a new version of PARSEC suite that implements a user-level network stack and generates three network workloads with this stack to cover network domain. We explore the input sets of splash-2 and expand them to multiple scales, a.k.a, splash-2x. We integrate splash-2 and splash-2x into PARSEC framework so that researchers use these benchmark suite conveniently. Finally, we evaluate the u-TCP/IP stack and new network workloads, and analyze the characterizes of splash-2 and splash-2x","PeriodicalId":448522,"journal":{"name":"SIGARCH Comput. Archit. News","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116505747","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}
引用次数: 51
Neural Network Based Reinforcement Learning Acceleration on FPGA Platforms
SIGARCH Comput. Archit. News Pub Date : 2017-01-11 DOI: 10.1145/3039902.3039915
Jiang Su, Jianxiong Liu, David B. Thomas, P. Cheung
{"title":"Neural Network Based Reinforcement Learning Acceleration on FPGA Platforms","authors":"Jiang Su, Jianxiong Liu, David B. Thomas, P. Cheung","doi":"10.1145/3039902.3039915","DOIUrl":"https://doi.org/10.1145/3039902.3039915","url":null,"abstract":"Deep Q-learning (DQN) is a recently proposed reinforcement learning algorithm where a neural network is applied as a non-linear approximator to its value function. The exploitation-exploration mechanism allows the training and prediction of the NN to execute simultaneously in an agent during its interaction with the environment. Agents often act independently on battery power, so the training and prediction must occur within the agent and on a limited power budget. In this work, We propose an FPGA acceleration system design for Neural Network Q-learning (NNQL). Our proposed system has high flexibility due to the support to run-time network parameterization, which allows neuroevolution algorithms to dynamically restructure the network to achieve better learning results. Additionally, the power consumption of our proposed system is adaptive to the network size because of a new processing element design. Based on our test cases on networks with hidden layer size ranging from 32 to 16384, our proposed system achieves 7x to 346x speedup compared to GPU implementation and 22x to 77x speedup to hand-coded CPU counterpart.","PeriodicalId":448522,"journal":{"name":"SIGARCH Comput. Archit. News","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115732424","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}
引用次数: 33
Cost-Effective and High-Throughput Merge Network: Architecture for the Fastest FPGA Sorting Accelerator 具有成本效益和高吞吐量的合并网络:用于最快FPGA排序加速器的架构
SIGARCH Comput. Archit. News Pub Date : 2017-01-11 DOI: 10.1145/3039902.3039905
Susumu Mashimo, Thiem Van Chu, Kenji Kise
{"title":"Cost-Effective and High-Throughput Merge Network: Architecture for the Fastest FPGA Sorting Accelerator","authors":"Susumu Mashimo, Thiem Van Chu, Kenji Kise","doi":"10.1145/3039902.3039905","DOIUrl":"https://doi.org/10.1145/3039902.3039905","url":null,"abstract":"High-performance sorting is used in various areas such as database transactions and genomic feature operations. To improve sorting performance, in addition to the conventional approach of using general purpose processors or GPUs, the approach of using FPGAs is becoming a promising solution. As an FPGA sorting accelerator, Casper and Olukotun have recently proposed the fastest one known so far. In their study, they proposed a merge network which can merge two sorted data series at a throughput of 6 data elements per 200MHz clock cycle.\u0000 If an FPGA sorting accelerator is constructed using merge networks, the overall throughput will be mainly determined by the throughputs of the merge networks. This motivates us to design a merge network which outputs more than 6 data elements per 200MHz clock cycle. In this paper, we propose a cost-effective and high-throughput merge network for the fastest FPGA sorting accelerator. The evaluation shows that our proposal achieves a throughput of 8 data elements per 200MHz clock cycle.","PeriodicalId":448522,"journal":{"name":"SIGARCH Comput. Archit. News","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116243214","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
An FFT Circuit for a Spectrometer of a Radio Telescope using the Nested RNS including the Constant Division 射电望远镜分光仪用包含常数除法的嵌套RNS的FFT电路
SIGARCH Comput. Archit. News Pub Date : 2017-01-11 DOI: 10.1145/3039902.3039911
Hiroki Nakahara, H. Nakanishi, K. Iwai, Tsutomu Sasao
{"title":"An FFT Circuit for a Spectrometer of a Radio Telescope using the Nested RNS including the Constant Division","authors":"Hiroki Nakahara, H. Nakanishi, K. Iwai, Tsutomu Sasao","doi":"10.1145/3039902.3039911","DOIUrl":"https://doi.org/10.1145/3039902.3039911","url":null,"abstract":"A radio telescope analyzes radio frequency (RF) received from celestial objects. It consists of an antenna, a receiver, and a spectrometer. The spectrometer converts the time domain into the frequency domain by an FFT operation. This paper applies an FFT circuit based on nested residue number system (NRNS), which recursively decompose the RNS. It can decompose the MAC unit into circuits with small sizes. In the FFT using the NRNS, a MAC unit is decomposed into 4-bit ones realized by look-up tables of the FPGA. Also, to realize the scaling (truncation) circuit, we propose a constant division algorithm on the FPGA. The truncation is realized by the division of a dynamic range for a subset of moduli. We implemented the proposed NRNS FFT on the Xilinx Inc. Virtex 6 FPGA. Compared with a Xilinx Inc. binary FFT library, although the number of block RAMs (BRAMs) was increased by 38%, in the RNS FFT, the number of LUTs was decreased by 42-45% and the maximum clock frequency was increased by 38-74%. With this technique, we successfully implemented an FFT that satisfied the required size and speed specifications on an available FPGA, since the excessive number of LUTs was the bottleneck of the binary FFT.","PeriodicalId":448522,"journal":{"name":"SIGARCH Comput. Archit. News","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132766871","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
An Efficient GPUAccelerated Implementation of Genomic Short Read Mapping with BWAMEM 基于BWAMEM的基因组短读映射的高效gpu加速实现
SIGARCH Comput. Archit. News Pub Date : 2017-01-11 DOI: 10.1145/3039902.3039910
Ernst Houtgast, V. Sima, K. Bertels, Z. Al-Ars
{"title":"An Efficient GPUAccelerated Implementation of Genomic Short Read Mapping with BWAMEM","authors":"Ernst Houtgast, V. Sima, K. Bertels, Z. Al-Ars","doi":"10.1145/3039902.3039910","DOIUrl":"https://doi.org/10.1145/3039902.3039910","url":null,"abstract":"Next Generation Sequencing techniques have resulted in an exponential growth in the generation of genetics data, the amount of which will soon rival, if not overtake, other Big Data fields, such as astronomy and streaming video services. To become useful, this data requires processing by a complex pipeline of algorithms, taking multiple days even on large clusters. The mapping stage of such genomics pipelines, which maps the short reads onto a reference genome, takes up a significant portion of execution time. BWA-MEM is the de-facto industry-standard for the mapping stage.\u0000 Here, a GPU-accelerated implementation of BWA-MEM is proposed. The Seed Extension phase, one of the three main BWA-MEM algorithm phases that requires between 30%-50% of overall processing time, is offloaded onto the GPU. A thorough design space analysis is presented for an optimized mapping of this phase onto the GPU. The re- sulting systolic-array based implementation obtains a two- fold overall application-level speedup, which is the maximum theoretically achievable speedup. Moreover, this speedup is sustained for systems with up to twenty-two logical cores. Based on the findings, a number of suggestions are made to improve GPU architecture, resulting in potentially greatly increased performance for bioinformatics-class algorithms.","PeriodicalId":448522,"journal":{"name":"SIGARCH Comput. Archit. News","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131279654","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}
引用次数: 9
Effects of Stacking Granularity on 3-D Stacked Floating-point Fused Multiply Add Units 堆积粒度对三维浮点融合乘加单元堆积的影响
SIGARCH Comput. Archit. News Pub Date : 2017-01-11 DOI: 10.1145/3039902.3039914
J. Tada, M. Hosokawa, Ryusuke Egawa, Hiroaki Kobayashi
{"title":"Effects of Stacking Granularity on 3-D Stacked Floating-point Fused Multiply Add Units","authors":"J. Tada, M. Hosokawa, Ryusuke Egawa, Hiroaki Kobayashi","doi":"10.1145/3039902.3039914","DOIUrl":"https://doi.org/10.1145/3039902.3039914","url":null,"abstract":"Three-dimensional stacked integrated circuits (3D-SICs) have been expected to overcome the limitations of conventional two-dimensional (2-D) implemented circuits. Since a stacking strategy affects the performance and the power consumption of 3D-SICs, this paper examines two stacking strategies for designing the 3-D stacked floating-point fused multiplyadd (FP-FMA) module which contains four FP-FMA units. Experimental results show that a coarse-grain stacking strategy is suitable for reducing critical path delay of the 3-D stacked FP-FMA module. On the other hand, a fine-grain stacking strategy is suitable for reducing power consumption. The 3-D stacked FP-FMA module which is designed based on a fine-grain stacking strategy achieves an 8.4% critical path delay reduction and an 18% average power reduction compared with the 2-D implementation.","PeriodicalId":448522,"journal":{"name":"SIGARCH Comput. Archit. News","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121827287","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
FPGA High-level Synthesis versus Overlay: Comparisons on Computation Kernels FPGA高级综合与叠加:计算核的比较
SIGARCH Comput. Archit. News Pub Date : 2017-01-11 DOI: 10.1145/3039902.3039919
C. Y. Lin, Zhenghong Jiang, Cheng Fu, Hayden Kwok-Hay So, Haigang Yang
{"title":"FPGA High-level Synthesis versus Overlay: Comparisons on Computation Kernels","authors":"C. Y. Lin, Zhenghong Jiang, Cheng Fu, Hayden Kwok-Hay So, Haigang Yang","doi":"10.1145/3039902.3039919","DOIUrl":"https://doi.org/10.1145/3039902.3039919","url":null,"abstract":"To promote FPGA to a wider user community and to increase design productivity, two new design methodologies, namely FPGA high-level synthesis (HLS) and FPGA overlay, are presented to use a high-level design abstraction. To make clear distinguish features of each design methodology, we make an comparison of a state-of-the-art FPGA HLS tool, Vivado HLS, and an FPGA overlay tool, ArchSyn, on two computation intensive kernels, matrix-matrix multiplication and fast Fourier transform.\u0000 In the comparison, FPGA overlay shows an overwhelming superiority in computation performance, which is 8X to 39X faster than FPGA HLS. However, FPGA HLS exhibits its advantages in dynamic power consumption metric. It achieves up to 17X lower power consumption than FPGA overlay. Power- and energy-efficiency are another two essential metrics evaluating trade-offs between performance and power consumption. As demonstrated with evaluation results, FPGA overlay is averagely 3.5X better in powerefficiency for FFT kernel, and achieves up to 2 orders of magnitude better energy-efficiency than FPGA HLS.","PeriodicalId":448522,"journal":{"name":"SIGARCH Comput. Archit. News","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125386369","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}
引用次数: 7
A Study of Heterogeneous Computing Design Method based on Virtualization Technology 基于虚拟化技术的异构计算设计方法研究
SIGARCH Comput. Archit. News Pub Date : 2017-01-11 DOI: 10.1145/3039902.3039918
Qian Zhao, M. Amagasaki, M. Iida, M. Kuga, T. Sueyoshi
{"title":"A Study of Heterogeneous Computing Design Method based on Virtualization Technology","authors":"Qian Zhao, M. Amagasaki, M. Iida, M. Kuga, T. Sueyoshi","doi":"10.1145/3039902.3039918","DOIUrl":"https://doi.org/10.1145/3039902.3039918","url":null,"abstract":"One challenge for the heterogeneous computing with the FPGA is how to bridge the development gap between SW and HW designs. The high level synthesis (HLS) technique allows producing hardware with high level languages like C. Design tools based on the HLS like Xilinx SDSoC and SDAccel are developed to speedup SW/HW co-designs. However, the developers still require much circuit design skills to use these tools more efficiently. In this paper, we propose a heterogeneous computing platform based on the virtualization technology, namely hCODE.With the help of the virtualization, the HW and SW design can be totally separated. This brings multiple benefits like accelerating a program without modifying or recompiling it, enable high portability and scalability across different HW and operating system.","PeriodicalId":448522,"journal":{"name":"SIGARCH Comput. Archit. News","volume":"331 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130358715","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}
引用次数: 7
High-Level Synthesis Optimization for Blocked Floating-Point Matrix Multiplication 阻塞浮点矩阵乘法的高级综合优化
SIGARCH Comput. Archit. News Pub Date : 2017-01-11 DOI: 10.1145/3039902.3039916
E. D'Hollander
{"title":"High-Level Synthesis Optimization for Blocked Floating-Point Matrix Multiplication","authors":"E. D'Hollander","doi":"10.1145/3039902.3039916","DOIUrl":"https://doi.org/10.1145/3039902.3039916","url":null,"abstract":"In the last decade floating-point matrix multiplication on FPGAs has been studied extensively and efficient architectures as well as detailed performance models have been developed. By design these IP cores take a fixed footprint which not necessarily optimizes the use of all available resources. Moreover, the low-level architectures are not easily amenable to a parameterized synthesis. In this paper high-level synthesis is used to fine-tune the configuration parameters in order to achieve the highest performance with maximal resource utilization. An exploration strategy is presented to optimize the use of critical resources (DSPs, memory) for any given FPGA. To account for the limited memory size on the FPGA, a blockoriented matrix multiplication is organized such that the block summation is done on the CPU while the block multiplication occurs on the logic fabric simultaneously. The communication overhead between the CPU and the FPGA is minimized by streaming the blocks in a Gray code ordering scheme which maximizes the data reuse for consecutive block matrix product calculations. Using highlevel synthesis optimization, the programmable logic operates at 93% of the theoretical peak performance and the combined CPU-FPGA design achieves 76% of the available hardware processing speed for the floating-point multiplication of 2K by 2K matrices.","PeriodicalId":448522,"journal":{"name":"SIGARCH Comput. Archit. News","volume":"368 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130962584","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
Migration of long-running Tasks between Reconfigurable Resources using Virtualization 使用虚拟化在可重构资源之间迁移长时间运行的任务
SIGARCH Comput. Archit. News Pub Date : 2017-01-11 DOI: 10.1145/3039902.3039913
Oliver Knodel, P. Genssler, R. Spallek
{"title":"Migration of long-running Tasks between Reconfigurable Resources using Virtualization","authors":"Oliver Knodel, P. Genssler, R. Spallek","doi":"10.1145/3039902.3039913","DOIUrl":"https://doi.org/10.1145/3039902.3039913","url":null,"abstract":"Computing performance and scalability are the essential basics in modern data centres. Field Programmable Gate Arrays (FPGAs) provide a promising opportunity to improve performance, security and energy efficiency. Especially background acceleration of computationally complex and long-running tasks is an important field of application. A flexible use of reconfigurable devices within a cloud context requires an abstraction of the actual hardware through virtualization.\u0000 In this paper we present an approach inspired by paravirtualized machines for the integration of reconfigurable hardware into cloud services. Using partial reconfiguration our hardware and software framework virtualizes a single physical FPGA to enable multiple independent user designs. Essential components are the management of those virtual user-defined accelerators (vFPGA) and their migration between physical FPGAs to achieve higher system-wide utilization. The migration requires saving and restoring the internal state or context of the vFPGA. We demonstrate the application possibilities and the resource trade-off of our approach by transferring a running design from one physical FPGA to another. Moreover, we present future perspectives for the use of FPGAs in cloud-based environments.","PeriodicalId":448522,"journal":{"name":"SIGARCH Comput. Archit. News","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132931594","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}
引用次数: 20
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学术官方微信
小红书