• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.11
• /
• pp.223-229
• /
• 2016

In this study, a cold forging process was developed for the roller tappet housing of an engine valvetrain system. A tappet sample was manufactured and subjected to an endurance test. The material properties were obtained from a compression test, and forging analysis was carried out to design a forging process using a commercial program, Deform-3D. The forging process was set up based on the analysis results, and a die set and sample tappet housing were manufactured. To evaluate the sample, the dimensional accuracy, surface roughness, parallelism, and concentricity were measured and confirmed. To evaluate the actuation and durability, a special test rig was developed to simulate the valvetrain system of the engine. An actuation test was performed based on the idle speed of a general diesel engine, and an endurance test was done based on the maximum speed. The results show minor wear of 0.002 mm. The developed test rig will be used to evaluate the actuation and durability of other valvetrain parts.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.4
• /
• pp.394-400
• /
• 2000

The main goal of synchronization is to guarantee exclusive access to shared data and critical sections, and then it makes parallel programs work correctly and reliably. Exclusive access restricts parallelism of parallel programs, therefor efficient synchronization is essential to achieve high performance in shared-memory parallel programs. Many techniques are devised for efficient synchronization, which utilize features of systems and applications. This paper shows the simulation results that existing synchronization methods have inefficiency under CC-NUMA(Cache Coherent Non-Uniform Memory Access) system, and then compares the performance of Freeze&Melt synchronization that can remove the inefficiency. The simulation results present that Test-and-Test&Set synchronization has inefficiency caused by broadcast operation and the pre-defined order of Queue-On-Lock-Bit (QOLB) synchronization to execute a critical section causes inefficiency. Freeze&Melt synchronization, which removes these inefficiencies, has performance gain by decreasing the waiting time to execute a critical section and the execution time of a critical section, and by reducing the traffic between clusters.

• Journal of Ocean Engineering and Technology
• /
• v.17 no.6
• /
• pp.38-46
• /
• 2003

Aim of this article is to propose Micro-Genetic Simulated Annealing (${\mu}GSA$) as a hybrid metaheuristics approach to find the global optimum of nonlinear optimisation problems. This approach combines the features of modern metaheuristics such as micro-genetic algorithm (${\mu}GAs$) and simulated annealing (SA) with the general robustness of parallel exploration and asymptotic convergence, respectively. Therefore, ${\mu}GSA$ approach can help in avoiding the premature convergence and can search for better global solution, because of its wide spread applicability, global perspective and inherent parallelism. For the superior performance of the ${\mu}GSA$, the five well-know benchmark test functions that were tested and compared with the two global optimisation approaches: scatter search (SS) and hybrid scatter genetic tabu (HSGT) approach. A practical application to structural sandwich panel is also examined by optimism the weight function. From the simulation results, it has been concluded that the proposed ${\mu}GSA$ approach is an effective optimisation tool for soloing continuous nonlinear global optimisation problems in suitable computational time frame.

• The KIPS Transactions:PartB
• /
• v.10B no.5
• /
• pp.575-578
• /
• 2003

SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of zero-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZP-DFS, which needs no additional memory when running SPIHT algorithm. It traverses a spatial-tree according to DFS and eliminates additional memory as it uses test-functions for encoding and LSB bits of coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in hardware implementation because no additional memory is required. Moreover. it exploits parallelism to process each spatial-tree that it can be applied well in real-time image compression.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.5 no.2
• /
• pp.63-69
• /
• 2001

In this study, we shall be concerned with computing in parallel a few of the smallest eigenvalues and their corresponding eigenvectors of the eigenvalue problem, $Ax={\lambda}Bx$, where A is symmetric, and B is symmetric positive definite. Both A and B are large and sparse. Recently iterative algorithms based on the optimization of the Rayleigh quotient have been developed, and CG scheme for the optimization of the Rayleigh quotient has been proven a very attractive and promising technique for large sparse eigenproblems for small extreme eigenvalues. As in the case of a system of linear equations, successful application of the CG scheme to eigenproblems depends also upon the preconditioning techniques. A proper choice of the preconditioner significantly improves the convergence of the CG scheme. The idea underlying the present work is a parallel computation of the Multi-Color Block SSOR preconditioning for the CG optimization of the Rayleigh quotient together with deflation techniques. Multi-Coloring is a simple technique to obatin the parallelism of order n, where n is the dimension of the matrix. Block SSOR is a symmetric preconditioner which is expected to minimize the interprocessor communication due to the blocking. We implemented the results on the CRAY-T3E with 128 nodes. The MPI(Message Passing Interface) library was adopted for the interprocessor communications. The test problems were drawn from the discretizations of partial differential equations by finite difference methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.944-946
• /
• 2014

Localization of a sensor network node using machine learning has been recently studied. It is easy for Support vector machines algorithm to implement in high level language enabling parallelism. In this paper, we realized Support vector machine using python language and built a sensor network cluster with 5 Pi's. We also established a Hadoop software framework to employ MapReduce mechanism. We modified the existing Support vector machine algorithm to fit into the distributed hadoop architecture system for localization of a sensor node. In our experiment, we implemented the test sensor network with a variety of parameters and examined based on proficiency, resource evaluation, and processing time.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.1
• /
• pp.11-17
• /
• 2021

In this paper, we demonstrate a performance boost by parallelizing a purely functional bisimulation algorithm on a multicore processor machine. The key idea of this parallelization is exploiting the referential transparency of purely functional programs to minimize refactoring of the original implementation without any parallel constructs. Both original and parallel implementations are written in Haskell, a purely functional programming language. The change from the original program to the parallel program is minuscule, maintaining almost original structure of the program. Through benchmark, we show that the proposed parallelization doubles the performance of the bisimulation test compared to the original non-parallel implementation. We also shaw that similar performance boost is also possible for a memoized version of the bisimulation implementation.

• The Journal of Korean Physical Therapy
• /
• v.6 no.1
• /
• pp.23-35
• /
• 1994

In this research, the mentally-handicapped children being able to be trained were investigated the actual condition of train function making 40 mentally-handicapped children in Kummi Hyedang Spacial Education School, to exmine the effect of physical exercise function when training the mentally-handicapped children who can be trained as applying exercise education programs, and trains for 10 weeks by assigning to both experiment group and control group according to children who are similar to training functions from pre-examination. The results are in following: First, the results of test in the exercise ability of mentally-handicapped children with the degree of being able to trained are very delayed in comparison with normal mental children through the both top and bottom examination. The developments of 5 exercise functions classified by domain, have the order of eyesight exercise, softness, physical strength, quickness, parallelism, the interaction of both eye and hand, and, have the exercise function being equal to the level of between 6 and 12 years old. In 13 bottom test, throwing bean-bag is equal to the nomal 12 years old boy. the board jump, sitting position / bending forward / closing are equal to the level of 12 years old boy. standing with only leg is the level of 9 years old, threading pearls is 7 years old, transfering the wood building, picking the upper body up, walking board, balancing one leg with opened, eye, fist / opening palm / palm, bending and opening arm with postrating on chair, are the exercise functions of below 6 years old. Second, there are great effects in carrying out the exercise education program to the mentally-handicapped children with the level of being able to trained. In experiment group, it is elevated to the middle level of 12 years old nomal children. Classified by domain of test the board jump, training, the bean-bag are far higher level than 12 years old normal children, and are elevated the level of 11 years old boy. Balancing only leg with closed eye is below the level of 10 years old boys, fist / opening palm / palm are the level of 9 years old boys. There and back running, picking the upper body is the level of 9 years old girls. Walking board is the level of 8 years old boys. Bending and opening arm with postrating on chair is the level of 7 rears old boy. Balancing one leg with opened eye is elevated to the level of f years old girls. These functions have the more balanced exercise function rather than pre-examination. In control group, they have little change by classified the bottom test, but have the exercise function on the time of pre-examination, go backward in physical strength. quickness. Third, the exercise function being learned by exercise education program on the mentally-handicapped children of the level with being able to train is appeared to maintain continuately. Softness, physical strength, quickness, eyesight training are maintained the learned exercise function, the interaction of both eye and hands, parallelism are delayed a little. Classified by the bottom test. threading pearls, transfering the wood building, throwing the bean-bag, sitting position / rolling forward / reaching, the broad jump and picking upper body up, there and bark running, picking upper body up, balancing with only leg as opened eye, bending and opening arm with postrating on chair, etc. are maintained. Fist / opening palm / palm, balancing with only leg as opened eye are delayed a little. The change of body position is elevated. Seeing these results, it is appeared to the mentally-handicapped children that the exercise education programs, which is suitable their actual condition and acomplishes in voluntary participation, have very positive effect. So, to develop the function of body exercise in mentally-handicapped children with the level of being to able to be trained, the measures must be groped so that the exercise education programs can be practiced positively, and the ,body exercise can be experienced more.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.39-60
• /
• 2017

In the Cloud, for the scheduling of parallel jobs, there are many tasks in a job and those tasks are executed concurrently on different VMs (Visual machines), where each task of the job will be executed synchronously. The goal of scheduling is to reduce the execution time and to keep the fairness between jobs to prevent some jobs from waiting more time than others. We propose a Cloud model which has multiple Clouds, and under this model, jobs are in different lists according to the waiting time of the jobs and every job has different parallelism. At the same time, a new method-ZOMT (the scheduling parallel tasks based on ZERO-ONE scheduling with multiple targets) is proposed to solve the problem of scheduling parallel jobs in the Cloud. Simulations of ZOMT, AFCFS (Adapted First Come First Served), LJFS (Largest Job First Served) and Fair are executed to test the performance of those methods. Metrics about the waiting time, and response time are used to test the performance of ZOMT. The simulation results have shown that ZOMT not only reduces waiting time and response time, but also provides fairness to jobs.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.4
• /
• pp.9-16
• /
• 2014

This paper proposes a linear scratch detection and restoration algorithm using pixel data comparison in a single frame or consecutive frames. There exists a high parallelism in that a scratch detection and restoration algorithm needs a large amount of comparison operations. The proposed scratch detection and restoration algorithm is designed with a GPU for fast computation. We test the proposed algorithm in sequential and parallel processing with the set of digital videos in National Archive of Korea. In the experiments, the scratch detection rate of consecutive frames is as fast as about 20% for that of a single frame. The detection and restoration rates of a GPU-based algorithm are similar to those of a CPU-based algorithm, but the parallel implementation speeds up to about 50 times.