检索结果-内蒙古大学图书馆

processor array design with FPGA area constraint

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1999年第3期18卷 253-264页

作者： Fernando, JA Jean, JSN Systran Fed Corp Dayton OH 45432 USA Wright State Univ Dept Comp Sci & Engn Dayton OH 45435 USA

Digital signal processing algorithms with multiple shift-invariant dependence graphs (DG's) can be mapped to field programmable gate array hardware in many different types of systolic processor arrays, Because of the finite amount of hardware resources, the problem is to use a "right" amount of hardware in a specific configuration so to maximize the processing speed. In this paper, the problem of finding the right processor array configuration is formulated as a constrained optimization problem where the cost function includes not only the cost of individual processor arrays but also the cost of interfacing circuits. Three heuristic algorithms are presented for the optimization problem, Among them, both the Lth axial neighbor algorithm and the simulated annealing algorithm produce good results on a test case. Simulation results on the test case also indicate that the initial configuration is important in getting a good configuration for both algorithms. The Lth axial neighbor algorithm has the extra advantage of requiring less amount of performance tuning.

关键词： algorithm mapping computer-aided design dependence graph field programmable gate array (FPGA) processor array systolic array

来源：评论

学校读者我要写书评

暂无评论

processor array architectures for deep packet classification

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2006年第3期17卷 241-252页

作者： Gebali, F Rafiq, ANME Univ Victoria Dept Elect & Comp Engn Victoria BC V8W 3P6 Canada

This paper presents a systematic technique for expressing a string search algorithm as a regular iterative expression to explore all possible processor arrays for deep packet classification. The computation domain of the algorithm is obtained and three affine scheduling functions are presented. The technique allows some of the algorithm variables to be pipelined while others are broadcast over system-wide buses. Nine possible processor array structures are obtained and analyzed in terms of speed, area, power, and I/O timing requirements. Time complexities are derived analytically and through extensive numerical simulations. The proposed designs exhibit optimum speed and area complexities. The processor arrays are compared with previously derived processor arrays for the string matching problem.

关键词： processor array string search deep packet classification parallel hardware

来源：评论

学校读者我要写书评

暂无评论

processor array Architectures for Scalable Radix 4 Montgomery Modular Multiplication Algorithm

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2011年第7期22卷 1142-1149页

作者： Ibrahim, Atef Gebali, Fayez Elsimary, Hamed Nassar, Amin Elect Res Inst Dept Microelect Cairo 12622 Egypt Univ Victoria Dept Elect & Comp Engn Victoria BC V8W 3P6 Canada Cairo Univ Elect & Elect Commun Dept Cairo 12613 Egypt

This paper presents a systematic methodology for exploring possible processor arrays of scalable radix 4 modular Montgomery multiplication algorithm. In this methodology, the algorithm is first expressed as a regular iterative expression, then the algorithm data dependence graph and a suitable affine scheduling function are obtained. Four possible processor arrays are obtained and analyzed in terms of speed, area, and power consumption. To reduce power consumption, we applied low power techniques for reducing the glitches and the Expected Switching Activity (ESA) of high fan-out signals in our processor array architectures. The resulting processor arrays are compared to other efficient ones in terms of area, speed, and power consumption.

关键词： processor array Montgomery multiplication scalability cryptography secure communications low power modular multipliers

来源：评论

学校读者我要写书评

暂无评论

Scalable energy-efficient parallel sorting on a fine-grained many-core processor array

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2020年 138卷 32-47页

作者： Stillmaker, Aaron Bohnenstiehl, Brent Stillmaker, Lucas Baas, Bevan Univ Calif Davis Elect & Comp Engn Dept One Shields Ave Davis CA 95616 USA Calif State Univ Elect & Comp Engn Dept Fresno 2320 E San Ramon Ave Fresno CA 93740 USA

Three parallel sorting applications and two list output protocols for the first phase of an external sort execute on a fine-grained many-core processor array that contains no algorithm-specific hardware acting as a co-processor with a variety of array sizes. Results are generated using a cycle-accurate model based on measured data from a fabricated many-core chip, and simulated for different processor array sizes. The data shows most energy efficient first-phase many-core sort requires over 65x lower energy than GNU C++ standard library sort performed on an Intel laptop-class processor and over 105x lower energy than a radix sort running on an Nvidia GPU. In addition, the highest first-phase throughput many-core sort is over 9.8x faster than the std::sort and over 14x faster than the radix sort. Both phases of a 10 GB external sort require 6.2x lower energyx time energy delay product than the std::sort and over 13x lower energyx time than the radix sort. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Parallel processing External sorting Scalable sorting Fine-grained many-core processor array

来源：评论

学校读者我要写书评

暂无评论

PARALLEL FFT ALGORITHMS USING RADIX-4 BUTTERFLY COMPUTATION ON AN 8-NEIGHBOR processor array

引用

PARALLEL COMPUTING 1995年第1期21卷 121-136页

作者： TANNO, K TAKETA, T HORIGUCHI, S JAPAN ADV INST SCI & TECHNOL SCH INFORMAT SCITATUNOKUCHIISHIKAWA 92312JAPAN

Fast Fourier transform (FFT), which has wide and variety application areas, requires very high speed computation. Since parallel processing of FFT is very attractive for high speed FFT computation, many processor arrays and multiprocessor systems have been proposed with efficient FFT algorithms. As a result of the recent development of VLSI technology, several massively parallel computers have been implemented on commercial basis. The MasPar, which is one of the SIMD type massively parallel computers, consists of an eight-neighbor processor array. This paper discusses parallel 1-D FFT algorithms on an eight-neighbor processor array. We propose three algorithms according to various data allocation methods. Then we estimate and evaluate their processing time. With the number of processors N = N(r) x N(r), processing time is estimated to be 2(N(r) - 2)t(c) + (log2N(r))t(b), where t(c) is the communication time between neighbor processors, and t(b) is the execution time for the radix 4 butterfly computation. We also compare these algorithms with the conventional radix 2 FFT algorithm implemented on a mesh processor array. It is shown that the radix 4 FFT algorithms are faster than the radix 2 algorithms. These algorithms get high speed FFT computation by combining the radix 4 FFT algorithm with the characteristics of the eight-neighbor processor array.

关键词： FAST FOURIER TRANSFORM MASSIVELY PARALLEL COMPUTERS SIMD processor array PARALLEL ALGORITHM

来源：评论

学校读者我要写书评

暂无评论

Designing a scalable processor array for recurrent computations

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1997年第8期8卷 840-856页

作者： Ganapathy, KN Wah, BW Li, CW UNIV ILLINOIS COORDINATED SCI LAB URBANA IL 61801 USA

In this paper, we study the design of a coprocessor (CoP) to execute efficiently recursive algorithms with uniform dependencies. Our design is based on two objectives: 1) fixed bandwidth to main memory (MM) and 2) scalability to higher performance without increasing MM bandwidth. Our CoP has an access unit (AU) organized as multiple queues, a processor array (PA) with regularly connected processing elements (PEs), and input/output networks for data routing. Our design is unique because it addresses input/output bottleneck and scalability, two of the most important issues in integrating processor arrays in current systems. To allow processor arrays to be widely usable, they must be scalable to high performance with little or no impact on the supporting memory system. The use of multiple queues in AU also eliminates the use of explicit data addresses, thereby simplifying the design of the control program. We present a mapping algorithm that partitions a data dependence graph (DG) of an application into regular blocks, sequences the blocks through AU, and schedules the execution of the blacks, one at a time, on PA. We show that our mapping procedure minimizes the amount of communication between blocks in the partitioned DG, and sequences the blocks through AU to reduce the communication between AU and MM. Using the matrix-product and transitive-closure applications, we study design trade-offs involving 1) division of a fixed chip area between PA and AU, and 2) improvements in speedup with respect to increases in chip area. Our results show, for a fixed chip area, 1) that there is little degradation in throughput in using it linear PA as compared to a PA organized as a square mesh, and 2) that the design is not sensitive to the division of chip area between PA and AU. We further show that, for a fixed throughput, there is an inverse square root relationship between speedup and total chip area. Our study demonstrates the feasibility of a low-cost, memory bandwidth-limite

关键词： access unit affine dependencies area index clock-rate reduction dependence graph memory bandwidth multimesh graph partitioning processor array scheduling uniform dependencies

来源：评论

学校读者我要写书评

暂无评论

processor array SELF-RECONFIGURATION BY NEURAL NETWORKS

PROCESSOR ARRAY SELF-RECONFIGURATION BY NEURAL NETWORKS

引用

INTERNATIONAL CONF ON WAFER SCALE INTEGRATION

作者： YIH, JS MAZUMDER, P

来源：评论

学校读者我要写书评

暂无评论

A low-area, high-speed, processor array architecture for field ALU over GF (2^m)

A low-area, high-speed, processor array architecture for fie...

引用

ITI 5th International Conference on Information and Communications Technology

作者： Fayed, M. El-Kharashi, M. Watheq Gebali, F. Univ Victoria Dept Elect & Comp Engn Victoria BC V8W 3P6 Canada Mentor Graph Egypt Cairo 11341 Egypt

ISBN: (纸本)9781424414307

We propose a novel, low-area, high-speed architecture for the basic operations over GF(2(m)). The proposed architecture is a processor array based, which utilizes the most significant bit multiplication algorithm and polynomial basis. A design space exploration to optimize the area and speed of the proposed architecture was done. We use the National Institute of Standard and Technology recommended polynomials, which makes our design secure and more suitable for cryptographic applications. The proposed architecture is implemented for m is an element of {163,283,571} on a Xilinx XC2V4000 device to verify its functionality and measure its performance. We achieve a frequency of 264 MHz, which allows the architecture to calculate GF(2163) multiplication in 640ns and inversion in 14..357 mu s.

关键词： elliptic curve cryptography (ECC) finite or galois field GF(2(m)) GF(2(m)) arithmetic GF(2(m)) inversion GF(2(m)) multiplication GF(2(m)) squaring processor array

来源：评论

学校读者我要写书评

暂无评论

A high-speed, high-radix, processor array architecture for real-time elliptic curve cryptography over GF(2^m)

A high-speed, high-radix, Processor Array architecture for r...

引用

7th IEEE International Symposium on Signal Processing and Information Technology

作者： Fayed, Mohamed A. EI-Kharashi, M. Watheq Gebali, Fayez Univ Victoria Dept Elec & Comp Engn Victoria BC V8W 3P6 Canada Mentor Graphics Egypt Cairo 11341 Egypt

ISBN: (纸本)9781424418343

This paper presents a high-radix elliptic curve cryptographic architecture that performs a scalar multiple of an elliptic curve point operations over GF(2(m)). The proposed architecture is based on a new algorithm, which is a modified version of the sliding window scalar multiplication algorithm. We speed-up the scalar multiplication by merging the point doubling and adding operations into a single step, which decreases the scalar multiplication critical path delay at the expense of a larger Look-Up Table. The proposed architecture utilizes an optimized processor array-based field ALU that efficiently implements addition, squaring, multiplication and division over GF(2(m)). The proposed architecture is implemented for m is an element of {163, 283, 571} on a Xilinx XC4VFX100-12 device. We achieved a frequency of 253 MHz, which allows the architecture to calculate GF (2(163)) scalar multiplication for radix 2(8) in 9 mu s. Our results for GF(2(163)) show a speed-up that ranges from 1.5 to 326 in comparison to previous FPGA implementations and a speed-up ranges from 1.1 to 5.6 in comparison to previous ASIC implementations.

关键词： ALU design elliptic curve cryptography (ECC) processor array public key cryptosystems scalar multiplication

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Energy-Efficient Sorting on a Many-Core processor array

Fine-Grained Energy-Efficient Sorting on a Many-Core Process...

引用

IEEE 18th International Conference on Parallel and Distributed Systems (ICPADS)

作者： Stillmaker, Aaron Stillmaker, Lucas Baas, Bevan Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

ISBN: (纸本)9781467345651;9780769549033

Data centers require significant and growing amounts of power to operate, and with increasing numbers of data centers worldwide, power consumption for enterprise workloads is a significant concern. Sorting is a key computational kernel in large database systems, and the development of energy efficient sorting capabilities would therefore significantly reduce data center power usage. We propose highly parallel sorting algorithms and mappings using a modular design for a fine-grained many-core system that greatly decreases the amount of energy consumed to perform sorts of arbitrarily large data sets. The memory, computational, and nearest-neighbor inter-processor communication hardware of the many-core processor array require relatively small die area. We present the design and implementation of several sorting variants that perform the first phase of an external sort. They are built using program kernels operating on independent processors in a many-core array with 256 bytes of data memory and fewer than 128 instructions per processor. The algorithms employed are simple and the vast majority of processors contain identical programs. Compared to a quicksort implementation on an Intel Core 2 Duo T9600 the highest throughput design achieves up to 27x higher throughput per chip area, and the most energy efficient sort yields a 330x reduction in energy dissipated per sorted block. Compared to a radix sort implementation on a GPU, the highest throughput design achieves up to 22x higher throughput per chip area, and the most energy efficient sort yields a 750x reduction in energy dissipated per sorted block.

关键词： parallel processing external sorting streaming sorting fine-grained many-core processor array modular programing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：