- Research Article
13
- 10.1016/j.micpro.2018.09.002
Performance evaluation of implicit and explicit SIMDization
- Sep 10, 2018
- Microprocessors and Microsystems
- Hossein Amiri + 3 more +3
Performance evaluation of implicit and explicit SIMDization
SIMD programming using Intel vector extensions
Performance evaluation of implicit and explicit SIMDization
Performance evaluation of implicit and explicit SIMDization
A Review of SIMD Multimedia Extensions and their Usage in Scientific and Engineering Applications
The volume and complexity of data processed by today's personal computers are increasing exponentially, placing incredible demands on the microprocessors. In the meantime, computing performance that can be achieved by increasing the clock speed of a microprocessor is reaching to physical limits thus making the architectural solutions more prominent. Due to this an important architectural feature is added to recent microprocessors, single instruction multiple data (SIMD), which is a set of instructions that can speed up an application performance by allowing basic operation to be performed on multiple data elements in parallel with fewer instructions. The SIMD computational technique was introduced in the IA-32 Intel® architecture with MMX technology and then further enhanced with Intel's introduction of streaming SIMD extensions (SSE), SSE 2 (SSE2) and SSE 3 (SSE3). Although programming using these SIMD extensions enables software to achieve higher performance, several exiting scientific applications are not affected. This paper gives an overview of SIMD multimedia extensions. The features of these extensions are introduced. Available methods for programming with multimedia instruction sets are discussed. It also reviews recent trends to use multimedia extensions to accelerate many applications such as multimedia, scientific and engineering applications, and argues for further use in other significant computationally intensive applications.
Read moreInvestigating large integer arithmetic on Intel Xeon Phi SIMD extensions
In this paper, we investigate the Single Instruction Multiple Data (SIMD) extensions of the Intel Xeon Phi, and we analyze the benefits and limitations of its unique architecture in large integer arithmetic applications. The first generation Intel Xeon Phi, named Knights Corner, is a state-of-the-art many core coprocessor with up to 61 cores. Each Knights Corner core has 512-bit SIMD vectors, which are supported by a unique instruction set architecture, incompatible with existing SIMD schemes (SSE, AVX etc.). The second generation Intel Xeon Phi, Knights Landing, will include the standard 512-bit AVX512 SIMD extensions. We implement a multiplication scheme for large integers, which leverages the aforementioned SIMD extensions. Using this multiplication scheme, we discuss the SIMD extensions' performance for both Intel Xeon Phi generations. Preliminary results indicate that the Knights Corner SIMD speedup of large integer multiplication is limited by the absence of specific instructions that typically appear in common SIMD architectures. The emulation on Knights Landing (which includes backwards-compatible AVX512 extensions), on the contrary, shows that large integer multiplication can indeed benefit by the presence of 512-bit vectors, for commonly used 1024- and 2048-bit operands, compared to publicly available large arithmetic libraries.
Read moreEvaluating the Vector Supercomputer SX-Aurora TSUBASA as a Co-Processor for In-Memory Database Systems
In-memory column-store database systems are state of the art for the efficient processing of analytical workloads. In these systems, data compression as well as vectorization play an important role. Currently, the vectorized processing is done using regular SIMD (Single Instruction Multiple Data) extensions of modern processors. For example, Intel’s latest SIMD extension supports 512-bit vector registers which allows the parallel processing of 8× 64-bit values. From a database system perspective, this vectorization technique is not only very interesting for compression and decompression to reduce the computational overhead, but also for all database operators like joins, scan, as well as groupings. In contrast to these SIMD extensions, NEC Corporation has recently introduced a novel pure vector engine (supercomputer) as a co-processor called SX-Aurora TSUBASA. This vector engine features a vector length of 16.384 bits with the world’s highest bandwidth of up to 1.2 TB/s, which perfectly fits to data-intensive applications like in-memory database systems. Therefore, we describe the unique architecture and properties of this novel vector engine in this paper. Moreover, we present selected in-memory column-store-specific evaluation results to show the benefits of this vector engine compared to regular SIMD extensions. Finally, we conclude the paper with an outlook on our ongoing research activities in this direction.
Read moreEvaluation of the Suitability of NEON SIMD Microprocessor Extensions Under Proton Irradiation
This paper analyzes the suitability of single-instruction multiple data (SIMD) extensions of current microprocessors under radiation environments. SIMD extensions are intended for software acceleration, focusing mostly in applications that require high computational effort, which are common in many fields such as computer vision. SIMD extensions use a dedicated coprocessor that makes possible packing several instructions in one single extended instruction. Applications that require high performance could benefit from the use of SIMD coprocessors, but their reliability needs to be studied. In this paper, NEON, the SIMD coprocessor of ARM microprocessors, has been selected as a case study to explore the behavior of SIMD extensions under radiation. Radiation experiments of ARM CORTEX-A9 microprocessors have been accomplished with the objective of determining how the use of this kind of coprocessor can affect the system reliability.
Read moreVectorizing programs with IF-statements for processors with SIMD extensions
Vectorization of programs is crucial for achieving high performance on modern processors with SIMD (Single Instruction Multiple Data) extensions. Programs with IF-statements suffer from control flow divergence that seriously complicates automatic vectorization. Therefore, contemporary compilers employ the IF-conversion approach to convert control flow to data flow, which relies on using predicated execution techniques (i.e., masked or select SIMD instructions). In this paper, we enhance the compiler’s capabilities to generate efficiently vectorized code for processors without masked instructions. We improve the state of the art in program vectorization by developing a novel approach—IF-select transformation—which is applicable to arbitrarily nested IF-statements. We implement our approach in the open-source Open64 compiler and evaluate its performance on the SW26010 processor used in the Sunway TaihuLight supercomputer (currently #3 in the TOP500 list) that does not support masked instructions. We extend our vectorization approach by providing an additional LLVM optimization pass to reduce the amount of masked memory accesses on processors without masked instructions, e.g., IBM Power8 and ARMCortex-A8. Experimental results demonstrate the performance advantages of the suggested vectorization techniques.
Read moreSIMD Implementation of the Aho-Corasick Algorithm using Intel AVX2
The Aho-Corasick (AC) algorithm is a multiple pattern exact string-matching algorithm proposed by Alfred V. Aho and Margaret J. Corasick. It is used to locate all occurrences of a finite set of patterns within an input text simultaneously. The AC algorithm is in the heart of many applications including digital forensics such as digital signatures demonstrating the authenticity of a digital message or document, full text search (utility programs such as grep, awk and sed of Unix systems), information retrieval (biological sequence analysis and gene identification), intrusion detection systems (IDS) in computer networks like SNORT, web filtering, spam filters, and antimalware solutions (virus scanner). In this paper we present a vectorized version of the AC algorithm designed with the use of packed instructions based on the Intel streaming SIMD (Single Instruction Multiple Data) extensions AVX2 (Advanced Vector Extensions 2.0) technology. This paper shows that the vectorized AC algorithm reduces significantly the time matching process comparing to the implementation of the original AC algorithm.
Read moreAccelerating a Software Defined Satnav Receiver using Multiple Parallel Processing Schemes
Satnav SDRs present many benefits in terms of flexibility and configurability. However, due to the high bandwidth signals involved in satnav SDR processing, the software must be highly optimized for the host platform in order to achieve acceptable runtimes. Modules such as sample decoding, carrier replica generation, carrier wipeoff, and correlation are computationally intensive components that benefit from accelerations. An architecture has been developed which allows for the components that must be high performance to be swapped out with versions that make use of accelerators such as FPGAs, GPUs, and vectorized instructions in the CPU (Gunawardena, 2021). Other modules are left in higher level language for ease of use. This differs from some previous projects which do not provide the same level of configurability and granularity that allows for modules to be swapped out without changing code. For the purposes of this paper, we will target general CPUs using Single Instruction Multiple Data (SIMD), multithreading, and bitwise methods. Both SIMD and multithreading accelerations have been previously discussed as applied to sample decoding (Reich et al., 2022). The target system for this paper is x86 64, extended with the Streaming SIMD Extensions (SSE) and Advanced Vector eXtensions (AVX) instruction sets. These 128-bit and 256-bit operations are used in conjunction with bitwise methodologies to perform many operations per instruction in parallel. In addition, these tasks are divided among several threads running concurrently. None of these parallelization techniques are invoked by default and must be specifically written into the program. This paper discusses the process of including these accelerations as well as extensive benchmarking results as compared to a naive C++ implementation. The results of this paper are intended to provide guidance on future optimizations to satnav SDR receivers.
Read moreOptimizing Dynamic Binary Translation for SIMD Instructions
Dynamic binary translation technology allows a program written for one architecture to be executed on a second architecture without recompiling the source code. Effective dynamic binary translation of SIMD (single instruction multiple data) instructions has become more and more important as SIMD extensions have gained popularity among general-purpose CPUs within the last decade. Many SIMD extensions allow an SIMD register to hold data of different types at different times. Supporting multiple data types within the same register complicates the task of a dynamic translator, which may or may not be able to determine the type of the register at translation time. We propose the SIMD data type tracking algorithm to translate the SIMD instructions and three algorithms to further optimize the translation. Our results show that the three optimizing algorithms give overall 3.89% performance improvement for SPEC2K INT benchmarks and 6.61%for SPEC2KFP benchmarks.
Read moreV-PFORDelta: Data Compression for Energy Efficient Computation of Time Series
Chip multiprocessors (CMPs) and heterogeneous architectures have become predominant in all market segments, from embedded to high performance computing. These architectures exacerbate on-chip data requirements, creating additional pressure on the memory subsystem. Consequently, efficient utilization of on-chip memory space becomes critical for data intensive applications. A promising means of addressing this challenge is to use an effective compression method to reduce the data transmitted along the memory hierarchy. In this paper we present V-PFORDelta, a real-time vectorized integer differential compression method for memory bound applications. We evaluate the effectiveness of our SIMD (Single Instruction Multiple Data stream) based compression method on an industrial hydrological time series data processing kernel. We analyzed both Streaming SIMD Extensions (SSE) and Advanced Vector Extensions 2 (AVX2) versions of the compression method. Results show that the performance and energy efficiency can be improved up to a factor of 3.1 and 8.2, respectively. The proposed method not only outperforms the uncompressed SIMD implementations of the hydrological kernel, but also reduces the data storage requirements by a factor of 1.56x to 3.38x, depending on the analyzed dataset.
Read moreSIMD code generation in data-parallel programming
Today';s desktop PCs feature a variety of parallel processing units. Developing applications that exploit this parallelism is a demanding task, and a programmer has to obtain detailed knowledge about the hardware for efficient implementation. CGiS is a data-parallel programming language providing a unified abstraction for two parallel processing units: graphics processing units (GPUs) and the vector processing units of CPUs. The CGiS compiler framework fully virtualizes the differences in capability and accessibility by mapping an abstract data-parallel programming model on those targets. The applicability of CGiS for GPUs has been shown in previous work; this work focuses on applying the abstract programming model of CGiS to CPUs with SIMD (Single Instruction Multiple Data) instruction sets. We have identified, adapted and implemented a set of program analyses to expose and access the available parallelism. The code generation phase is based on selected optimization algorithms tailored to SIMD code generation. Via code generation profiles, it is possible to adapt the code generation strategy to different target architectures. To assess the effectiveness of our approach, we have implemented backends for the two most widespread SIMD instruction sets, namely Intel';s Streaming SIMD Extensions and Freescale';s AltiVec. Additionally, we integrated a prototypical backend for the Cell Broadband Engine as an example for a multi-core architecture. Our experimental results show excellent average performance gains by a factor of 3 compared to standard scalar C++ implementations and underline the viability of this approach: real-world applications can be implemented easily with CGiS and result in efficient code.
Read morePartial Elements Reuse of Vector Register in SIMD Mathematical Functions
In order to achieve high performance in Single Instruction Multiple Data (SIMD) mathematical functions, efficient approach of memory accessing and register reuse is necessary. This paper proposes an optimizing approach of partial elements reuse of vector register (PERVR) in SIMD mathematical functions, which takes advantage of partial elements of vector to reduce register pressure, redundant computation and memory access. In addition, we present implementation to improve the effectiveness of PERVR and analyze the benefits and applicability can be applied in a general Reduced Instruction Set Computing (RISC) architecture with SIMD extensions. The experimental results show that our approach is 14.19% performance improvement on average compared with vector pack/unpack approach (VPU).
Read moreGPP-based design of soft MMSE MIMO detection
General-purpose processor (GPP), which is suitable for software radio processing because of its powerful processing capability and flexibility, has aroused industry-wide attention and exploration. By taking advantage of streaming single instruction multiple data extensions (SSE), this paper presents the GPP-based design of multi-input multi-output (MIMO) detection which is of high complexity in LTE downlink receiver. The performance simulation results illustrate that with dramatically reduced complexity soft minimum mean square error (MMSE) detection is able to approximate ML performance in low signal-to-noise-ratio (SNR), and about 4 dB lose in high SNR. The complexity comparison results show that the implementation of soft MMSE detection in parallel can reduce the processing time by about 86% compared with not in parallel.
Read moreHigh-Performance Elliptic Curve Cryptography: A SIMD Approach to Modern Curves (Thesis Distillation)
Cryptography based on elliptic curves is endowed with efficient methods for public-key cryptography. Recent research has shown the superiority of the Montgomery and Edwards curves over the Weierstrass curves as they require fewer arithmetic operations. Using these modern curves has, however, introduced several challenges to the cryptographic algorithm's design, opening up new opportunities for optimization. Our main objective is to propose algorithmic optimizations and implementation techniques for cryptographic algorithms based on elliptic curves. In order to speed up the execution of these algorithms, our approach relies on the use of extensions to the instruction set architecture. In addition to those specific for cryptography, we use extensions that follow the Single Instruction, Multiple Data (SIMD) parallel computing paradigm. In this model, the processor executes the same operation over a set of data in parallel. We investigated how to apply SIMD to the implementation of elliptic curve algorithms. As part of our contributions, we design parallel algorithms for prime field and elliptic curve arithmetic. We also design a new three-point ladder algorithm for the scalar multiplication P+kQ, and a faster formula for calculating 3P on Montgomery curves. These algorithms have found applicability in isogeny-based cryptography. Using SIMD extensions such as SSE, AVX, and AVX2, we develop optimized implementations of the following cryptographic algorithms: X25519, X448, SIDH, ECDH, ECDSA, EdDSA, and qDSA. Performance benchmarks show that these implementations are faster than existing implementations in the state of the art. Our study confirms that using extensions to the instruction set architecture is an effective tool for optimizing implementations of cryptographic algorithms based on elliptic curves. May this be an incentive not only for those seeking to speed up programs in general but also for computer manufacturers to include more advanced extensions that support the increasing demand for cryptography.
Read moreHigh-Performance Elliptic Curve Cryptography: A SIMD Approach to Modern Curves
Cryptography based on elliptic curves is endowed with efficient methods for public-key cryptography. Recent research has shown the superiority of the Montgomery and Edwards curves over the Weierstrass curves as they require fewer arithmetic operations. Using these modern curves has, however, introduced several challenges to the cryptographic algorithm’s design, opening up new opportunities for optimization. Our main objective is to propose algorithmic optimizations and implementation techniques for cryptographic algorithms based on elliptic curves. In order to speed up the execution of these algorithms, our approach relies on the use of extensions to the instruction set architecture. In addition to those specific for cryptography, we use extensions that follow the Single Instruction, Multiple Data (SIMD) parallel computing paradigm. In this model, the processor executes the same operation over a set of data in parallel. We investigated how to apply SIMD to the implementation of elliptic curve algorithms. As part of our contributions, we design parallel algorithms for prime field and elliptic curve arithmetic. We also design a new three-point ladder algorithm for the scalar multiplication P + kQ, and a faster formula for calculating 3P on Montgomery curves. These algorithms have found applicability in isogeny-based cryptography. Using SIMD extensions such as SSE, AVX, and AVX2, we develop optimized implementations of the following cryptographic algorithms: X25519, X448, SIDH, ECDH, ECDSA, EdDSA, and qDSA. Performance benchmarks show that these implementations are faster than existing implementations in the state of the art. Our study confirms that using extensions to the instruction set architecture is an effective tool for optimizing implementations of cryptographic algorithms based on elliptic curves. May this be an incentive not only for those seeking to speed up programs in general but also for computer manufacturers to include more advanced extensions that support the increasing demand for cryptography.
Read more