• 제목/요약/키워드: Distributed Parallel Process

검색결과 93건 처리시간 0.026초

분산컴퓨팅 환경에서 공력 설계최적화의 효율성 연구 (A STUDY ON THE EFFICIENCY OF AERODYNAMIC DESIGN OPTIMIZATION USING DISTRIBUTED COMPUTATION)

  • 김양준;정현주;김태승;조창열
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 2005년도 추계 학술대회논문집
    • /
    • pp.163-167
    • /
    • 2005
  • A research to evaluate efficiency of design optimization was performed for aerodynamic design optimization problem in distributed computing environment. The aerodynamic analyses which take most of computational work during design optimization were divided into several jobs and allocated to associated PC clients through network. This is not a parallel process based on domain decomposition rather than a simultaneous distributed-analyses process using network-distributed computers. GBOM(gradient-based optimization method), SAO(Sequential Approximate Optimization) and RSM(Response Surface Method) were implemented to perform design optimization of transonic airfoil and to evaluate their efficiencies. One dimensional minimization followed by direction search involved in the GBOM was found an obstacle against improving efficiency of the design process in distributed computing environment. The SAO was found quite suitable for the distributed computing environment even it has a handicap of local search. The RSM is apparently the fittest for distributed computing environment, but additional trial and error works needed to enhance the reliability of the approximation model are annoying and time-consuming so that they often impair the automatic capability of design optimization and also deteriorate efficiency from the practical point of view.

  • PDF

분산컴퓨팅 환경에서 공력 설계최적화의 효율성 연구 (A STUDY ON THE EFFICIENCY OF AERODYNAMIC DESIGN OPTIMIZATION IN DISTRIBUTED COMPUTING ENVIRONMENT)

  • 김양준;정현주;김태승;손창호;조창열
    • 한국전산유체공학회지
    • /
    • 제11권2호
    • /
    • pp.19-24
    • /
    • 2006
  • A research to evaluate the efficiency of design optimization was carried out for aerodynamic design optimization problem in distributed computing environment. The aerodynamic analyses which take most of computational work during design optimization were divided into several jobs and allocated to associated PC clients through network. This is not a parallel process based on domain decomposition in a single analysis rather than a simultaneous distributed-analyses using network-distributed computers. GBOM(gradient-based optimization method), SAO(Sequential Approximate Optimization) and RSM(Response Surface Method) were implemented to perform design optimization of transonic airfoils and evaluate their efficiencies. dimensional minimization followed by direction search involved in the GBOM was found an obstacle against improving efficiency of the design process in the present distributed computing system. The SAO was found fairly suitable for the distributed computing environment even it has a handicap of local search. The RSM is apparently the most efficient algorithm in the present distributed computing environment, but additional trial and error works needed to enhance the reliability of the approximation model deteriorate its efficiency from the practical point of view.

RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION

  • LEE, CHANG-OCK;PARK, JONGHO
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제24권2호
    • /
    • pp.161-197
    • /
    • 2020
  • Total variation minimization is standard in mathematical imaging and there have been numerous researches over the last decades. In order to process large-scale images in real-time, it is essential to design parallel algorithms that utilize distributed memory computers efficiently. The aim of this paper is to illustrate recent advances of domain decomposition methods for total variation minimization as parallel algorithms. Domain decomposition methods are suitable for parallel computation since they solve a large-scale problem by dividing it into smaller problems and treating them in parallel, and they already have been widely used in structural mechanics. Differently from problems arising in structural mechanics, energy functionals of total variation minimization problems are in general nonlinear, nonsmooth, and nonseparable. Hence, designing efficient domain decomposition methods for total variation minimization is a quite challenging issue. We describe various existing approaches on domain decomposition methods for total variation minimization in a unified view. We address how the direction of research on the subject has changed over the past few years, and suggest several interesting topics for further research.

인터넷 기반 근사 형상최적설계의 분산처리 (Distributed Process of Approximate Shape Optimization Based on the Internet)

  • 임오강;최은호;김우현
    • 한국전산구조공학회논문집
    • /
    • 제21권4호
    • /
    • pp.317-324
    • /
    • 2008
  • 대형 구조물에 대한 최적설계를 고려할 때 구조해석에 많은 시간과 노력이 소비된다. 한대의 개인용 컴퓨터에 의한 대형 구조물의 구조해석은 대용량의 기억장치와 많은 계산시간이 요구되므로 반복적 해석이 필요한 대형 구조물의 설계에 효율적으로 이용되기 어렵다. 따라서 본 논문에서는 이러한 문제의 대안으로 인터넷이 연결된 다수의 개인용 컴퓨터들로 고성능 병렬연산시스템을 구성하여 구조해석을 분산 처리하여 계산시간을 절감하였다. 아울러 반응표면의 근사를 위해 요구되는 구조해석을 상용 구조해석 어플리케이션으로 해결할 수 있다면 상용성이 확보되어 일반 구조물에 대하여도 반응표면법을 이용한 최적설계를 수행할 수 있을 것이다.

전문용어 인식 시스템을 위한 분산 병렬 처리 플랫폼 최적화 및 성능평가 (Optimization and Performance Analysis of Distributed Parallel Processing Platform for Terminology Recognition System)

  • 최윤수;이원구;이민호;최동훈;윤화묵;송사광;정한민
    • 한국콘텐츠학회논문지
    • /
    • 제12권10호
    • /
    • pp.1-10
    • /
    • 2012
  • 과학기술 문헌의 전문용어 인식 분야는 지금까지 다양한 통계적 방법론을 사용하여 용어 인식 정확률을 향상시키기 위하여 연구되어 왔다. 하지만 기존의 연구는 단일-코어 또는 단일 머신 상에서 수행되었기 때문에, 폭발적으로 증가하는 문헌들에 대한 실시간 분석 요구를 처리할 수 없는 상황에 직면하고 있다. 본 논문에서는 전문용어를 인식하는 과정에서 병목현상이 발생하는 작업을 '후보용어 추출 과정'의 언어처리부분과 '용어 가중치 할당 과정'에서 통계정보를 취합하는 부분으로 분류하고, 각 작업을 분산병렬 처리 기반의 맵리듀스 작업을 이용하여 해결하는 전문용어 인식 방법을 구현하고 실험하였다. 실험은 확장성과 분산 병렬 처리 환경 최적화 두 가지로 수행하였고, 첫 번째 실험에서 12개의 노드를 사용하여 분산 병렬 처리하였을 때 단일 머신을 사용한 경우보다 11.27배의 처리속도 향상을 보였다. 두 번째 실험에서 1)기본 환경, 2)복수 리듀서, 3)컴바이너, 4) 2)와 3)의 조합에 대하여 수행하였고, 3)컴바이너 사용이 가장 우수한 성능을 보여 주었다. 본 논문에서 구현된 전문용어 인식 시스템은 대용량 과학기술 문헌에 대한 지식 추출 작업속도 개선에 기여하였다.

Intelligent Control by Immune Network Algorithm Based Auto-Weight Function Tuning

  • Kim, Dong-Hwa
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2002년도 ICCAS
    • /
    • pp.120.2-120
    • /
    • 2002
  • In this paper auto-tuning scheme of weight function in the neural networks has been suggested by immune algorithm for nonlinear process. A number of structures of the neural networks are considered as learning methods for control system. A general view is provided that they are the special cases of either the membership functions or the modification of network structure in the neural networks. On the other hand, since the immune network system possesses a self organizing and distributed memory, it is thus adaptive to its external environment and allows a PDP (parallel distributed processing) network to complete patterns against the environmental situation. Also. It can provi..

  • PDF

Hybrid-Feature Extraction for the Facial Emotion Recognition

  • Byun, Kwang-Sub;Park, Chang-Hyun;Sim, Kwee-Bo;Jeong, In-Cheol;Ham, Ho-Sang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.1281-1285
    • /
    • 2004
  • There are numerous emotions in the human world. Human expresses and recognizes their emotion using various channels. The example is an eye, nose and mouse. Particularly, in the emotion recognition from facial expression they can perform the very flexible and robust emotion recognition because of utilization of various channels. Hybrid-feature extraction algorithm is based on this human process. It uses the geometrical feature extraction and the color distributed histogram. And then, through the independently parallel learning of the neural-network, input emotion is classified. Also, for the natural classification of the emotion, advancing two-dimensional emotion space is introduced and used in this paper. Advancing twodimensional emotion space performs a flexible and smooth classification of emotion.

  • PDF

A Parallel Branch-and-Bound Method for the Traveling Salesman Problem and Its Implementation on a Network of PCs

  • Shigei, Noritaka;Okumura, Mitsunari;Miyajima, Hiromi
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -2
    • /
    • pp.1070-1073
    • /
    • 2002
  • This study presents a parallel branch-and-bound (PBAB) method for traveling salesman problem (TSP). The PBAB method adopts intermediate form of central control and distributed control in terms of the lightness of the master process's role. Compared with fully distributed control, the control scheme involves less concentration of communication on the master. Moreover, in order to reduce the influence of communication, the worker is composed of a computation thread and a communication thread. The multithreadness realizes the almost blocking free communications on the master. We implement the proposed PBAB method on a network of PCs, which consists of one master and up to 16 workers. We experiment five TSP instances. The results shows that the efficiency increases with the problem size.

  • PDF

협업 환경 기반 엔지니어링 해석 서비스 시스템 개발 (Web-based CAE Service System for Collaborative Engineering Environment)

  • 김기일;권기억;박지형;최영;조성욱
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2006년도 춘계학술대회 논문집
    • /
    • pp.619-620
    • /
    • 2006
  • In this paper, the CAE Service System for Collaborative Engineering Environment with web services and Multi-frontal Method has been investigated and developed. The enabling technologies such as SOAP and .NET Framework play great roles in the development of integrated distributed application software. In addition to the distribution of analysis modules, numerical solution process itself is again divided into parallel processes using Multi-frontal Method for computational efficiency. We believe that the proposed approach for the analysis can be extended to the entire product development process for sharing and utilizing common product data in the distributed engineering environment.

  • PDF

PC 클러스터를 위한 정렬 중첩 격자의 병렬처리 (PARALLEL IMPROVEMENT IN STRUCTURED CHIMERA GRID ASSEMBLY FOR PC CLUSTER)

  • 김유진;권장혁
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 2005년도 추계 학술대회논문집
    • /
    • pp.157-162
    • /
    • 2005
  • Parallel implementation and performance assessment of the grid assembly in a structured chimera grid approach is studied. The grid assembly process, involving hole cutting and searching donor, is parallelized on the PC cluster. A message passing programming model based on the MPI library is implemented using the single program multiple data(SPMD) paradigm. The coarse-grained communication is optimized with the minimized memory allocation because that the parallel grid assembly can access the decomposed geometry data in other processors by only message passing in the distributed memory system such as a PC cluster. The grid assembly workload is based on the static load balancing tied to flow solver. A goal of this work is a development of parallelized grid assembly that is suited for handling multiple moving body problems with large grid size.

  • PDF