• 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.

• 한국멀티미디어학회논문지
• /
• 제9권12호
• /
• pp.1542-1551
• /
• 2006

In the Grid Database, some replicas will have more requests from the clients than others. A fast consistency algorithm has been presented to satisfy the high demand nodes in a shorter period of time. But it has poor performance in multiple regions of high demand for forming the island of locally consistent replicas. Then, a leader election method is proposed, whereas it needs much additional cost for periodic leader election, information storage, and message passing, Also, false leader can be created. In this paper, we propose a tree-based algorithm for replica update propagation. Leader replicas with high demand are considered as the roots of trees which are interconnected. All the other replicas are sorted and considered as nodes of the trees. Once an update occurs at any replica, it need be transmitted to the leader replicas first. Every node that receives the update propagates it to its children in the tree. The update propagation is optimized by cost reduction for fixed propagation schedule. And it is also flexible for the dynamic model in which the demand conditions change with time.

• Fisheries and Aquatic Sciences
• /
• 제7권3호
• /
• pp.163-170
• /
• 2004

A fishing simulator for towed fishing gear was investigated in order to mimic the fish behavior in capture process and investigate fishing selectivity. A fish behavior model using a psycho-hydraulic wheel activated by stimuli is established to introduce Lorenz chaos equations and a neural network system and to generate the components of realistic fish capture processes. The fish positions within the specified gear geometry are calculated from normalized intensities of the stimuli of the fishing gear components or neighboring fish and then these are related to the sensitivities and the abilities of the fish. This study is applied to four different towed gears i.e. a bottom trawl, a midwater trawl, a two-boat seine, and an anchovy boat seine and for 17 fish species as mainly caught. The Alpha cluster computer system and Fortran MPI (Message-Passing Interface) parallel programming were used for rapid calculation and mass data processing in this chaotic behavior model. The results of the simulation can be represented as animation of fish movements in relation to fishing gear using Open-GL and C graphic programming and catch data as well as selectivity analysis. The results of this simulator mimicked closely the field studies of the same gears and can therefore be used in further study of fishing gear design, predicting selectivity and indoor training systems.

• 한국정보처리학회논문지
• /
• 제4권12호
• /
• pp.3069-3077
• /
• 1997

이 논문에서는 비공유 병렬구조에서 이행적 종속성을 갖는 선형적 재귀규칙의 병렬평가에 대한 패러다임을 제안한다. 병렬평가를 위해 우리는 모든 노드가 메시지 교환을 위해 연결망만을 공유하는 비공유 병렬구조를 고려한다. 여기서 정규화된 규칙의 평가는 그 규칙의 중명-이론적 의미의 계산이다. 이행적 종속성올 갖는 정규 화된 선형적 재귀규칙을 정의하고, 그 규칙이 등가의 표현식으로 변환될 수 있음을 보이고, 등가의 표현식을 근거로 결합, 분할, 이행성폐포 연산을 이용하여 정규화된 규칙에 대한 병렬평가를 위한 패러다임을 제안하고 시간 복잡도를 분석하였다.

• 한국정보시스템학회지:정보시스템연구
• /
• 제3권
• /
• pp.71-82
• /
• 1994

Knowledge acquisition, maintenance of knowledge base, and validation and verification of knowledge are the addressed bottlenecks of building successful knowledge based systems. Along with the increment of interesting in the knowledge based systems, the organization needs to develop a new one although it has a similar one. This causes several serious problems including knowledge redundancy and maintenance of knowledge base. This paper present three models of the reusable knowledge base which might be the solution to the above problem. Three models are : 1) multiple knowledge bases for a single AI application, 2) multiple knowledge bases for multiple AI applications, 3) a single knowledge base for multiple AI applications. A new approach to build such a reusable knowledge base in a homogeneous environment is presented. Our model combines the essential object-oriented techniques with rules in a consistent manner. Important aspects of applying object-oriented techniques to AI are discussed (inheritance, encapsulation, message passing), and some potential problems in building an AI application (decomposition technique of knowledge, search time, and heterogeneous environment) are pointed out. The models of a reusable knowledge base provide several amenities : 1) reduce the knowledge redundancy, 2) reduce the effort of maintenance of the knowledge base, 3) reuse the resource of the multiple domain knowledge bases, 4) reduce the development time.

• 정보학연구
• /
• 제4권2호
• /
• pp.25-36
• /
• 2001

실시간 커널은 시간적인 요소를 가장 핵심으로 고려하여 설계된다. 따라서 실시간 커널은 작은 용량을 가지며 빠르게 예측할 수 있어야 한다. 또한 실시간 스케줄링에 요구되는 많은 변화들을 통해서 실시간 커널에 융통성을 부여해야 한다. 본 논문에서 제안한 분산 이중 실시간 커널 시스템은 실시간 제약들을 고려한 실시간 커널과 일반적인 커널의 특성을 가지도록 설계한다. 실시간 제약 조건인 인터럽트 지연 시간, 스케줄링의 정확성, 메시지 전달시간을 만족하기 위하여 실시간 커널에는 실시간 태스크 처리와 인터럽트 처리, 타이밍을 처리하도록 하였고 비실시간 커널은 일반적인 태스크를 처리하도록 한다. 또한, 기존의 실시간 커널인 RT-Linux, QNX와 제안한 실시간 커널이 인터럽트 지연, 스케줄링 정확성, 메시지 전달시간 등을 비교 분석함으로써 실시간 제약조건을 만족함을 보인다

• 전자공학회논문지CI
• /
• 제44권3호
• /
• pp.81-89
• /
• 2007

MPI(message passing interface) 기반 PC 클러스터 상에서 병렬분산 GHT(generalized Hough transform)를 모델화하고 시간 분석하여 고속화 구현하였다. 파이프라인 방송(pipelined broadcast) 통신방식과 누산기 배열(accumulator array) 분할 처리정책을 사용함으로써 통신부담을 최대한 줄였고, 전체 처리 과정에 걸쳐 통신과 계산처리를 시간 중첩시켜 구현함으로써 최대한의 속도제고를 하였다. 100 Mbps Ethernet 스위치를 이용하여 MPI 기반 PC 클러스터를 구현하고 제안한 병렬분산 GHT를 실험하여 선형에 가까운 속도 제고율 (speedup)을 확인하였다.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2007년도 추계 학술대회논문집
• /
• pp.187-193
• /
• 2007

The flight vehicles have cavities such as wheel wells and bomb bays. The flow around a cavity is characterized as unsteady flow because of the formation and dissipation of vortices due to the interaction between the freestream shear layer and cavity internal flow, the generation of shock and expansion waves. Resonance phenomena can damage the structures around the cavity and negatively affect aerodynamic performance and stability. In the present study, numerical analysis was performed for cavity flows by the unsteady compressible three dimensional Reynolds-Averaged Navier-Stokes (RANS) equations with Wilcox's ${\kappa}\;-\;{\omega}$ turbulence model. The cavity has the aspect ratios of 2.5, 3.5 and 4.5 for two-dimensional case, same aspect ratios with the W/D ratio of 2 for three-dimensional case. The Mach and Reynolds numbers are 0.53 and 1,600,000 respectively. The flow field is observed to oscillate in the "shear layer mode" with a feedback mechanism. Based on the SPL(Sound Pressure Level) analysis of the pressure variation at the cavity trailing edge, the dominant frequency was analyzed and compared with the results of Rossiter's formula. The MPI(Message Passing Interface) parallelized code was used for calculations by PC-cluster.

• 대한기계학회논문집A
• /
• 제24권5호
• /
• pp.1215-1230
• /
• 2000

Parallel Approaches using Cray T3E which is NIPP (Massively Parallel Processors) machine are presented for the efficient computation of the finite element analysis of 3-D shape rolling processes. D omain decomposition method coupled with parallel linear equation solver is used. Domain decomposition is applied for obtaining element tangent stifffiess matrices and residual vectors. Direct and iterative parallel algorithms are used for solving the linear equations. Direct algorithm is_parallel version of direct banded matrix solver. For iterative algorithms, the well-known preconditioned conjugate gradient solver with Jacobi preconditioner is also employed. Moreover a new effective iterative scheme with block inverse matrix preconditioner, which is named by present authors, is presented and its results are compared with the one using Jacobi preconditioner. PVM and MPI are used for message passing and synchronization between processors. The performance and efficiency of each algorithm is discussed and comparisons are made among different algorithms.

• 대한전자공학회논문지SP
• /
• 제48권2호
• /
• pp.88-95
• /
• 2011

스테레오 매칭은 두 영상의 차이를 이용하여 거리를 추정하는 연구 분야로 성능 개선과 함께 처리속도 향상을 위한 연구가 계속되고 있다. 본 논문에서는 계층적 Belief Propagation(BP) 알고리즘을 개선하여 기존의 BP에서의 수렴구간을 메시지 맵으로 만들고 이를 이용하여 처리속도를 향상시키는 Plane-converging BP 알고리즘을 제안한다. 또한 GPU 아키텍쳐인 Nvidia의 CUDA를 이용하여 다수의 계산을 병렬화 하고 이를 동시에 처리하여 실시간 어플리케이션에 적합한 스테레오 매칭 기법을 개발하였다. Plane-converging BP 알고리즘은 기존의 계층적 BP 알고리즘과 유사한 에러율을 가지면서 약 2.7배의 속도 향상을 이루었다.