Papers by Keyword: Parallel Processing

Abstract: Each factory and manufacturing plant needs a flexible and reliable in-plant resource supply to serve production processes efficiently. Manufacturing systems are composed of several numbers of elements, workstations, machines and logistics resources. Production line is a complex system because of the complicated manufacturing process, multiple types, high machining difficulty and many special processes in it. In the Industry 4.0 based on smart manufacturing, it is essential to support the processes with intelligent sensor networks. In this article, we give a brief overview about sensors often used in manufacturing processes. Sensor networks generate a massive and increasing amount of data that needs to be processed. Computationally intensive algorithms are used for the data processing (image, voice and signal processing, different classification functions, numeric optimization routines). Finally, we discuss how GPGPU can improve the real-time processing of data generated by intelligent sensor networks.

Abstract: The paper discusses one of possible approaches for speedup of computational analysis of reinforced concrete slabs on foundation. The parallel processing is utilised to accomplish this task. The studied structure is divided to several parts are processed in parallel. A solution of real problems which can include iterative procedures and different levels of interaction between them, however it requires refinement and adaptation of such procedures.The main aim of the paper is to discuss these challenges and to propose solution of them for the particular case of the concrete and reinforced concrete slabs on a foundation.

Abstract: In this paper, we present a technique for accelerating the bilateral filtering using GPGPU. Bilateral filtering is a tool for an image smoothing with edge preserving properties. It serves as a mixture of domain and range filters. Domain filter suppresses Gaussian noise while range filter maintains sharp edges. Bilateral filtering is a nonlinear filtering in which the filter kernel must be computed pixel by pixel. Therefore conventional fast Fourier transform technique cannot be used to accelerate the bilateral filtering. Instead, general purpose GPU is used as a parallel machine to reduce time consuming of the bilateral filtering. We will show the experimental results by comparing the computation time of CPU and GPU. It was cleared that, from the experimental results, GPU outperformed the CPU in terms of computation time.

Abstract: Median filtering is an important approach in digital image processing for noise elimination. An improved median filtering algorithm (IMFA) is proposed which can be implemented with only 17 comparisons and 6 clocks delay for 3×3 median filtering mathematical model based on field programmable gate array (FPGA). The algorithm benefits from the parallel processing and pipelining structure of FPGA hardware. At first, the characteristics, basic operational principle and computing process of the IMFA are presented. And then the algorithm using modular technique and top-down design flow methodology with Verilog HDL are programed. At last, some simulation verifications for the algorithm by ModelSim and experimental verification on FPGA hardware platform are carried out. The IMFA can get a large number of data throughput and more quickly processing speed and less hardware resources than similar filtering algorithms.

Abstract: This paper presents a massive data storage and parallel processing method based on MPP architecture, and put forward full persistent data storage way from the client to request, and the integration the idea of Map/Reduce, the system will be distributed to each data node, the data has high scalability, high availability, high concurrency. And the simulation test and verifies the feasibility of mass data storage mode by building a distributed data node.

Abstract: In the article the techniques of increasing efficient of using multi-core processors for the task of calculating the fast Fourier transform were considered. The fast Fourier transform is led on the basis of calculating a time time-frequency correlation function. The time-frequency correlation function allows increasing the information content of the analysis as compared with the classic correlation function. The significant computational capabilities are required to calculate the time-frequency correlation function, that by reason of the necessity of multiple computing fast Fourier transform. For computing the fast Fourier transform the Cooley-Tukey algorithm with fixed base two is used, which lends itself to efficient parallelization and is simple to implement. Immediately before the fast Fourier transform computation the procedure of bit-reversing the input data sequence is used. For algorithm of calculating the time-frequency correlation function parallel computing technique was used that experimentally allowed obtaining the data defining the optimal number of iterations for each core of the CPU, depending on the sample size. The results of experiments allowed developing special software that automatically select the effective amount of subtasks for parallel processing. Also the software provides the choice of sequential or parallel computations mode, depending on the sample size and the number of frequency intervals in the calculation of time-frequency correlation function.

Abstract: The development of multi-core processors has provided a good solution to applications that require real-time processing and a large number of calculations. However, simply exploiting parallelism in software is hard to make full use of the hardware performance. This paper studies the parallel programming and optimization techniques on TMS320C6678 multicore digital signal processors. We firstly illustrate an implementation of a selected parallel image convolution algorithm by OpenMP. Then several optimization techniques such as compiler intrinsics, cache, DMA are used to further enhance the application performance and achieve a good execution time according to the test results.

Abstract: Aiming at the problem of image quality degradation due to scenes change rapidly, an image enhancement algorithm based on scene intelligent identification is proposed. The algorithm sharpen the image detail by using Laplace operator. Determines the change image scene according to the gray value, constructs different gray mapping function, and adjusts gray value range of image adaptively to improve the contrast ratio of image enhancement. By using parallel processing, the algorithm has high execution efficiency, so it can meet the real-time processing of HD video. Experimental result shows that the proposed algorithm has satisfying performance in the rapidly change scene.

Abstract: In view of the difficulties of the current router architecture such as capacity, scalability, and power consumption, a fast-path architecture of IPv6 router suitable for parallel processing is proposed. The fast-path architecture of IPv6 router is designed and implemented using NoC structure. Thereby, a parallel processing structure of IP packets combining the distributed IP address lookup and the parallel IP packet switching is implemented. It is convenient to replace the search algorithm and to expand the hardware scale, and it can improve the overall performance of the router effectively.

Abstract: According to the signal processing unit in aerospace measurement and control system between the flow of water features, this paper proposes a software suitable for aerospace measurement and control system of driving mechanism. This paper first introduces the basic structure of aerospace measurement and control system software, having studied the static and dynamic data stream driving mechanism on the basis of detailed discusses the design and implementation process of this kind of driving mechanism of data stream. It adopts the method of message control, according to the dynamic data flow driven mechanism, realize the process of the signal processing unit and each signal processing unit between the data flow between the internal thread. Compared the same sort of dynamic data stream driving mechanism, the drive mechanism possesses the advantages of flexibility and easy to implement.