• Journal of Electrical Engineering and Technology
• /
• 제5권3호
• /
• pp.484-492
• /
• 2010

Magnetic switch is a kind of saturable inductor, which utilizes nonlinearity of the magnetization curve of ferromagnetic materials. The right understanding of the saturation phenomena, magnetic properties, voltage-time product, and switching characteristics of the magnetic switch is essential in designing the magnetic pulse compressor (MPC). In this paper, the historical background of research on the MPC, fundamental physical properties of the magnetic switches, and application fields of the MPC are presented. Further, an in-depth analysis of pulse compression in series and parallel MPCs is incorporated. As practical application examples, a series MPC used for water treatments and a parallel MPC used for pulsed electric field (PEF) inactivation of bacteria are cited.

• 한국통신학회논문지
• /
• 제38C권6호
• /
• pp.521-530
• /
• 2013

본 논문은 기존의 소프트웨어가 멀티코어기반의 모바일 디바이스를 인지할 수 있도록 태스크 병렬화 시스템(BioMP)을 제안한다. 애플리케이션 개발자가 기존의 소프트웨어에 병렬화 규약의 코드를 추가하였을 때, 제안 시스템은 호환성 뿐만 아니라 병렬 쓰레드의 수행을 지원한다. BioMP는 기존의 대용량 애플리케이션 소스코드를 단시일에 멀티코어를 인지하는 소프트웨어로 개선한다. 실험 결과, 우리의 아이디어는 쿼드 코어기반의 멀티코어 환경에서 기존의 시스템 대비 애플리케이션 실행속도를 약 64%까지 개선하였다. 또한, BioMP는 독립적인 컴포넌트이기 때문에 어떠한 플랫폼의 추가적인 수정도 필요로 하지 않는다. 그 결과, 애플리케이션 개발자는 멀티코어향 소프트웨어를 애플리케이션 스토어에 배포하였을 때, 사용자는 모바일 디바이스의 어떠한 수정도 없이 즉시 실행을 할 수 있다.

• 정보처리학회논문지A
• /
• 제11A권3호
• /
• pp.181-188
• /
• 2004

인터넷 기반 분산/병렬 처리 시스템인 PDP(Parallel/Distributed Processing)는 인터넷의 유휴상태 호스트들을 이용하여 대용량 작업을 병렬로 처리해서 전체 수행 시간을 감소시킨다. 본 연구에서는 실시간 네트워크 모니터링을 활용하여 수시로 변화하는 네트워크 환경에 적응하여 병렬/분산 처리되는 방안을 제안한다. 실시간 네트워크 모니터링 정보를 PDP 주요 핵심 알고리즘들에 적용하여 네트워크 과부하 및 결함으로 발생하는 작업 지연 요소에 적응적으로 대처함으로써 전체 성능이 향상됨을 보인다.

• 한국멀티미디어학회논문지
• /
• 제3권3호
• /
• pp.309-319
• /
• 2000

병렬 스케줄링의 목적은 다중프로세서 시스템 환경에서 병렬성을 가진 응용프로그램에 대해 최소의 동기화 오버헤드와 부하균등(load balance)을 달성하도록 스케줄링을 수행하는데 있다. 프로세서들이 병렬 반복(iteration)을 실행하기 위해서는 메모리로부터 반복들에 대한 chunk를 계산하고 할당받게 된다. 이때, 전역 메모리의 상호 배타적인 빈번한 접근으로 많은 스케쥴링 오버헤드 및 병목현상이 발생된다. 또한, 프로세서에게 할당된 chunk내 병렬 반복들의 분포가 서로 상이한 경우,각 chunk의 실행시간이 서로 달라 부하불균등의 원인이 되어 결과적으로 전체 스케쥴링 성능에 나쁜 영향을 준다. 따라서, 최소의 스케줄링 오버 헤드와 부하균등을 달성하기 위해 본 논문에 서는 기존의 방법들에서 문제점들을 도출하고, 자료의 국부성과 프로세서 동족성(affinity)을 고려한 병렬 루프 스케줄링 알고리즘을 제안한다.

• 로봇학회논문지
• /
• 제5권4호
• /
• pp.359-366
• /
• 2010

This study proposes the design method for the robot rotation arm which the end effector that is connected in end of the arm keeps parallel motion even though the robot arm rotates. So far, most robot arm rotates together the end effector when the arm rotates. For this, this study proposes the mechanism that the arm is linked to each 4 parallel link so that rotation is possible by 4 pins, and the rotation arm connects 2 joints of diagonal line direction to a link in each 4 joint for rotation, and designs so that can change length of the link. For verification of design, this study targeted that develop the rotation arm for medical examination that use in ophthalmology. It is important that a medical robot offers comport to patient and design compactly so that medical examination and treatment space may can be defined enough. It is designed so that all drive elements may be positioned on interior of the arm and optimization of design for main parts was carried out in this study for this. The robot arm which is developed in this study manufactured to use by medical phoropter arm, and got good result by an experiment. The robot rotation arm which is proposed in this study is judged to contribute very effectively in case use of a medical robot arm for medical examination and treatment, also the robot arm which the end effector that is connected in the end of the arm needs to keep parallel motion. And, the robot arm which is developed in this study made an application as license.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5446-5463
• /
• 2019

Parallel computing system components should be harmonized, and this harmonization is kept existent using synchronization time. Synchronization time affects the system in two ways. First, if we have too little synchronization time, some tasks face the problem of harmonization, as they need appropriate time to update and synchronize with the system. Second, if we allocate a large amount of time, stall system created. Random allocation of synchronization time for parallel systems slows down not only the booting time of the system but also the execution time of each application involved in the system. This paper presents a simulator used to test and allocate appropriate synchronization time for distributed and parallel heterogeneous systems. The simulator creates the parallel and heterogeneous system to be evaluated, and lets the user vary the synchronization time to optimize the booting time. NS3-cGEM5 simulator in this paper is formed by HLA-RTI federation integration of the two independent architecture and network simulators - NS3 and cGEM5. Therefore, nodes created on these simulators need synchronizations for harmonized system performance. We tested and allocated the appropriate synchronization time for our sample parallel system composed of one x86 server and three ARM clients.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3543-3557
• /
• 2017

Compression is a very important technique for remotely sensed hyperspectral images. The lossless compression based on the recursive least square (RLS), which eliminates hyperspectral images' redundancy using both spatial and spectral correlations, is an extremely powerful tool for this purpose, but the relatively high computational complexity limits its application to time-critical scenarios. In order to improve the computational efficiency of the algorithm, we optimize its serial version and develop a new parallel implementation on graphics processing units (GPUs). Namely, an optimized recursive least square based on optimal number of prediction bands is introduced firstly. Then we use this approach as a case study to illustrate the advantages and potential challenges of applying GPU parallel optimization principles to the considered problem. The proposed parallel method properly exploits the low-level architecture of GPUs and has been carried out using the compute unified device architecture (CUDA). The GPU parallel implementation is compared with the serial implementation on CPU. Experimental results indicate remarkable acceleration factors and real-time performance, while retaining exactly the same bit rate with regard to the serial version of the compressor.

• 대한전기학회논문지:전력기술부문A
• /
• 제55권9호
• /
• pp.365-375
• /
• 2006

This paper is presented by the application of parallel adaptive evolutionary algorithm(PAEA) to search an optimal solution of a thermal unit commitment problem. The adaptive evolutionary algorithm(AEA) takes the merits of both a genetic algorithm(GA) and an evolution strategy(ES) in an adaptive manner to use the global search capability of GA and the local search capability of ES. To reduce the execution time of AEA, the developed algorithm is implemented on an parallel computer which is composed of 16 processors. To handle the constraints efficiently and to apply to Parallel adaptive evolutionary algorithm(PAEA), the states of thermal unit are represented by means of real-valued strings that display continuous terms of on/off state of generating units and are involved in their minimum up and down time constraints. And the violation of other constraints are handled by repairing operator. The procedure is applied to the $10{\sim}100$ thermal unit systems, and the results show capabilities of the PAEA.

• 융합신호처리학회논문지
• /
• 제5권3호
• /
• pp.236-242
• /
• 2004

본 논문에서는 병렬프로그램을 효율적으로 수행하는데 필수적인 부하분산을 위한 기존 알고리즘의 부하분산 오버헤드를 최소화하기 위하여 이 알고리즘의 병렬화 방법을 제시한다. 병렬계산 모델로는 동적으로 변하는 트리구조를 들었으며 이러한 계산은 많은 응용분야에서 찾아볼 수 있다. 부하분산 알고리즘은 통신비용을 정해진 한도 이내로 유지하면서 프로세서간 계산부하를 최대한 균등하게 분산시키고자 시도한다. 이 알고리즘이 메쉬와 하이퍼큐브 구조에서 어떻게 병렬화 될 수 있는가를 상세히 보이고 각각의 경우에 대하여 시간상 복잡도를 분석하여 기존의 알고리즘보다 여러가지 오버헤드가 개선되었음을 증명한다.

• Journal of Power Electronics
• /
• 제15권2호
• /
• pp.327-337
• /
• 2015

This study discusses the design of a parallel-operated DC-DC single-ended primary-inductor converter (SEPIC) for low-voltage application and current sharing with a constant output voltage. A coupled inductor is used for parallel-connected SEPIC topology. Generally, two separate inductors require different ripple currents, but a coupled inductor has the advantage of using the same ripple current. Furthermore, tightly coupled inductors require only half of the ripple current that separate inductors use. In this proposed work, tightly coupled inductors are used. These produce an output that is more efficient than that from separate inductors. Two SEPICs are also connected in parallel using the coupled inductors with a single common controller. An analog control circuit is designed to generate pulse width modulation (PWM) signals and to fulfill the closed-loop control function. A stable output current-sharing strategy is proposed in this system. An experimental setup is developed for a 18.5 V, 60 W parallel SEPIC (PSEPIC) converter, and the results are verified. Results indicate that the PSEPIC provides good response for the variation of input voltage and sudden change in load.