http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
병렬 처리 시스템을 위한 효율적인 복제 중심 스케쥴링 알고리즘
박경린,추현승,Park, Gyeong-Rin,Chu, Hyeon-Seung 한국정보처리학회 1999 정보처리학회논문지 Vol.6 No.8
다중 처리기 시스템에서의 병렬 처리를 위한 스케줄링 문제는 지난 수 십년 동안 중요한 연구 과제가 되어왔다. 다중 처리기 스케줄링 문제(multiprocessor scheduling problem)란 다중 처리기 시스템에서 병렬 수행 시간(parallel execution time)을 최소화 할 수 있는 최적의 스케줄을 구하는 문제로 정의된다. 복제 중심 타스크 스케줄링은 이러한 문제를 풀기 위한 비교적 새로운 접근 방법이다. 이 논문은 복제 중심 스케줄링 알고리즘들을 타스크 복제 방법에 따라서 전체 복제와 부분 복제의 두 가지로 분류하고, 그 두가지 방법의 장점들을 결합한 새로운 스케줄링 알고리즘을 제안한다. 시뮬레이션 결과는 이 논문에서 제안된 스케줄링 알고리즘이 비슷한 복잡도(time complexity)를 갖는 다른 스케줄링 알고리즘보다 우수함을 보여준다. Multiprocessor scheduling problem has been an important research area for the past decades. The problem is defined as finding an optimal schedule which minimizes the parallel execution time of an application on a target multiprocessor system. Duplication Based Scheduling (DBS) is a relatively new approach for solving multiprocessor scheduling problems. This paper classifies DBS algorithms into two categories according to the task duplication method used. The paper then presents a new DBS algorithm that extracts the strong features of the two categories of DBS algorithms. The simulation study shows that the proposed algorithm achieves considerable performance improvement over existing DBS algorithms with similar time complexity.
박경린,Won-Ho Han,Hyunsoon Cho,Junsun Ryu,김영우 대한내시경복강경외과학회 2020 Journal of Minimally Invasive Surgery Vol.23 No.1
Purpose: We devised omental free-shaped flap reinforcement on anastomosis and dissected area (OFFROAD) following reconstruction after gastrectomy. This study aimed to evaluate its safety and early clinical outcomes. Methods: One hundred fifty-six patients who underwent totally laparoscopic distal gastrectomy with delta anastomosis from July 2016 to April 2018 were divided into the OFFROAD group (80 patients) and non-OFFROAD group (76 patients). Differences in short-term operative outcomes and surgical complications were compared between the groups. All patients’ inflammatory marker levels were measured to monitor flap necrotic change and inflammatory reactions. The clinical features of both groups in terms of anastomotic leakage were transcribed. Results: The mean operation time of OFFROAD was five minutes shorter than non OFFROAD. Pain score in postoperative day1 and the serum WBC count on POD 1 was significantly lower in OG than in NOG. There were no statistical differences in short-term outcomes and surgical complications between two groups. Anastomotic leakage occurred in three patients in each group and there was no statistical difference in incidence. However, clinical features were notable when anastomotic leakage occurs. Unlike all three patients of non-OFFROAD group manifested every features of peritonitis, each patient of OFFROAD group just manifested only one of the three. Conclusion: This study showed the safety and feasibility of OFFROAD procedure. It might mitigate septic complications when there is an anastomotic leakage. Additional large-scale study is needed to assess the versatile usefulness of OFFROAD aside from its role as a physical barrier.
An Efficient List Scheduling Algorithm for Multiprocesor Systems
박경린,추현승,이정훈,Park, Gyeong-Rin,Chu, Hyeon-Seung,Lee, Jeong-Hun Korea Information Processing Society 2000 정보처리논문지 Vol.7 No.7
Scheduling parallel tasks, represented as a Directed Acyclic Graph (DAG) or task graph, on a multiprocessor system has been an important research area in the past decades. List scheduling algorithms assign priorities to a node or an edge in an input DAG, and then generate a schedule according to the assigned priorities. This appear proposes a list scheduling algorithms with effective method of priority assignments. The paper also analyzes the worst case performance and optimality condition for the proposed algorithm. The performance comparison study shows that the proposed algorithms outperforms existing scheduling algorithms especially for input DAGs with high communication overheads. The performance improvement over existing algorithms becomes larger as the input DAG becomes more dense and the level of parallelism in the DAG is increased.
박경린(G.R. Park),양영록(Y.R. Yang),정성기(S.K. Jung),명노신(R.S. Myong),조태환(T.H. Cho) 한국전산유체공학회 2010 한국전산유체공학회 학술대회논문집 Vol.2010 No.5
An integrated multi-disciplinary design system plays a critical role in the preliminary design of an aircraft. In this paper such system is developed for the multi-disciplinary computation and design; aerodynamics, elasticity, and radio frequency stealth. Common data base of geometry and structured grids is generated and used for aerodynamic, structural and electromagnetics analysis. The Navieri-Stokes CFD, FEM, and CEM technique are used for aerodynamic, structural, and RF stealth computations, respectively.
박경린,이봉규,이정훈 濟州大學校 基礎科學硏究所 1998 基礎科學硏究 Vol.11 No.1
본 논문은 이더네트에 기반한 DAVIC 댁내망에서의 실시간 성능관리 기법을 제시하고 평가한다. 댁내망에는 실시간 및 비실시간 메시지가 혼재하는데 제시된 성능관리 기법은 이더네트의 비실시간성을 극복하기 위하여 실시간 스트림의 종료시한 만족도를 측정하고 비실시간 메시지의 네트워크 유입율을 조장함으로써 실시간 스트림의 성능을 개선한다. 트래픽 패턴에 기반한 모의실험 결과는 제시된 기법이 댁내망의 부하가 높아질수록 실시간 스트림의 종료시한 만족도를 향상시킴을 보인다. This paper proposes and evaluates a real-time performance management scheme for an Ethernet-based DAVIC residential network where both real-time and non-real-time messages are exchanged together. The proposed scheme enhances the real-time performance such as deadline meet ratio by regulating the transmission rate of data traffic to the network based on the measurement of overall deadline meet ratio of currently established real-time streams. The simulation results based on the traffic pattern of data streams show that the proposed scheme can enhance the deadline meet ratio of real-time streams on the given network traffic load.
병렬 처리 시스템을 위한 효율적인 복제 중심 스케줄링 알고리즘
박경린(Park Gyung Leen),추현승(Choo Hyun Seung) 한국정보처리학회 1999 정보처리학회논문지 Vol.6 No.8
Multiprocessor scheduling problem has been an important research area for the past decades. The problem is defined as finding an optimal schedule which minimizes the parallel execution time of an application on a target multiprocessor system. Duplication Based Scheduling (DBS) is a relatively new approach for solving multiprocessor scheduling problems. This paper classifies DBS algorithms into two categories according to the task duplication method used. The paper then presents a new DBS algorithm that extracts the strong features of the two categories of DBS algorithms. The simulation study shows that the proposed algorithm achieves considerable performance improvement over existing DBS algorithms with similar time complexity.