• Title/Summary/Keyword: message-passing

Search Result 296, Processing Time 0.028 seconds

MMA: Multi-modal Message Aggregation for Korean VQA (MMA: 한국어 시각적 질의응답을 위한 멀티 모달 메시지 통합)

  • Park, Sungjin;Park, Chanjun;Seo, Jaehyung;Lim, Heuiseok
    • Annual Conference on Human and Language Technology
    • /
    • 2020.10a
    • /
    • pp.468-472
    • /
    • 2020
  • 시각적 질의응답(Visual Question Answering, VQA)은 주어진 이미지에 연관된 다양한 질문에 대한 올바른 답변을 예측하는 기술이다. 해당 기술은 컴퓨터 비전-자연어 처리 연구분야에서 활발히 연구가 진행되고 있으며, 질문의 의도를 정확히 파악하고, 주어진 이미지에서 관련 단서 정보를 찾는 것이 중요하다. 또한, 서로 이질적인 특성을 지닌 정보(이미지 객체, 객체 위치, 질문)를 통합하는 과정도 중요하다. 본 논문은 질문의 의도에 알맞은 정보를 효율적으로 사용하기 위해 멀티 모달 입력 이미지 객체, 객체 위치, 질문)에 대한 Multi-modal Message Aggregation (MMA) 제안하며 이를 통해 한국어 시각적 질의응답 KVQA에서 다른 모델보다 더 좋은 성능을 확인하였다.

  • PDF

Fault-Tolerant Parallel Applications in Java Message Passing Systems (자바 메시지 전달 시스템에서의 결함 포용 병렬 애플리케이션)

  • 안진호;김기범;김정훈;황종선
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.768-770
    • /
    • 1998
  • 동기적 검사점(synchronous checkpoiting)기법, 인과적 메시지 로깅(causal message logging)과 향상된 회복 비동기성(improved asynchronism during recovery)을 제공하는 복귀회복(rollback recovery) 기법을 적용하여 자바 메시지 전달 시스템(java massage passing system)에서 수행하는 병렬 에플리케이션들에게 저 비용의 결함 포용성에 따라, 통신망으로 연결된 이질형 (fault-tolerance)(heterogeneous) 컴퓨터들을 이용하는 대규모 분산 시스템들은 아주 효율적인 병렬 컴퓨팅 환경을 제공해준다. 그러나, 이러한 분산 시스템들의 규모가 커짐에 따라 고장률 (failure rate)도 그 만큼 중요하게 된다. 따라서, 고장률이 높은 대규모 분산 시스템들에게 좀더 효율적인 결함 포용성을 제공하는 기법들이 필요하다. 또한, 대규모분산 시스템들은 이질형 컴퓨터들로 구성되어 있기 때문에, 결함 포용성을 제공하는 소프트웨어 패키지들은 플랫폼 독립적(platform independent)이어야 한다. 이러한 문제점은 높은 이식성(portability)을 가지고 있는 자바 언어로 구현함으로써 해결될 수 있다. 따라서, 본 논문은 자바 메시지 전달 시스템에서 수행되는 병렬 애플리케이션들에게 동기적 검사점 기법, 인과적 메시지 로깅과 향상된 비동기성을 제공하는 복귀회복 기법을 높은 이식성을 가진 자바언어로 구현하여 저 비용으로 결함 포용성을 제공하고자 한다.

  • PDF

NUMERICAL ANALYSIS OF THREE-DIMENSIONAL SUBSONIC TURBULENT CAVITY FLOWS (3차원 아음속 난류 공동 유동에 대한 수치적 연구)

  • Choi, Hong-Il;Kim, Jae-Soo
    • Journal of computational fluids engineering
    • /
    • v.13 no.1
    • /
    • pp.35-40
    • /
    • 2008
  • Generally flight vehicles have many cavities such as wheel wells, bomb bays and windows on their external surfaces and the flow around these cavities makes separation, vortex, shock and expansion waves, reattachment and other complex flow phenomenon. The flow around the cavity makes abnormal and three-dimensional noise and vibration even thought the aspect ratio (L/D) is small. The cavity giving large effects to the flow might make large noise, cause structural damage or breakage, harm the aerodynamic performance and stability, or damage the sensitive devices. In this 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 MPI(Message Passing Interface) parallelized code was used for calculations by PC-cluster. The cavity has the aspect ratios of 2.5, 3.5 and 4.5 with the W/D ratio of 2 for three-dimensional cavities. The Sound Pressure Level (SPL) analysis was done with FFT to check the dominant frequency of the cavity flow. The dominant frequencies were analyzed and compared with the results of Rossiter's formula and Ahuja& Mendoza's experimental datum.

A Java-based Performance Monitor for Networked Computer (네트워크 컴퓨터를 위한 자바 기반의 성능감시기)

  • Kim, Bong-Jun;Kim, Dong-Ho;Hwang, Seog-Chan;Kim, Myung-Ho;Choi, Jae-Young
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.2
    • /
    • pp.160-168
    • /
    • 2000
  • In this paper, we present a performance monitor to trace and evaluate the performance of programs running on networked computers. The performance monitor of the JaNeC is online/batch as well as event/time driven. Since it is implemented with the Java programming language, it provides us with high portability among heterogeneous computer systems, and friendly graphical user interface. This performance monitor consists of various views such as 'Task/Event Filter' and 'TimeLine', 'Task View', 'Task Hoistory', 'Message Passing View', 'Host Cpu View', which allow the user to easily analyze event and time during the program execution.

  • PDF

Soft-Input Soft-Output Multiple Symbol Detection for Ultra-Wideband Systems

  • Wang, Chanfei;Gao, Hui;Lv, Tiejun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.7
    • /
    • pp.2614-2632
    • /
    • 2015
  • A multiple symbol detection (MSD) algorithm is proposed relying on soft information for ultra-wideband systems, where differential space-time block code is employed. The proposed algorithm aims to calculate a posteriori probabilities (APP) of information symbols, where a forward and backward message passing mechanism is implemented based on the BCJR algorithm. Specifically, an MSD metric is analyzed and performed for serving the APP model. Furthermore, an autocorrelation sampling is employed to exploit signals dependencies among different symbols, where the observation window slides one symbol each time. With the aid of the bidirectional message passing mechanism and the proposed sampling approach, the proposed MSD algorithm achieves a better detection performance as compared with the existing MSD. In addition, when the proposed MSD is exploited in conjunction with channel decoding, an iterative soft-input soft-output MSD approach is obtained. Finally, simulations demonstrate that the proposed approaches improve detection performance significantly.

Efficient Scientific Computation on WP Parallel Computer (MP 병렬컴퓨터에서 효과적인 과학계산의 수행)

  • 김선경
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.8 no.4
    • /
    • pp.26-30
    • /
    • 2003
  • The Lanczos algorithm is the most commonly used in approximating a small number of extreme eigenvalues for symmetric large sparse matrices. Global communications in MP(Message Passing) parallel computer decrease the computation speed. In this paper, we introduce the s-step Lanczos method, and s-step method generates reduction matrices which are similar to reduction matrices generated by the standard Lanczos method. One iteration of the s-step Lanczos algorithm corresponds to s iterations of the standard Lanczos algorithm. The s-step method has the minimized global communication and has the superior parallel properties to the standard method. These algorithms are implemented on Cray T3E and performance results are presented.

  • PDF

Initial Design Domain Reset Method for Genetic Algorithm with Parallel Processing

  • Lim, O-Kaung;Hong, Keum-Shik;Lee, Hyuk-Soo;Park, Eun-Ho
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.7
    • /
    • pp.1121-1130
    • /
    • 2004
  • The Genetic Algorithm (GA), an optimization technique based on the theory of natural selection, has proven to be a relatively robust means of searching for global optimum. It converges to the global optimum point without auxiliary information such as differentiation of function. In the case of a complex problem, the GA involves a large population number and requires a lot of computing time. To improve the process, this research used parallel processing with several personal computers. Parallel process technique is classified into two methods according to subpopulation's size and number. One is the fine-grained method (FGM), and the other is the coarse-grained method (CGM). This study selected the CGM as a parallel process technique because the load is equally divided among several computers. The given design domain should be reduced according to the degree of feasibility, because mechanical system problems have constraints. The reduced domain is used as an initial design domain. It is consistent with the feasible domain and the infeasible domain around feasible domain boundary. This parallel process used the Message Passing Interface library.

MPI-GWAS: a supercomputing-aided permutation approach for genome-wide association studies

  • Paik, Hyojung;Cho, Yongseong;Cho, Seong Beom;Kwon, Oh-Kyoung
    • Genomics & Informatics
    • /
    • v.20 no.1
    • /
    • pp.14.1-14.4
    • /
    • 2022
  • Permutation testing is a robust and popular approach for significance testing in genomic research that has the advantage of reducing inflated type 1 error rates; however, its computational cost is notorious in genome-wide association studies (GWAS). Here, we developed a supercomputing-aided approach to accelerate the permutation testing for GWAS, based on the message-passing interface (MPI) on parallel computing architecture. Our application, called MPI-GWAS, conducts MPI-based permutation testing using a parallel computing approach with our supercomputing system, Nurion (8,305 compute nodes, and 563,740 central processing units [CPUs]). For 107 permutations of one locus in MPI-GWAS, it was calculated in 600 s using 2,720 CPU cores. For 107 permutations of ~30,000-50,000 loci in over 7,000 subjects, the total elapsed time was ~4 days in the Nurion supercomputer. Thus, MPI-GWAS enables us to feasibly compute the permutation-based GWAS within a reason-able time by harnessing the power of parallel computing resources.

Location Management & Message Delivery Protocol for Multi-region Mobile Agents in Multi-region Environment (다중 지역 환경에서 이동 에이전트를 위한 위치 관리 및 메시지 전달 기법)

  • Choi, Sung-Jin;Baik, Maeng-Soon;Song, Ui-Sung;Hwang, Chong-Sun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.11
    • /
    • pp.545-561
    • /
    • 2007
  • Location management and message delivery protocol is fundamental to the further development of mobile agent systems in a multi-region mobile agent computing environment in order to control mobile agents and guarantee message delivery between them. However, previous works have some problems when they are applied to a multi-region mobile agent computing environment. First, the cost of location management and message delivery is increased relatively. Second, a tracking problem arises. finally, cloned mobile agents and parent-child mobile agents do not get dealt with respect to location management and message delivery. In this paper, we present a HB (Home-Blackboard) protocol, which is a new location management and message delivery protocol in a multi-region mobile agent computing environment. The HB protocol places a region server in each region and manages the location of mobile agents by using intra-region migration and inter-region migration. It also places a blackboard in each region server and delivers messages to mobile agents when a region server receives location update form them. The HB protocol can decrease the cost of location update and message passing and solve the tracking problem with low communication cost. Also, this protocol deals with the location management and message passing of cloned mobile agents and parent-child mobile agents, so that it can guarantee message delivery of these mobile agents and pass messages without passing duplicate messages.

A Dynamic Co-scheduling Scheme for MPI-based Parallel Programs on Linux Clusters (리눅스 클러스터에서 MPI 기반 병렬 프로그램의 동적 동시 스케줄링 기법)

  • Kim, Hyuk;Rhee, Yun-Seok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.1
    • /
    • pp.29-35
    • /
    • 2008
  • For efficient message passing of Parallel programs, it is required to schedule the involved two processes at the same time which are executed on different nodes, that is called 'co-scheduling' However, each node of cluster systems is built on top of general purpose multitasking OS. which autonomously manages local Processes. Thus it is not so easy to co-schedule two (or more) processes in such computing environment. Our work proposes a co-scheduling scheme for MPI-based parallel programs which exploits message exchange information between two parties. We implement the scheme on Linux cluster which requires slight kernel hacking and MPI library modification. The experiment with NPB parallel suite shows that our scheme results in 33-56% reduction in the execution time compared to the typical scheduling case. and especially better Performance in more communication-bound applications.

  • PDF