• 제목/요약/키워드: parallel processing

검색결과 2,102건 처리시간 0.034초

MPI를 이용한 PSC 프레임 비선형해석 프로그램의 병렬화 (Parallel Implementation of Nonlinear Analysis Program of PSC Frame Using MPI)

  • 이재석;최규천
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2001년도 봄 학술발표회 논문집
    • /
    • pp.61-68
    • /
    • 2001
  • A parallel nonlinear analysis program of prestressed concrete frame is migrated on a PC cluster system and a massively parallel processing system, CRAY T3E system, using MPI. The PC cluster system is configured with Pentium Ⅲ class PCs and fast ethernet. The CRAY T3E system is composed of a set of nodes each containing one Processing Element (PE), a memory subsystem and its distributed memory interconnect network. Parallel computing algorithms are implemented on element-wise processing parts including the calculation of stiffness matrix, element stresses and determination of material states, check of material failure and calculation of unbalanced loads. Parallel performance of the migrated program is evaluated through typical numerical examples.

  • PDF

A Systolic Parallel Simulation System for Dynamic Traffic Assignment : SPSS-DTA

  • Park, Kwang-Ho;Kim, Won-Kyu
    • 지능정보연구
    • /
    • 제6권1호
    • /
    • pp.113-128
    • /
    • 2000
  • This paper presents a first year report of an ongoing multi-year project to develop a systolic parallel simulation system for dynamic traffic assignment. The fundamental approach to the simulation is systolic parallel processing based on autonomous agent modeling. Agents continuously act on their own initiatives and access to database to get the status of the simulation world. Various agents are defined in order to populate the simulation world. In particular existing modls and algorithm were incorporated in designing the behavior of relevant agents such as car-following model headway distribution Frank-Wolf algorithm and so on. Simulation is based on predetermined routes between centroids that are computed off-line by a conventional optimal path-finding algorithm. Iterating the cycles of optimization-then-simulation the proposed system will provide a realistic and valuable traffic assignment. Gangnum-Gu district in Seoul is selected for the target are for the modeling. It is expected that realtime traffic assignment services can be provided on the internet within 3 years.

  • PDF

Distributed Collision-Resolvable Medium Access Control for Wireless LANs with Interference Cancellation Support

  • Shen, Hu;Lv, Shaohe;Wang, Xiaodong;Zhou, Xingming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권8호
    • /
    • pp.2691-2707
    • /
    • 2014
  • Medium access control is critical in wireless networks for efficient spectrum utilization. In this paper, we introduce a novel collision resolution method based on the technique of known interference cancellation, and propose a new MAC protocol named as CR-MAC, in which AP tries to decode all the collided data packets by combining partial retransmissions and known interference cancellation. As the collided transmissions are fully utilized, less retransmission is required, especially in a crowded network. The NS-2simulation and MATLAB numerical results show that, under various network settings, CR-MAC performs much better than the IEEE 802.11 DCF in terms of the aggregation throughput and the expected packet delay.

이산 선형 시불변시스템에 대한 병렬칼만필터 (A Parallel Kalman Filter for Discrete Linear Time-invariant System)

  • 김용준;이장규;김형중
    • 산업기술연구
    • /
    • 제10권
    • /
    • pp.15-20
    • /
    • 1990
  • A parallel processing algorithm for discrete Kalman filter, which is one of the most commonly used filtering technique in modern control, signal processing, and communication, is proposed. Previously proposed parallel algorithms to decrease the number of computations needed in the Kalman filter are the hierachical structures by distributed processing of measurements, or the systolic structures to disperse the computational burden. In this paper, a new parallel Kalman filter employing a structure similar to recursive doubling is proposed. Estimated values of state variables by the new algorithm converge with two times faster data processing speed than that of the conventional Kalman filter. Moreover it maintains the optimality of the conventional Kalman filter.

  • PDF

병렬 처리를 이용한 3차원 데토네이션 파 구조 해석 (STUDY OF THREE-DIMENSIONAL DETONATION WAVE STRUCTURES USING PARALLEL PROCESSING)

  • 조덕래;최정열
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 2005년도 추계 학술대회논문집
    • /
    • pp.151-155
    • /
    • 2005
  • Three-dimensional structures of unsteady detonation wave propagating through a square-shaped tube is studied using computational method and parallel processing. Inviscid fluid dynamics equations coupled with variable-${\gamma}$ formulation and simplified one-step Arrhenius chemical reaction model were analysed by a MUSCL-type TVD scheme and four stage Runge-Kutta time integration. Results in three dimension show the two unsteady detonation wave propagating mode, the Rectangular and diagonal mode of detonation wave instabilities. Two different modes of instability showed the same cell length but different cell width and the geometric similarities in smoked-foil record.

  • PDF

병렬 처리를 이용한 3차원 테토네이션 파 수치해석 (NUMERICAL STUDY OF THREE-DIMENSIONAL DETONATION WAVES USING PARALLEL PROCESSING)

  • 조덕래;최정열
    • 한국연소학회:학술대회논문집
    • /
    • 한국연소학회 2005년도 제31회 KOSCO SYMPOSIUM 논문집
    • /
    • pp.15-19
    • /
    • 2005
  • Three-dimensional structures of unsteady detonation wave propagating through a square-shaped tube is studied using computational method and parallel processing. Inviscid fluid dynamics equations coupled with variable-${\gamma}$ formulation and simplified one-step Arrhenius chemical reaction model were analysed by a MUSCL-type TVD scheme and four stage Runge-Kutta time integration. Results in three dimension show the two unsteady detonation wave propagating mode, the Rectangular and diagonal mode of detonation wave instabilities. Two different modes of instability showed the same cell length but different cell width and the geometric similarities in smoked-foil record.

  • PDF

MLP 신경망을 위한 시공간 병렬처리모델 (A Spatiotemporal Parallel Processing Model for the MLP Neural Network)

  • 김성완
    • 한국컴퓨터정보학회논문지
    • /
    • 제10권5호
    • /
    • pp.95-102
    • /
    • 2005
  • 본 논문에서는 MLP신경망의 패턴 학습과정을 위하여 시공간 병렬성을 고려한 병렬처리모델을 제시한다. 시간 병렬성을 위한 학습집합 분할과 공간 병렬성을 위한 네트워크 분할을 동시 적용하여 융통성있는 병렬처리모델을 설계하고자 하였다. 성능평가모델로부터 해석적으로 구한 결과, 대규모 과제라고 해도 패턴 크기와 패턴 갯수 중 어느 쪽이 지배적이냐에 따라 분할병렬처리 방법이 절충되어야 할 것으로 본다.

  • PDF

아날로그 셀룰라 병렬 처리 회로망(CPPN)을 이용한 Pattern Classification (Pattern Classification with the Analog Cellular Parallel Processing Networks)

  • 오태완;이혜정;김형석
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
    • /
    • pp.2367-2370
    • /
    • 2003
  • A fast pattern classification algorithm with Cellular Parallel Processing Network-based dynamic programming is proposed. The Cellular Parallel Processing Networks is an analog parallel processing architecture and the dynamic programming is an efficient computation algorithm for optimization problem. Combining merits of these two technologies, fast Pattern classification with optimization is formed. On such CPPN-based dynamic programming, if exemplars and test patterns are presented as the goals and the start positions, respectively, the optimal paths from test patterns to their closest exemplars are found. Such paths are utilized as aggregating keys for the classification. The pattern classification is performed well regardless of degree of the nonlinearity in class borders.

  • PDF

다중 컴퓨터 망에서 신경회로망 설계를 위한 고속병렬처리 시스템의 구현 (An Implementation of High-Speed Parallel Processing System for Neural Network Design by Using the Multicomputer Network)

  • 김진호;최흥문
    • 전자공학회논문지B
    • /
    • 제30B권5호
    • /
    • pp.120-128
    • /
    • 1993
  • In this paper, an implementation of high-speed parallel processing system for neural network design on the multicomputer network is presented. Linear speedup expandability is increased by reducing the synchronization penalty and the communication overhead. Also, we presented the parallel processing models and their performance evaluation models for each of the parallization methods of the neural network. The results of the experiments for the character recognition of the neural network bases on the proposed system show that the proposed approach has the higher linear speedup expandability than the other systems. The proposed parallel processing models and the performance evaluation models could be used effectively for the design and the performance estimation of the neural network on the multicomputer network.

  • PDF

이산 칼만 필터의 병렬처리 구조 (A Parallel Processing Structure for the Discrete Kalman Filter)

  • 김용준;이장규;김병중
    • 대한전기학회논문지
    • /
    • 제39권10호
    • /
    • pp.1057-1065
    • /
    • 1990
  • A parallel processing algorithm for the discrete Kalman filter, which is one of the most commonly used filtering techniques in modern control, signal processing, and communication, is proposed. To decrease the number of computations critical in the Kalman filter, previously proposed parallel algorithms are of the hierarchical structure by distributed processing of measurements, or of the systolic structure to disperse the computational burden. In this paper, a new parallel Kalman filter employing a structure similar to recursive doubling is proposed. Estimated valuse of state variables by the new algorithm converge faster to the true values because the new algorithm can process data twice faster than the conventional Kalman filter. Moreover, it maintains the optimality of the conventional Kalman filter.

  • PDF