• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.5
• /
• pp.361-367
• /
• 2014

In this paper, task scheduling and load balancing methods of multifrontal solution methods of finite element structural analysis in a modern multicore machine are introduced. Many structural analysis problems have generally irregular grid and many kinds of properties and materials. These irregularities and heterogeneities lead to bottleneck of parallelization and cause idle time to analysis. Therefore, task scheduling and load balancing are desired to reduce inefficiency. Several kinds of multithreaded parallelization methods are presented and comparison between static and dynamic task scheduling are shown. To reduce the idle time caused by irregular partitioned subdomains, computational load balancing methods, Balancing all tasks and minmax task pairing balancing, are invented. Theoretical and actual elapsed time are shown and the reason of their performance gap are discussed.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2011.05a
• /
• pp.158-158
• /
• 2011

천수방정식과 같은 쌍곡선형 미분방정식의 불연속 해에 대한 Riemann 해법은, 1950년대 말 공기동역학 분야에서 S. K. Godunov의 선구적인 시도 이후, 다양한 영역에서 성공적으로 적용되고 있다. 당초 제안된 해법은 공간에 대해 1차 정도였으나, 2차의 정도를 얻을 수 있는 기법이 1970년대 말 B. van Leer에 의해 제안되었으며, MUSCL로 불린다. 서로 인접한 격자의 보존변수가 고려된 경사가 도입되어 두 격자에 의해 공유되는 변의 좌 우에서 선형으로 보존변수가 재구축되는 MUSCL은 제한자와 함께 이용될 때, 구조 격자 체계에서 비교적 단순하면서도 효과적인 적용성이 입증되었다. 그런데, 이 기법을 2차원의 비구조 격자 체계에 적용하는 경우, 인접한 모든 격자의 보존변수를 고려한 평면의 경사를 결정해야 하는 어려움이 따른다. 특히, 삼각형 비구조 격자에 적용할 경우 최적의 평면을 결정하기 위해 Green-Gauss 적분식이나 최소-자승법 등을 이용하게 된다. 이에 비해, 2010년 T. Buffard와 S. Clain이 제안한 다중경사 기법은 격자의 각 변에서 경사가 각각 결정되는 방법으로 계산량이 많은 Green-Gauss 적분식이나 최소자승법을 피할 수 있는 장점이 있는 것으로 알려져 있다. 정확해가 알려진 두 경우에 대해 몇 가지 제한자를 적용한 결과를 1차 정도의 해와 함께 비교하였으며, superbee 제한자에 의한 결과가 우수하였으나, 희유파와 충격파가 맞닿는 곳에서 수치 분산이 나타났다. minmod 제한자의 결과가 대체로 무난하였으며, 이를 2차원 댐 붕괴 문제에 적용하여 1차 정도의 해와 비교하였다. 마찰이 없고 초기 수심이 댐 상류에서 10 m, 하류에서 5 m로서 물이 차 있는 경우, 1차 정도의 해에서 나타나는 수치 소산이 2차 정도에서는 발생되지 않았다. 댐 하류에서 초기에 수심이 영으로 바닥이 드러난 경우에서 마찰의 영향을 검토하였다. 마찰이 있는 경우, 마찰 경사 항의 Manning 계수를 0.04로 두었으며, 마찰에 의한 영향이 잘 드러났다. 수심이 50 mm 보다 작은 경우에는 마찰을 적용하지 않았다. 이 연구는 환경부 '차세대 핵심환경기술개발 사업'의 지원에 의한 것이다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2311-2319
• /
• 1999

We present two heuristic algorithms for the task allocation problem (NP-complete problem) in parallel computing. The problem is to find an optimal mapping of multiple communicating tasks of a parallel program onto the multiple processing nodes of a distributed-memory multicomputer. The purpose of mapping these tasks into the nodes of the target architecture is the minimization of parallel execution time without sacrificing solution quality. Many heuristic approaches have been employed to obtain satisfactory mapping. Our heuristics are based on genetic algorithms and simulated annealing. We formulate an objective function as a total computational cost for a mapping configuration, and evaluate the performance of our heuristic algorithms. We compare the quality of solutions and times derived by the random, greedy, genetic, and annealing algorithms. Our experimental findings from a simulation study of the allocation algorithms are presented.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1030-1033
• /
• 2006

In this paper, the assignment problem is considered. We propose an approach based on the solution of a sequence of shortest path sub-problem. We extend the cost reduction method, which is used for finding initial assignment, to solve these sub-problems. The use of the extended reduction method makes it possible to devise an efficient multi-augmenting algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.3
• /
• pp.365-375
• /
• 1996

We consider an extension of the multiple choice linear knapsack problem and develop a fast algorithm of order $O(r_{max}n^2)$ by exploiting some new properties, where $r_{max}$ is the largest multiple choice number and n is the total number of variables. The proposed algorithm has convenient structures for the post-optimization in changes of the right-hand-side and multiple choice numbers. A numerical example is presented.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.291-299
• /
• 1998

We present a variant for the generalized continuous multiple-choice knapsack problem[1], which additionally has the well-known generalized lower bound constraints. The presented problem is characterized by some variables which only belong to the simple upper bound constraints and the others which are partitioned into both the continuous multiple-choice constraints and the generalized lower bound constraints. By exploiting some extended structural properties, an efficient algorithm of order Ο($n^2$1og n) is developed, where n is the total number of variables. A numerical example is presented.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.4
• /
• pp.519-527
• /
• 1995

By finding some new properties, we develop an O($r_{max}n^2$) algorithm for the generalized multiple choice linear knapsack problem where $r_{max}$ is the largest multiple choice number and n is the total number of variables. The proposed algorithm can easily be embedded in a branch-and-bound procedure due to its convenient structure for the post-optimization in changes of the right-hand-side and multiple choice numbers. A numerical example is presented.

• Proceedings of the Korean Reliability Society Conference
• /
• 2005.06a
• /
• pp.271-278
• /
• 2005

시점이 1개 있고 연결되어야 할 단말이 다수개인 K-terminal 네트웍의 신뢰도 구조에서 신뢰도를 구하는 알고리즘을 제안하였다. 네트웍 구조의 신뢰도 계산은 일반으로 NP-hard 문제인데 여기서 새로운 해법을 제안한다. 두 가지 개념이 중요한 점인데 첫째는 분해법이고 두 번째는 재귀식 계산 방법이 가능한 점이다. 분해법을 할 때 키스톤 부품을 찾아내는 번거로운 절차 대신 시점으로 부터 전진방향(forward)으로 하나씩 구성품을 선택하여 분해한다. 이러한 방법은 어떠한 키스톤 부품을 선택해야 할지 기준을 생각할 필요가 없으므로 간단하며 알고리즘을 간단하게 만든다. 또한 이 방법에서는 분해에 의해서 두 개의 하위 문제가 생성되고 원 문제와 재귀관계를 수립할 수 있다. 이러한 재귀식 알고리즘은 컴퓨터 프로그램을 간단하게 만든다. 또한 하위 문제는 기억장치에 저장해 두고 차례로 계산에 사용한다.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2009.10a
• /
• pp.75-80
• /
• 2009

Despite its flexibility to complex geometry, three-dimensional (3D) electromagnetic(EM) modeling schemes using finite element method (FEM) have been faced to practical limitation due to the resulting large system of equations to be solved. An efficient 3D FEM modeling scheme has been developed, which can adopt either direct or iterative solver depending on the problems. The direct solver PARDISO can reduce the computing time remarkably by incorporating parallel computing on multi-core processor systems, which is appropriate for single frequency multi-source configurations. When limited memory, the iterative solver BiCGSTAB(1) can provide fast and stable convergence. Efficient 3D simulations can be performed by choosing an optimum solver depending on the computing environment and the problems to be solved. This modeling includes various types of controlled-sources and can be exploited as an efficient engine for 3D inversion.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.10
• /
• pp.299-308
• /
• 2023

As the spectrum shortage problem has accelerated by the emergence of various services, New Radio-Unlicensed (NR-U) has appeared, allowing users who communicated in licensed bands to communicate in unlicensed bands. However, NR-U network users reduce the performance of Wi-Fi network users who communicate in the same unlicensed band. In this paper, we aim to simultaneously maximize the fairness and throughput of the unlicensed band, where the NR-U network users and the WiFi network users coexist. First, we propose an optimal power allocation scheme based on Monte Carlo Policy Gradient of reinforcement learning to maximize the sum of rates of NR-U networks utilizing rate-splitting multiple access in unlicensed bands. Then, we propose a channel occupancy time division algorithm based on sequential Raiffa bargaining solution of game theory that can simultaneously maximize system throughput and fairness for the coexistence of NR-U and WiFi networks in the same unlicensed band. Simulation results show that the rate splitting multiple access shows better performance than the conventional multiple access technology by comparing the sum-rate when the result value is finally converged under the same transmission power. In addition, we compare the data transfer amount and fairness of NR-U network users, WiFi network users, and total system, and prove that the channel occupancy time division algorithm based on sequential Raiffa bargaining solution of this paper satisfies throughput and fairness at the same time than other algorithms.