• 제목/요약/키워드: Parallel computing model

검색결과 172건 처리시간 0.025초

병렬 유한요소 모형을 이용한 황해의 실시간 조석 및 태풍해일 산정 (Realtime Tide and Storm-Surge Computations for the Yellow Sea Using the Parallel Finite Element Model)

  • 변상신;최병호;김경옥
    • 한국군사과학기술학회지
    • /
    • 제12권1호
    • /
    • pp.29-36
    • /
    • 2009
  • Realtime tide and storm-surge computations for the Yellow Sea were conducted using the Parallel Finite Element Model. For these computations a high resolution grid system was constructed with a minimum node interval of loom in Gyeonggi Bay. In the modeling, eight main tidal constituents were analyzed and their results agreed well with the observed data. The realtime tide computation with the eight main tidal constituents and the storm-surge simulation for Typhoon Sarah(1959) were also conducted using parallel computing system of MPI-based LINUX clusters. The result showed a good performance in simulating Typhoon Sarah and reducing the computation time.

자바를 기반으로 한 글로벌 인터넷 컴퓨팅 환경 (Global Internet Computing Environment based on Java)

  • 김희철;신필섭;박영진;이용두
    • 한국정보처리학회논문지
    • /
    • 제6권9호
    • /
    • pp.2320-2331
    • /
    • 1999
  • 본 연구에서는 한정된 자원만을 사용하는 기존의 워크스테이션 클러스터링 환경의 제한성을 극복하기 위하여 인터넷에 연결된 혼합 이기종 컴퓨터들을 병렬 컴퓨팅 플랫폼으로 활용하고자 하는 인터넷 컴퓨팅 환경의 구축 기법을 제안한다. 제안하는 글로벌 인터넷 컴퓨팅 환경(Global Internet Computing Environment)은 프로그램의 용이성, 이기종 지원의 효율성, 시스템의 확장성, 그리고 시스템 성능에 초점을 두고 자바를 프로그래밍 및 수행 환경으로 채택하여 인터넷 컴퓨팅 구축에 있어 필수적인 동적 자원 중계 및 관리, 효율적인 병렬 테스크 수행 기법을 제시한다. 본 논문에서는 제안하는 글로벌 인터넷 컴퓨팅 환경의 구성모델 및 동작모델 그리고 시험시스템 구축 내용 및 벤치마킹을 통한 성능 평가 결과를 제시하며 이를 바탕으로 인터넷 컴퓨팅 환경의 구축 개념, 복잡성, 성능의 문제에 대한 분석결과를 기술한다.

  • PDF

Parallel damage detection through finite frequency changes on multicore processors

  • Messina, Arcangelo;Cafaro, Massimo
    • Structural Engineering and Mechanics
    • /
    • 제63권4호
    • /
    • pp.457-469
    • /
    • 2017
  • This manuscript deals with a novel approach aimed at identifying multiple damaged sites in structural components through finite frequency changes. Natural frequencies, meant as a privileged set of modal data, are adopted along with a numerical model of the system. The adoption of finite changes efficiently allows challenging characteristic problems encountered in damage detection techniques such as unexpected comparison of possible shifted modes and the significance of modal data changes very often affected by experimental/environmental noise. The new procedure extends MDLAC and exploits parallel computing on modern multicore processors. Smart filters, aimed at reducing the potential damaged sites, are implemented in order to reduce the computational effort. Several use cases are presented in order to illustrate the potentiality of the new damage detection procedure.

A PARALLEL ALGORITHM FOR CONSTRUCTING THE CONVEX-HULL OF A SIMPLE POLYGON

  • Min, Young-Sik;Lee, Kyeong-Sin
    • Journal of applied mathematics & informatics
    • /
    • 제6권1호
    • /
    • pp.279-289
    • /
    • 1999
  • Given n points in the plane the planar convex hull prob-lem in that of finding which of these points belong to the perimeter of the smallest convex region (a polygon) containing all n points. Here we suggest two kinds of methods. First we present a new sequential method for constructing the pla-nar convex hull O(1.5n) time in the quadratic decision tree model. Second using the sequential method we suggest a new parallel algo-rithm which solve the planar convex hull O(1.5n/p) time on a maspar Machine (CREW-PRAM) with O(n) processors. Also when we run on a maspar Machine we achieved a 37. 156-fold speedup with 64 pro-cessor.

Hopfield neuron based nonlinear constrained programming to fuzzy structural engineering optimization

  • Shih, C.J.;Chang, C.C.
    • Structural Engineering and Mechanics
    • /
    • 제7권5호
    • /
    • pp.485-502
    • /
    • 1999
  • Using the continuous Hopfield network model as the basis to solve the general crisp and fuzzy constrained optimization problem is presented and examined. The model lies in its transformation to a parallel algorithm which distributes the work of numerical optimization to several simultaneously computing processors. The method is applied to different structural engineering design problems that demonstrate this usefulness, satisfaction or potential. The computing algorithm has been given and discussed for a designer who can program it without difficulty.

A Methodology for Task placement and Scheduling Based on Virtual Machines

  • Chen, Xiaojun;Zhang, Jing;Li, Junhuai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권9호
    • /
    • pp.1544-1572
    • /
    • 2011
  • Task placement and scheduling are traditionally studied in following aspects: resource utilization, application throughput, application execution latency and starvation, and recently, the studies are more on application scalability and application performance. A methodology for task placement and scheduling centered on tasks based on virtual machines is studied in this paper to improve the performances of systems and dynamic adaptability in applications development and deployment oriented parallel computing. For parallel applications with no real-time constraints, we describe a thought of feature model and make a formal description for four layers of task placement and scheduling. To place the tasks to different layers of virtual computing systems, we take the performances of four layers as the goal function in the model of task placement and scheduling. Furthermore, we take the personal preference, the application scalability for a designer in his (her) development and deployment, as the constraint of this model. The workflow of task placement and scheduling based on virtual machines has been discussed. Then, an algorithm TPVM is designed to work out the optimal scheme of the model, and an algorithm TEVM completes the execution of tasks in four layers. The experiments have been performed to validate the effectiveness of time estimated method and the feasibility and rationality of algorithms. It is seen from the experiments that our algorithms are better than other four algorithms in performance. The results show that the methodology presented in this paper has guiding significance to improve the efficiency of virtual computing systems.

항공기 Wing-box 구조해석을 위한 비선형 쉘 유한요소 및 병렬계산 기법 개발 (Nonlinear Shell Finite Element and Parallel Computing Algorithm for Aircraft Wing-box Structural Analysis)

  • 김혜진;김성환;홍지우;조해성
    • 한국항공우주학회지
    • /
    • 제48권8호
    • /
    • pp.565-571
    • /
    • 2020
  • 본 논문에서는 항공기 Wing-box 모델에 대한 비선형 구조해석의 계산을 정확하고 효율적으로 수행하기 위해 병렬계산 알고리즘을 개발하였다. 이를 위해 co-rotation 이론 기반 비선형 쉘 요소를 적용하였으며 요소기반 분할 병렬계산 알고리즘을 개발하였다. 기 개발 해석은 선행연구결과 및 기존 상용프로그램의 예측결과와 비교하여 정확성을 확인하였으며 병렬계산의 효율성을 분석하였다. 마지막으로 고세장비 날개 wing-box 구조에 적용하였으며 단방향 공력-구조 결합해석을 수행하였다.

A Container Orchestration System for Process Workloads

  • Jong-Sub Lee;Seok-Jae Moon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제15권4호
    • /
    • pp.270-278
    • /
    • 2023
  • We propose a container orchestration system for process workloads that combines the potential of big data and machine learning technologies to integrate enterprise process-centric workloads. This proposed system analyzes big data generated from industrial automation to identify hidden patterns and build a machine learning prediction model. For each machine learning case, training data is loaded into a data store and preprocessed for model training. In the next step, you can use the training data to select and apply an appropriate model. Then evaluate the model using the following test data: This step is called model construction and can be performed in a deployment framework. Additionally, a visual hierarchy is constructed to display prediction results and facilitate big data analysis. In order to implement parallel computing of PCA in the proposed system, several virtual systems were implemented to build the cluster required for the big data cluster. The implementation for evaluation and analysis built the necessary clusters by creating multiple virtual machines in a big data cluster to implement parallel computation of PCA. The proposed system is modeled as layers of individual components that can be connected together. The advantage of a system is that components can be added, replaced, or reused without affecting the rest of the system.

영역분할법과 유한요소해석을 이용한 유동장의 병렬계산 (Parallel Computation of a Flow Field Using FEM and Domain Decomposition Method)

  • 최형권;김범준;강성우;유정열
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2002년도 학술대회지
    • /
    • pp.55-58
    • /
    • 2002
  • Parallel finite element code has been recently developed for the analysis of the incompressible Wavier-Stokes equations using domain decomposition method. Metis and MPI libraries are used for the domain partitioning of an unstructured mesh and the data communication between sub-domains, respectively. For unsteady computation of the incompressible Navier-Stokes equations, 4-step splitting method is combined with P1P1 finite element formulation. Smagorinsky and dynamic model are implemented for the simulation of turbulent flows. For the validation performance-estimation of the developed parallel code, three-dimensional Laplace equation has been solved. It has been found that the speed-up of 40 has been obtained from the present parallel code fir the bench mark problem. Lastly, the turbulent flows around the MIRA model and Tiburon model have been solved using 32 processors on IBM SMP cluster and unstructured mesh. The computed drag coefficient agrees better with the existing experiment as the mesh resolution of the region increases, where the variation of pressure is severe.

  • PDF