• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.1
• /
• pp.40-45
• /
• 2004

This paper presents the parallel distributed control scheme for shaping of the bent glass. The designed system consists of a PC, a main controller and 11 servo-controllers, the precision motion controllers. Each elements are connected by using RS-232C and 8-bit data bus. In order to guarantee the stability and the control performance, we use a precision PID motion controller and a H-bridge on the servo-drivers. PC calculates position values of 11 DC motors by using the pre-determined curvature value and offers the user interface environment operator. The main controller provides the control instructions and parameter values to 11 servo-controllers by chip enable signal, simultaneously. Using the received commands and parameter values, the servo-controllers control the positions of the DC motors based on PID control scheme.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.384-393
• /
• 2002

A Parallel file system is normally used to support excessive file requests from parallel applications in a cluster system, whereas prefetching is useful for improving the file system performance. This paper proposes a new prefetching method, Fips(dynamic File Prefetching Scheme based on file access patterms), that is particularly suitable for parallel scientific applications and multimedia web services in a parallel file system. The proposed prefetching method introduces a dynamic prefetching scheme to predict data blocks precisely in run-time although the file access patterns are irregular. In addition, it includes an algorithm to determine whether and when the prefetching is performed using the current available I/O bandwidth. Experimental results confirmed that the use of the proposed prefetching policy in a parallel file system produced a higher file system performance.

• Journal of the Korea Society for Simulation
• /
• v.4 no.2
• /
• pp.79-92
• /
• 1995

In this paper we present an efficient parallel simulation algorithm in recursive feedforward network(RFN) which can reduce the simulation delay while decreasing the number of null messages compared to the previous result. As a preprocessing step, we first determine the group and type of each oupput channel for the nodes using DFS(Depth First Search) algorithm, and show that the number of null messages as well as the simulation scheme. By the new scheme we decide if null messages are sent to the output channels or not according to the group to which it belongs.

• Journal of the Korean Mathematical Society
• /
• v.52 no.2
• /
• pp.373-388
• /
• 2015

In this paper, a novel parallel hybrid iterative method is proposed for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of variational inequalities for inverse strongly monotone mappings and the set of fixed points of a finite family of nonexpansive mappings in Hilbert space. Strong convergence theorem is proved for the sequence generated by the scheme. Finally, a parallel iterative algorithm for two finite families of variational inequalities and nonexpansive mappings is established.

• Journal of computational fluids engineering
• /
• v.10 no.1
• /
• pp.67-72
• /
• 2005

This research is based on the iterative space-marching method for incompressible and compressible Navier-Stokes equations[1-4]. A principle of parallel computational schemes construction for steady and unsteady problems is suggested. It is analytically proven that convergence of these schemes is unconditional for incompressible case. When the parallel scheme is used the total volume of computations is the sum of a large number of independent and equal parts. Estimation of the speed-up K shows that K > 1000 in ideal case. First results of using the parallel schemes are presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1684-1699
• /
• 2017

The deblocking filter (DF) reduces blocking artifacts in encoded video sequences, and thereby significantly improves the subjective and objective quality of videos. Statistics show that the DF accounts for 5-18% of the total decoding time in high-efficiency video coding. Therefore, speeding up the DF will improve codec performance, especially for the decoder. In view of the rapid development of multicore technology, we propose a parallel DF scheme based on a modified order of accessing the coding tree units (CTUs) by analyzing the data dependencies between adjacent CTUs. This enables the DF to run in parallel, providing accelerated performance and more flexibility in the degree of parallelism, as well as finer parallel granularity. We additionally solve the problems of variable privatization and thread synchronization in the parallelization of the DF. Finally, the DF module is parallelized based on the HM16.1 reference software using OpenMP technology. The acceleration performance is experimentally tested under various numbers of cores, and the results show that the proposed scheme is very effective at speeding up the DF.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.333-340
• /
• 2004

In order that routers forward a packet to its destination, they perform IP address lookup which determines the next hop according to the packet's destination address. In designing high speed routers, IP address lookup is an important issue. In order to design high speed routers, this paper proposes a parallel IP lookup scheme which consists of several IP lookup engines without any modification of already fabricated indirect IP lookup chipsets. Also, we propose a simple rule for partitioning IP prefix entries In an overall forwarding table among several IP lookup engines. And we evaluate the performance of the proposed scheme in terms of the memory size required for storing lookup information and the number of memory accesses on constructing the forwarding table. With additional hardware logics, the proposed scheme can reduce about 30% of the required memory size and 80% of the memory access counts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7B
• /
• pp.469-480
• /
• 2005

This paper presents new multimedia transmission and synchronization scheme for parallel server in wireless environment. The proposed scheme is developed for the parallel sewer that stores MPEG-4 data according to VOP (video object plane) types, i.e., I-, p-, and B-VOP. The goal of our research is to develop the enhanced multimedia transmission scheme that copes with load unbalancing, congestion, and jitter. Thus, we consider three issues; the data striping, the priority queuing, and the multimedia synchronization. First, we develop a parallel server architecture in which each server separately stores video data that is striped by the MPEG-4 VOP types.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3C
• /
• pp.175-182
• /
• 2011

This paper presents a novel eight-parallel 128/256-point mixed-radix multi-path delay commutator (MRMDC) FFT/IFFT processor for orthogonal frequency-division multiplexing (OFDM) systems. The proposed FFT architecture can provide a high throughput rate and low hardware complexity by using an eight-parallel data-path scheme, a modified mixed-radix multi-path delay commutator structure and an efficient scheduling scheme of complex multiplications. The efficient scheduling scheme can reduce the number of complex multipliers at the second stage from 88 to 40. The proposed FFT/IFFT processor has been designed and implemented with the 90nm CMOS technology. The proposed eight-parallel FFT/IFFT processor can provide a throughput rate of up to 27.5Gsample/s at 430MHz.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.1
• /
• pp.109-116
• /
• 2008

Even though many studies on parallel rendering based on PC clusters have been done. most of those did not cope with non-uniform scenes, where locations of 3D models are biased. In this work. we have built a PC cluster system with POV-Ray, a free rendering software on the public domain, and developed an adaptive load balancing scheme to optimize the parallel efficiency Especially, we noticed that a frame of 3D animation are closely coherent with adjacent frames. and thus we could estimate distribution of computation amount, based on the computation time of previous frame. The experimental results with 2 real animation data show that the proposed scheme reduces by 40% of execution time compared to the simple static partitioning scheme.