• IEIE Transactions on Smart Processing and Computing
• /
• 제6권3호
• /
• pp.210-219
• /
• 2017

This paper proposes a modified min-max algorithm (MMMA) for nonbinary quasi-cyclic low-density parity-check (NB-QC-LDPC) codes and an efficient parallel block-layered decoder architecture corresponding to the algorithm on a graphics processing unit (GPU) platform. The algorithm removes multiplications over the Galois field (GF) in the merger step to reduce decoding latency without any performance loss. The decoding implementation on a GPU for NB-QC-LDPC codes achieves improvements in both flexibility and scalability. To perform the decoding on the GPU, data and memory structures suitable for parallel computing are designed. The implementation results for NB-QC-LDPC codes over GF(32) and GF(64) demonstrate that the parallel block-layered decoding on a GPU accelerates the decoding process to provide a faster decoding runtime, and obtains a higher coding gain under a low $10^{-10}$ bit error rate and low $10^{-7}$ frame error rate, compared to existing methods.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2008년도 하계학술대회 논문집
• /
• pp.24-27
• /
• 2008

For high voltage DC-DC converters, the parallel operation of several high voltage source modules is necessary to reduce the material cost. In the conventional parallel operation with HDC module control unit, it is difficult to repair the HDC system for the failure of control unit. To overcome these problems, new parallel operating algorithm for high voltage DC-DC converter is presented. The proposed algorithm has no main control unit and each module can be selected as the master according to the operating conditions. Therefore, one of modules can be replaced as the master immediately when the previous master module is failed. In addition, the extension of extra modules can be simple.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 추계학술대회 논문집
• /
• pp.1003-1006
• /
• 2002

In machining free-form curves with a machine tool equipped with parallel device, improving contouring accuracy is very important. In this paper, we present contouring control algorithm far parallel machine tool. The relation between the error in Joint space and the error in catesian space is evaluated, and we estimate contouring error vector which efficiently determines the variable gains for the cross coupled control. To show the validity of the algorithm, the contouring control is simulated for free form contour trajectory in cubic parallel machine tool model.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제24권2호
• /
• pp.199-214
• /
• 2020

This paper describes the development of a parallel computational algorithm based on the finite element tearing and interconnecting (FETI) method that uses a local Lagrange multiplier. In this approach, structural computational domain is decomposed into non-overlapping sub-domains using local Lagrange multiplier. The local Lagrange multipliers are imposed at interconnecting nodes. 8-node solid element using extra shape function is adopted by using the representative volume element (RVE). The parallel computational algorithm is further established based on message passing interface (MPI). Finally, the present FETI-local approach is implemented on parallel hardware and shows improved performance.

• 지능정보연구
• /
• 제6권1호
• /
• pp.113-128
• /
• 2000

This paper presents a first year report of an ongoing multi-year project to develop a systolic parallel simulation system for dynamic traffic assignment. The fundamental approach to the simulation is systolic parallel processing based on autonomous agent modeling. Agents continuously act on their own initiatives and access to database to get the status of the simulation world. Various agents are defined in order to populate the simulation world. In particular existing modls and algorithm were incorporated in designing the behavior of relevant agents such as car-following model headway distribution Frank-Wolf algorithm and so on. Simulation is based on predetermined routes between centroids that are computed off-line by a conventional optimal path-finding algorithm. Iterating the cycles of optimization-then-simulation the proposed system will provide a realistic and valuable traffic assignment. Gangnum-Gu district in Seoul is selected for the target are for the modeling. It is expected that realtime traffic assignment services can be provided on the internet within 3 years.

• 한국시뮬레이션학회논문지
• /
• 제1권1호
• /
• pp.64-76
• /
• 1992

The DEVS(discrete event system specificaition) formalism specifies a discrete event system in a hierarchical, modular form. DEVSIM++ is a C++based general purpose DEVS abstract simulator which can simulate systems modeled by the DEVS formalism in a sequential environment. This paper describes P-DEVSIM++which is a parallel version of DEVSIM++ . In P-DEVSIM++, the external and internal event of DEVS models can by processed in parallel. For such processing, we propose a parallel, distributed optimistic simulation algorithm based on the Time Warp approach. However, the proposed algorithm localizes the rollback of a model within itself, not possible in the standard Time Warp approach. An advantage of such localization is that the simulation time may be reduced. To evaluate its performance, we simulate a single bus multiprocessor architecture system with an external common memory. Simulation result shows that significant speedup is made possible with our algorithm in a parallel environment.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.352-354
• /
• 2004

In this paper, a parallel fuzzy controller for one degree of freedom magnetic levitation is designed and its performance is compared with the performance of a PID controller. Input, output scaling factor of fuzzy controller and gain of PID controller were tuned using the GA algorithm. The designed controllers are validated by numerical simulations. So it's shown that parallel fuzzy controller can give the better performance for the plant than PID controller.

• 한국신재생에너지학회:학술대회논문집
• /
• 한국신재생에너지학회 2008년도 춘계학술대회 논문집
• /
• pp.65-68
• /
• 2008

This paper proposes the parallel operation control algorithm of a power conditioning system (PCS) for a distributed Fuel Cell power generation system. A proposed control algorithm is made good a drawback of the conventional control algorithm. The controller must also supervise the total PCS operation while communicating with the fuel cell system controller. Simulation results are presented to performance of a proposed control algorithm for the PCS.

• 대한산업공학회지
• /
• 제25권3호
• /
• pp.360-368
• /
• 1999

We consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, a hybrid genetic algorithm is proposed. The algorithm combines a genetic algorithm for global search and a heuristic for local optimization to improve the speed of evolution convergence. The genetic operators are developed such that parallel machines can be handled in an efficient and effective way. For local optimization, the adjacent pairwise interchange method is used. The proposed hybrid genetic algorithm is compared with two heuristics, the nearest setup time method and the maximum penalty method. Computational results for a series of randomly generated problems demonstrate that the proposed algorithm outperforms the two heuristics.

• 한국정보과학회논문지:시스템및이론
• /
• 제33권7호
• /
• pp.448-453
• /
• 2006

본 논문은 평면 그래프를 위한 병렬 depth-first search (DFS) 알고리즘 [SIAM J. Comput., 19 (1990) 678-704]을 비 평면일 (non-planar) 수 있는 grid 그래프의 한 종류인 solid grid 그래프에 대해서도 수행 가능하도록 확장된 알고리즘을 제안한다. 제안 알고리즘은 Priority PRAM 모델에서 $O(n/sqrt{log\;n})$개의 프로세서로 수행했을 때 O(log n)의 병렬 시간이 소요된다. 우리의 지식으로, 이는 비 평면 그래프를 위한 첫 번째 결정적 NC (deterministic NC) 알고리즘이다.