• Title/Summary/Keyword: OpenMP

Search Result 178, Processing Time 0.022 seconds

Implementation of augmented reality using parallel structure (병렬구조를 이용한 증강현실 구현)

  • Park, Tae-Ryong;Heo, Hoon;Kwak, Jae-Chang
    • Journal of IKEEE
    • /
    • v.17 no.3
    • /
    • pp.371-377
    • /
    • 2013
  • This thesis propose an efficient parallel structure method for implementing a FAST and BRIEF algorithm based Augmented Reality. SURF algorithm that is well known in the object recognition algorithms is robust in object recognition. However, there is a disadvantage for real time operation because, SURF implementation requires a lot of computation. Therefore, we used a FAST and BRIEF algorithm for object recognition, and we improved Conventional Parallel Structure based on OpenMP Library. As a result, it achieves a 70%~100% improvement in execution time on the embedded system.

Interest-Information Monitoring System for Debugging of Parallel Programs (병렬 프로그램의 디버깅을 위한 관심정보 모니터링 시스템)

  • Park, Myeong-Chul
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.607-610
    • /
    • 2007
  • In this paper, proposes the monitoring system it will be able to trace the executed of each threads in OpenMP based a parallel program. The monitoring system of existing in uses each threads label information and the analysis technique which uses the access-history was most. This has the problem which raises the time and space complexity which is caused by with massive information creation. In this paper, only the thread which includes interest information it creates tracking information with the target. And it provides information which is intuitive to the user it provides the visualization system for to a same time. The visualization model is composed the images-information of a base. This does to be it will be able to understandable a program execute situation using an image processing technique. Therefore, this paper provides the parallel program an effective debugging environment.

  • PDF

CALPUFF Module Acceleration with OpenMP (OpenMP를 이용한 CALPUFF 모듈 가속화)

  • Yu, Suk-Hyun;Yang, Jin-Uk;Kim, Kyung-Ho;Youn, Hee-Young;Koo, Youn-Seo;Kwon, Hee-Yong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06c
    • /
    • pp.1-4
    • /
    • 2011
  • 악취 유발 사업장 및 지자체에서 사용하고 있는 악취 관리 모델링 시스템의 핵심 모듈을 최근 Intel에서 발표한 멀티코어(multi-core) 기술과 OpenMP 기술을 이용하여 고성능 병렬처리에 의한 실시간 시스템으로 개선하였다. 기존의 기상 모델인 CALMET 모델과 대기질 모델인 CALPUFF 모델은 배출원 갯수와 모델링 영역의 격자 갯수 증가에 따라 모델링 수행 시간이 기하급수적으로 증가한다. 악취는 그 특성상 모델링 수행시간을 짧게 할수록 악취모델링 결과를 효과적으로 사용할 수 있다. 따라서 모델링 수행시간을 단축하기 위해 여러 개의 CPU Core를 동시에 사용하여 병렬로 작업을 처리하는 멀티코어 기술을 접목하여, 기존의 CALPUFF를 실시간 모델링이 가능한 고성능 모델링 시스템으로 개발하였다. 실험 결과 Core의 수가 증가하면 Amdahl의 법칙에 준하여 가속화되었다.

VDI Performance Optimization with Hybrid Parallel Processing in Thick Client System under Heterogeneous Multi-Core Environment (Heterogeneous 멀티 코어 환경의 Thick Client에서 VDI 성능 최적화를 위한 혼합 병렬 처리 기법 연구)

  • Kim, Myeong-Seob;Huh, Eui-Nam
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.3
    • /
    • pp.163-171
    • /
    • 2013
  • Recently, the requirement of processing High Definition (HD) video or 3D application on low, mobile devices has been expanded and content data has been increased as well. It is becoming a major issue in Cloud computing where a Virtual Desktop Infrastructure (VDI) Service needs efficient data processing ability to provide Quality of Experience (QoE) in Cloud computing. In this paper, we propose three kind of Thick-Thin VDI Service which can share and delegate VDI service based on Thick Client using CPU and GPU. Furthermore, we propose and discuss the VDI Service Optimization Method in mixed CPU and GPU Heterogeneous Environment using CPU Parallel Processing OpenMP and GPU Parallel Processing CUDA.

A Study on the Automatic Parallelization Method and Tool Development

  • Shin, Woochang
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.87-94
    • /
    • 2020
  • Recently, computer hardware is evolving toward increasing the number of computing cores, not increasing the clock speed. In order to use the performance of parallelized hardware to the maximum, the running program must also be parallelized. However, software developers are accustomed to sequential programs, and in most cases, write programs that operate sequentially. They also have a lot of difficulty designing and developing software in parallel. We propose a method to automatically convert a sequential C/C++ program into a parallelized program, and develop a parallelization tool that supports it. It supports open multiprocessing (OpenMP) and parallel patterns library (PPL) as a parallel framework. Perfect automatic parallelization is difficult due to dynamic features such as pointer operation and polymorphism in C/C++ language. This study focuses on verifying the conditions of parallelization rather than focusing on fully automatic parallelization, and providing advice to developers in detail if parallelization is not possible.

Hybrid Parallelization for High Performance of CFD_NIMR Model (기상 모델 CFD_NIMR의 최적 성능을 위한 혼합형 병렬 프로그램 구현)

  • Kim, Min-Wook;Choi, Young-Jean;Kim, Young-Tae
    • Atmosphere
    • /
    • v.22 no.1
    • /
    • pp.109-115
    • /
    • 2012
  • We parallelized the CFD_NIMR model, which is a numerical meteorological model, for best performance on both of distributed and shared memory parallel computers. This hybrid parallelization uses MPI (Message Passing Interface) to apply horizontal 2-dimensional sub-domain out of the 3-dimensional computing domain for distributed memory system, as well as uses OpenMP (Open Multi-Processing) to apply vertical 1-dimensional sub-domain for utilizing advantage of shared memory structure. We validated the parallel model with the original sequential model, and the parallel CFD_NIMR model shows efficient speedup on the distributed and shared memory system.

Performance Optimization of Parallel Algorithms

  • Hudik, Martin;Hodon, Michal
    • Journal of Communications and Networks
    • /
    • v.16 no.4
    • /
    • pp.436-446
    • /
    • 2014
  • The high intensity of research and modeling in fields of mathematics, physics, biology and chemistry requires new computing resources. For the big computational complexity of such tasks computing time is large and costly. The most efficient way to increase efficiency is to adopt parallel principles. Purpose of this paper is to present the issue of parallel computing with emphasis on the analysis of parallel systems, the impact of communication delays on their efficiency and on overall execution time. Paper focuses is on finite algorithms for solving systems of linear equations, namely the matrix manipulation (Gauss elimination method, GEM). Algorithms are designed for architectures with shared memory (open multiprocessing, openMP), distributed-memory (message passing interface, MPI) and for their combination (MPI + openMP). The properties of the algorithms were analytically determined and they were experimentally verified. The conclusions are drawn for theory and practice.

Performance Comparison of Parallel Programming Frameworks in Digital Image Transformation

  • Shin, Woochang
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.11 no.3
    • /
    • pp.1-7
    • /
    • 2019
  • Previously, parallel computing was mainly used in areas requiring high computing performance, but nowadays, multicore CPUs and GPUs have become widespread, and parallel programming advantages can be obtained even in a PC environment. Various parallel programming frameworks using multicore CPUs such as OpenMP and PPL have been announced. Nvidia and AMD have developed parallel programming platforms and APIs for program developers to take advantage of multicore GPUs on their graphics cards. In this paper, we develop digital image transformation programs that runs on each of the major parallel programming frameworks, and measure the execution time. We analyze the characteristics of each framework through the execution time comparison. Also a constant K indicating the ratio of program execution time between different parallel computing environments is presented. Using this, it is possible to predict rough execution time without implementing a parallel program.

Comparison of Parallel Computation Performances for 3D Wave Propagation Modeling using a Xeon Phi x200 Processor (제온 파이 x200 프로세서를 이용한 3차원 음향 파동 전파 모델링 병렬 연산 성능 비교)

  • Lee, Jongwoo;Ha, Wansoo
    • Geophysics and Geophysical Exploration
    • /
    • v.21 no.4
    • /
    • pp.213-219
    • /
    • 2018
  • In this study, we simulated 3D wave propagation modeling using a Xeon Phi x200 processor and compared the parallel computation performance with that using a Xeon CPU. Unlike the 1st generation Xeon Phi coprocessor codenamed Knights Corner, the 2nd generation x200 Xeon Phi processor requires no additional communication between the internal memory and the main memory since it can run an operating system directly. The Xeon Phi x200 processor can run large-scale computation independently, with the large main memory and the high-bandwidth memory. For comparison of parallel computation, we performed the modeling using the MPI (Message Passing Interface) and OpenMP (Open Multi-Processing) libraries. Numerical examples using the SEG/EAGE salt model demonstrated that we can achieve 2.69 to 3.24 times faster modeling performance using the Xeon Phi with a large number of computational cores and high-bandwidth memory compared to that using the 12-core CPU.

Change of the upper airway after mandibular setback surgery in patients with mandibular prognathism and anterior open bite

  • Lee, Kyungjin;Hwang, Soon Jung
    • Maxillofacial Plastic and Reconstructive Surgery
    • /
    • v.41
    • /
    • pp.51.1-51.8
    • /
    • 2019
  • Purpose: It has been reported before that the amount of pharyngeal airway space (PAS) significantly decreases following mandibular setback (MS) surgery in patients with mandibular prognathism (MP). Further, MP patients with an anterior open-bite (AOB) presentation may show a larger decrease in PAS compared with those without AOB. However, studies on postoperative PAS changes in MP patients with AOB remain rare. This study sought to evaluate changes in PAS and hyoid bone positioning following MS surgery in MP patients with and without AOB. Patients and methods: Twenty patients who underwent two jaw surgery involving MS movement were included. Patients were divided into a non-AOB group (n = 10; overbite > 2 mm) and an AOB group (n = 10; overbite < - 4 mm). Three-dimensional changes in PAS and hyoid bone positioning were compared and statistically evaluated pre- and postoperatively using computed tomography (CT). Results: The mean magnitude of MS was 6.0 ± 2.8 mm and 5.6 ± 3.2 mm in the non-AOB group and AOB group, respectively. The oropharyngeal volume and upper hypopharyngeal volume were significantly reduced after surgery in both the groups (p = 0.006 and p = 0.003), while the retroglossal cross-sectional area was significantly reduced only in the AOB group (p = 0.028). Although the AOB group showed a larger decrease in PAS, the difference was not statistically significant between the groups. The position of the hyoid bone showed significant posterior and inferior displacement only in the AOB group, while the vertical displacement of the hyoid bone showed a statistically significant difference between the two groups. Conclusion: PAS was significantly decreased after MS in both the groups, while only the AOB group presented a statistically significant reduction in the retroglossal cross-sectional area. Vertical displacement of the hyoid bone showed a statistically significant difference between the groups, while the PAS change was not. Surgeons should be aware of potential postoperative airway problems that may arise when performing MS surgeries.