ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors最新文献

筛选
英文 中文
Modeling and synthesis of communication subsystems for loop accelerator pipelines 环形加速器管道通信子系统建模与综合
H. Dutta, Frank Hannig, Moritz Schmid, J. Keinert
{"title":"Modeling and synthesis of communication subsystems for loop accelerator pipelines","authors":"H. Dutta, Frank Hannig, Moritz Schmid, J. Keinert","doi":"10.1109/ASAP.2010.5540760","DOIUrl":"https://doi.org/10.1109/ASAP.2010.5540760","url":null,"abstract":"The communication synthesis for data transfer and synchronization between loop accelerators is a major challenge in streaming applications. The complexity of the problem arises from the fact that optimal memory mapping and address generation in communication subsystems for parallel data access and out-of-order communication depend on tiling and scheduling choices. This paper solves the problem of communication synthesis by leveraging the windowed synchronous data flow (WSDF) model for communication synthesis. In this context, an intermediate representation of communicating loops in the polyhedral model and a unified methodology for their projection onto the WSDF model is proposed. Finally, we present the architecture template, synthesis methodology, and overhead of the communication primitive.","PeriodicalId":175846,"journal":{"name":"ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125948530","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
ImpEDE: A multidimensional design-space exploration framework for biomedical-implant processors 阻碍:一个多维设计空间探索框架的生物医学植入处理器
D. Dave, C. Strydis, G. Gaydadjiev
{"title":"ImpEDE: A multidimensional design-space exploration framework for biomedical-implant processors","authors":"D. Dave, C. Strydis, G. Gaydadjiev","doi":"10.1109/ASAP.2010.5540809","DOIUrl":"https://doi.org/10.1109/ASAP.2010.5540809","url":null,"abstract":"The demand for biomedical implants keeps increasing. However, most of the current implant design methodologies involve custom-ASIC design. The SiMS project aims to change this process and make implant design more modular, flexible, faster and extensible. The most recent work within the SiMS context provides ImpEDE, a framework based on a multiobjective genetic algorithm, for automatic exploration of the design space of implant processors. The framework provides the processor designer with a Pareto front through which informed decisions can be made about specific implant families after analyzing their particular tradeoffs and requirements. A highly efficient, parallelized version of the genetic algorithm is also used to evolve the front and has as its objectives the optimization of power, performance and area. In addition, we illustrate the extensibility of our framework by modifying it to include a case study of a synthetic implant application with hard realtime deadlines.","PeriodicalId":175846,"journal":{"name":"ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128152284","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
Design space exploration of parametric pipelined designs 参数化流水线设计的设计空间探索
Adrien Le Masle, W. Luk
{"title":"Design space exploration of parametric pipelined designs","authors":"Adrien Le Masle, W. Luk","doi":"10.1109/ASAP.2010.5540815","DOIUrl":"https://doi.org/10.1109/ASAP.2010.5540815","url":null,"abstract":"This paper shows how a general form of algorithms consisting of a loop with loop-carried dependencies of one can be mapped to a parametric hardware design with pipelining and replication features. A technology-independent parametric model of the proposed design is developed to capture the variations of area and throughput with the number of pipeline stages and replications. This model allows rapid optimisation of design parameters by a few pre-synthesis operations. We present an optimisation process based on this model, and apply it to a Montgomery multiplier implementation on a Xilinx XC5VLX50T FPGA. Our approach is shown to be capable of accurately predicting the values of the parameters that maximise the throughput of the multiplier. In particular, up to 6.5 times fewer synthesis operations are required when compared with a complete search through the design space of the multiplier. This would speed up the synthesis process by 14 times, saving more than 23 hours of development time.","PeriodicalId":175846,"journal":{"name":"ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130667537","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 pipelined camellia architecture for compact hardware implementation 一个流水线茶花架构紧凑的硬件实现
E. Kavun, Tolga Yalçin
{"title":"A pipelined camellia architecture for compact hardware implementation","authors":"E. Kavun, Tolga Yalçin","doi":"10.1109/ASAP.2010.5540987","DOIUrl":"https://doi.org/10.1109/ASAP.2010.5540987","url":null,"abstract":"In this paper, we present a compact and fast pipelined implementation of the block cipher Camellia for 128-bit data and 128-bit key lengths. The implementation is suitable for both Field Programmable Gate Array (FPGA) and Application Specific Integrated Circuit (ASIC) platforms, and is targeted for low area and low power applications. To obtain a compact design, pipelining principles are exploited and platform specific optimizations are made. The design requires only 321 slices with a throughput of 32.96 Mbps based on Xilinx Spartan-S XC3S50-5 chip and 4.31K gates with a throughput of 81 Mbps based on 0.13-μm CMOS standard cell library.","PeriodicalId":175846,"journal":{"name":"ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131735258","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
Optimizing DDR-SDRAM communications at C-level for automatically-generated hardware accelerators an experience with the Altera C2H HLS tool 在c级为自动生成的硬件加速器优化DDR-SDRAM通信,体验Altera C2H HLS工具
Christophe Alias, A. Darte, Alexandru Plesco
{"title":"Optimizing DDR-SDRAM communications at C-level for automatically-generated hardware accelerators an experience with the Altera C2H HLS tool","authors":"Christophe Alias, A. Darte, Alexandru Plesco","doi":"10.1109/ASAP.2010.5540967","DOIUrl":"https://doi.org/10.1109/ASAP.2010.5540967","url":null,"abstract":"Thanks to efficient scheduling, resource sharing, and finite-state machines generation, high-level synthesis (HLS) tools are now more mature for generating hardware accelerators with an optimized internal structure. But interfacing them within the complete design, with optimized communications, to achieve the best throughput remains hard. Expert designers still need to program all the necessary glue (in VHDL/Verilog) to get an efficient design. Taking the example of C2H, the Altera HLS tool, and of accelerators communicating to an external DDR memory, we show it is possible to restructure the application code, to generate adequate communication processes, in C, and to compile them all with C2H, so that the resulting application is highly-optimized, with full usage of the memory bandwidth. In other words, our study demonstrates that HLS tools can be used as back-end optimizers for front-end optimizations, as it is the case for standard compilation with high-level transformations developed on top of assembly-code optimizers. We believe this is the way to go for making HLS tools viable.","PeriodicalId":175846,"journal":{"name":"ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134471173","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
Comparing the robustness of fault-tolerant enhancements when applied to lookup tables and random logic for nano-computing 比较应用于查找表和纳米计算的随机逻辑时容错增强的健壮性
Y. Dotan, Orgad Chen, Gil Katz
{"title":"Comparing the robustness of fault-tolerant enhancements when applied to lookup tables and random logic for nano-computing","authors":"Y. Dotan, Orgad Chen, Gil Katz","doi":"10.1109/ASAP.2010.5540775","DOIUrl":"https://doi.org/10.1109/ASAP.2010.5540775","url":null,"abstract":"New challenges are arising in the design of computer systems with the emergence of new nanometer-scale devices and sophisticated fabrication techniques. Unfortunately, the yield, reliability, and drive characteristics of these new deep-submicron and nano-scale devices are different from the corresponding characteristics of conventional CMOS devices. It is expected that future circuit technologies will have substantially higher defect densities and dynamic fault rates. There is no consensus yet on which technology will be selected and which of the traditional logic designs has an advantage for fault tolerant nano-computing. In this work, we compare the robustness of several fault-tolerant approaches applied to lookup table design and random logic design for a wide range of fault rates. Implementing fault tolerance in a circuit using TMR and Hamming and Hsiao error correcting codes with a lookup table design style gives better fault coverage compared with a random gate design style. TMR is the best fault-tolerance technique when implemented using the lookup table design. However, TMR was the worst technique for fault rates greater than 0.5% when implemented using random logic design and no gate level is fault free.","PeriodicalId":175846,"journal":{"name":"ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134490871","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
Power dissipation challenges in multicore floating-point units 多核浮点单元的功耗挑战
Wei Liu, A. Nannarelli
{"title":"Power dissipation challenges in multicore floating-point units","authors":"Wei Liu, A. Nannarelli","doi":"10.1109/ASAP.2010.5540986","DOIUrl":"https://doi.org/10.1109/ASAP.2010.5540986","url":null,"abstract":"With increased densities on chips and the growing popularity of multicore processors and general-purpose graphics processing units (GPGPUs) power dissipation and energy consumption pose a serious challenge in the design of system-on-chips (SoCs) and a rise in costs for heat removal. In this work, we analyze the impact of power dissipation in floating-point (FP) units and we consider different alternatives in the implementation of FP-division that lead to substantial energy savings. We compare the implementation of division in a Fused Multiply-Add (FMA) unit based on the Newton-Raphson approximation algorithm to the implementation in a dedicated digit-recurrence unit. The results show a significant reduction of energy in a typical scientific application when the division digit-recurrence unit is used. In addition, we model the thermal behavior of the considered FP-units.","PeriodicalId":175846,"journal":{"name":"ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117117767","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
Potential of using block floating point arithmetic in ASIP-based GNSS-receivers 在基于ip的gnss接收机中使用块浮点算法的潜力
E. Tasdemir, G. Kappen, T. Noll
{"title":"Potential of using block floating point arithmetic in ASIP-based GNSS-receivers","authors":"E. Tasdemir, G. Kappen, T. Noll","doi":"10.1109/ASAP.2010.5540988","DOIUrl":"https://doi.org/10.1109/ASAP.2010.5540988","url":null,"abstract":"As an alternative to floating point and fixed point arithmetics, block floating point arithmetic offers a compromise between computational accuracy and hardware complexity. Nevertheless, today practical applications are limited to Fast Fourier Transformation and digital filters. This work uses the block floating point format to realize the position estimation algorithm in Global Navigation Satellite System (GNSS) receivers, which is based on the Newton-Rhapson method. The precision of this novel approach is quantified by extensive simulations using synthetic as well as real GNSS data. The implementation of the position estimation algorithm using block floating point format on an application specific processor is introduced and compared to implementations on a standard embedded processor and in standard floating point arithmetic in terms of performance and costs.","PeriodicalId":175846,"journal":{"name":"ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123426626","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
A C++-embedded Domain-Specific Language for programming the MORA soft processor array 一种用于MORA软处理器阵列编程的c++嵌入式领域特定语言
W. Vanderbauwhede, M. Margala, S. R. Chalamalasetti, Sohan Purohit
{"title":"A C++-embedded Domain-Specific Language for programming the MORA soft processor array","authors":"W. Vanderbauwhede, M. Margala, S. R. Chalamalasetti, Sohan Purohit","doi":"10.1109/ASAP.2010.5540750","DOIUrl":"https://doi.org/10.1109/ASAP.2010.5540750","url":null,"abstract":"MORA is a novel platform for high-level FPGA programming of streaming vector and matrix operations, aimed at multimedia applications. It consists of soft array of pipelined low-complexity SIMD processors-in-memory (PIM). We present a Domain-Specific Language (DSL) for high-level programming of the MORA soft processor array. The DSL is embedded in C++, providing designers with a familiar language framework and the ability to compile designs using a standard compiler for functional testing before generating the FPGA bitstream using the MORA toolchain. The paper discusses the MORA-C++ DSL and the compilation route into the assembly for the MORA machine and provides examples to illustrate the programming model and performance.","PeriodicalId":175846,"journal":{"name":"ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123647264","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
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学术官方微信