Optimization Strategies of Data Processing Algorithms under Multi-Core Architecture
Wei Chen
Abstract
Wei Chen
Abstract
Multi-core processors, especially the single chip multi-processors (CMP), can provide strong parallel resources of sharing memory. However, the majority of programs and algorithms from single-core processors can not make full use of computing resources of multi-core architecture. Therefore, according to some characteristics of multi-core architecture, researchers should optimize those algorithms and substantially increase the performance of algorithms. This paper reviews related optimization strategies of data processing algorithms on multi-core processors around several aspects, including improving the locality of programs, decreasing cache access conflict, enhancing the thread parallelism, taking advantage of single instruction multiple data (SIMD) parallelism and optimizing bandwidth usage. In addtion, it summarizes and comments on the algorithms on multi-core processors. Finally, it introduces several interesting issues that people should address and predicts the prospect of the research on multi-core processors in future.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Multi-core processors, especially the single chip multi-processors (CMP), can provide strong parallel resources of sharing memory. However, the majority of programs and algorithms from single-core processors can not make full use of computing resources of multi-core architecture. Therefore, according to some characteristics of multi-core architecture, researchers should optimize those algorithms and substantially increase the performance of algorithms. This paper reviews related optimization strategies of data processing algorithms on multi-core processors around several aspects, including improving the locality of programs, decreasing cache access conflict, enhancing the thread parallelism, taking advantage of single instruction multiple data (SIMD) parallelism and optimizing bandwidth usage. In addtion, it summarizes and comments on the algorithms on multi-core processors. Finally, it introduces several interesting issues that people should address and predicts the prospect of the research on multi-core processors in future.
Key concepts: Computer science, Parallel computing, Multi-core processor, SIMD, Instruction-level parallelism, Locality, Memory bandwidth, Architecture