• 천문학회보
• /
• 제44권2호
• /
• pp.71.1-71.1
• /
• 2019

The solar magnetic field comes from the solar interior and is related to various phenomena on the Sun. To understand this process, many studies have been conducted to produce its evolution using a single flux rope. In this study, we are interested in the emergence of two flux ropes and their evolution, which takes longer than the emergence of a single flux rope. To construct it, we develop a flux emergence simulation by applying a parallel computing to reduce a computation time in a wider domain. The original simulation code had been written in Fortran 77. We modify it to a version of Fortran 90 with Message Passing Interface (MPI). The results of the original and new simulation are compared on the NEC SX-Aurora TSUBASA which is a vector engine processor. The parallelized version is faster than running on a single core and it shows a possibility to handle large amounts of calculation. Based on this model, we can construct a complex flux emergence system, such as an evolution of two magnetic flux ropes.

• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.435-443
• /
• 2007

Computing the interior spectrum of large sparse generalized eigenvalue problems $Ax\;=\;{\lambda}Bx$, where A and b are large sparse and SPD(Symmetric Positive Definite), is often required in areas such as structural mechanics and quantum chemistry, to name a few. Recently, CG-type methods have been found useful and hence, very amenable to parallel computation for very large problems. Also, as in the case of linear systems proper choice of preconditioning is known to accelerate the rate of convergence. After the smallest eigenpair is found we use the orthogonal deflation technique to find the next m-1 eigenvalues, which is also suitable for parallelization. This offers advantages over Jacobi-Davidson methods with partial shifts, which requires re-computation of preconditioner matrx with new shifts. We consider as preconditioners Incomplete LU(ILU)(0) in two variants, ever-relaxation(SOR), and Point-symmetric SOR(SSOR). We set m to be 5. We conducted our experiments on matrices from discretizations of partial differential equations by finite difference method. The generated matrices has dimensions up to 4 million and total number of processors are 32. MPI(Message Passing Interface) library was used for interprocessor communications. Our results show that in general the Multi-Color ILU(0) gives the best performance.

• Structural Engineering and Mechanics
• /
• 제14권6호
• /
• pp.625-647
• /
• 2002

Parallel execution of computational mechanics codes requires efficient mesh-partitioning techniques. These mesh-partitioning techniques divide the mesh into specified number of submeshes of approximately the same size and at the same time, minimise the interface nodes of the submeshes. This paper describes a new mesh partitioning technique, employing Genetic Algorithms. The proposed algorithm operates on the deduced graph (dual or nodal graph) of the given finite element mesh rather than directly on the mesh itself. The algorithm works by first constructing a coarse graph approximation using an automatic graph coarsening method. The coarse graph is partitioned and the results are interpolated onto the original graph to initialise an optimisation of the graph partition problem. In practice, hierarchy of (usually more than two) graphs are used to obtain the final graph partition. The proposed partitioning algorithm is applied to graphs derived from unstructured finite element meshes describing practical engineering problems and also several example graphs related to finite element meshes given in the literature. The test results indicate that the proposed GA based graph partitioning algorithm generates high quality partitions and are superior to spectral and multilevel graph partitioning algorithms.

• 대한기계학회논문집A
• /
• 제22권1호
• /
• pp.132-141
• /
• 1998

A parallel version of sheet forming analysis program was developed. This version is compatible with any parallel computers which support MPI that is one of the most recent and popular message passing libraries. For this purpose, SERI-SFA, a vector version which runs on Cray Y-MP C90, a sequential vector computer, was used as a source code. For the sake of the effectiveness of the work, the parallelization was focused on the selected part after checking the rank of CPU consumed from the exemplary calculation on Cray Y-MP C90. The subroutines associated with contact algorithm was selected as targe parts. For this work, MPI was used as a message passing library. For the performance verification, an oil pan and an S-rail forming simulation were carried out. The performance check was carried out by the kernel and total CPU time along with theoretical performance using Amdahl's Law. The results showed some performance improvement within the limit of the selective paralellization.

• Korea-Australia Rheology Journal
• /
• 제11권3호
• /
• pp.233-240
• /
• 1999

In order to understand the flow behavior of Electrorheological (ER) fluid, dynamic simulation has been intensively performed for the last decade. When the shear flow is applied, it is easy to carry out the simulation with relatively small number of particles because of the periodic boundary condition. For the squeezing flow, however, it is not easy to apply the periodic boundary condition, and the number of particles needs to be increased to simulate the ER system more realistically. For this reason, the simulation of ER fluid under squeezing flow has been mostly performed with some representative chains or with the approximation that severely restricts the flow geometry to reduce the computational load. In this study, Message Passing Interface (MPI), which is one of the most widely-used parallel processing techniques, has been employed in a dynamic simulation of ER fluid under squeezing flow. As the number of particles used in the simulation could be increased significantly, full domain between the electrodes has been covered. The numerical treatment or the approximation used to reduce the computational load has been evaluated for its validity, and was found to be quite effective. As the number of particles is increased, the fluctuation of the normal stress becomes diminished and the prediction in general was found to be qualitatively In good agreement with the experimental results.

• 천문학회보
• /
• 제39권2호
• /
• pp.78.1-78.1
• /
• 2014

An ionization front (IF) surrounding an H II region is a sharp interface through which a cold neutral gas makes transition to a warm ionized phase by absorbing UV photons from central massive stars. We investigate the structure and instability of a plane-parallel D-type IF threaded by magnetic fields parallel to the front. We find that magnetic fields increase the maximum propagation speed of the IFs, while reducing the expansion factor, defined as the density ratio of neutral to ionized phases. IFs become unstable to distortional perturbations due to gas expansion across the fronts, exactly analogous to the Darrieus-Landau instability of ablation fronts in terrestrial flames. The growth rate of the IF instability is proportional linearly to the perturbation wavenumber as well as the upstream flow speed. The IF instability is stabilized by gas compressibility and becomes completely quenched when the front is D-critical. The instability is also stabilized by magnetic pressure when the perturbations propagate in the direction perpendicular to the fields. When the perturbations propagate in the direction parallel to the fields, on the other hand, it is magnetic tension that reduces the growth rate, completely suppressing the instability when ${\beta}$ < 1.5, with ${\beta}$ denoting the square of the ratio of the sound speed to the Alfven speed in the pre-IF region. When the front experiences an acceleration, the IF instability cooperates with the Rayleigh-Taylor instability to make the front more unstable. We discuss potential effects of IF instability on the evolution and dynamics of IFs in the interstellar medium.

• Journal of Power Electronics
• /
• 제9권2호
• /
• pp.133-145
• /
• 2009

In this paper a modular high performance MV-to-LV rectifier based on a cascaded H-bridge rectifier is presented. The proposed rectifier can directly connect to the medium voltage levels and provide a low-voltage and highly-stable DC interface with the consumer applications. The input stage eliminates the necessity for heavy and bulky step-down transformers. It corrects the input power factor and maintains the voltage balance among the individual DC buses. The second stage includes the high frequency parallel-output DC/DC converters which prepares the galvanic isolation, regulates the output voltage, and attenuates the low frequency voltage ripple ($2f_{line}$) generated by the first stage. The parallel-output converters can work in interleaving mode and the active load-current sharing technique is utilized to balance the load power among them. The detailed analysis for modeling and control of the proposed structure is presented. The validity and performance of the proposed topology is verified by simulation and experimental results.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권11호
• /
• pp.643-649
• /
• 2005

A heart diagnosis system adopts Superconducting Quantum Interface Device(SQUD) sensors for precise MCG(MagnetoCardioGram) signal acquisitions. Such system needs to deal with hundreds of sensors, requiring fast signal sampling md precise analog-to-digital conversions(ADC). Our development of hardware board, processing 64-channel 12-bit in 1 ks/s speed, is built by using 8-channel ADC chips, 8-bit microprocessors, SPI interfaces, and specially designed parallel data transfers between microprocessors to meet the 1ks/s, i.e. 1 mili-second sampling interval. We extend the design into 256-channel hardware and analyze the speed .using the measured data from the 64-channel hardware. Since our design exploits full parallel processing, Assembly level coding, and NOP(No Operation) instruction for timing control, the design provides expandability and lowest system timing margin. Our result concludes that the data collection with 256-channel analog input signals can be done in 201.5us time-interval which is much shorter than the required 1 mili-second period.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (A)
• /
• pp.43-45
• /
• 2006

Unlike RNA interference, whose usage is limited to eukaryotic cells, Peptide Nucleic Acid (PNA) technique is applicable to both eukaryotic and prokaryotic cells. PNA has been proven to be an effective agent for blocking gene expressions and has several advantages over other antisense techniques. Here we developed a parallel computing software that provides the ideal sequences to design PNA oligos to prevent any off-target effects. We applied a new approach in our location-finding algorithm that finds a target gene from the whole genome sequence. Message Passing Interface (MPI) was used to perform parallel computing in order to reduce the calculation time. The software will help biologists design more accurate and effective antisense PNA by minimizing the chance of off-target effects.

• 융합신호처리학회논문지
• /
• 제5권1호
• /
• pp.40-45
• /
• 2004

본 논문에서는 병렬 분산제어 방식을 이용한 곡면유리 자동성형 시스템을 개발한다. 설계된 시스템은 PC, 하나의 주제어기, 그리고 11개의 서보제어기로 구성된다. 각 요소들은 RS-232C와 8비트 데이터 버스로 연결된다. 안정성과 제어성능을 고려하여 정밀 PID 모션제어기 프로세서와 DC모터 제어에 사용되는 H-브리지를 사용한다. 설계된 시스템에서, PC는 주어진 곡률반경에 대한 각 구조물의 위치 값을 계산하고 이 값에 대응하는 모터 회전 데이터를 계산하며 작업자의 조작 입력을 위한 사용자 인터페이스를 제공한다. 주제어기는 PC로부터 동작 명령과 제어 파라미터를 받아 버스 통신방식을 이용하여 이를 각 서보제어기로 전달하며 서보제어기는 주제어기로부터 넘겨받은 동작명령과 제어 파라미터를 이용하여 각 모터에 대하여 PID제어를 수행한다.