• Title/Summary/Keyword: parallel communication

Search Result 1,115, Processing Time 0.029 seconds

Domain Decomposition Strategy for Pin-wise Full-Core Monte Carlo Depletion Calculation with the Reactor Monte Carlo Code

  • Liang, Jingang;Wang, Kan;Qiu, Yishu;Chai, Xiaoming;Qiang, Shenglong
    • Nuclear Engineering and Technology
    • /
    • v.48 no.3
    • /
    • pp.635-641
    • /
    • 2016
  • Because of prohibitive data storage requirements in large-scale simulations, the memory problem is an obstacle for Monte Carlo (MC) codes in accomplishing pin-wise three-dimensional (3D) full-core calculations, particularly for whole-core depletion analyses. Various kinds of data are evaluated and quantificational total memory requirements are analyzed based on the Reactor Monte Carlo (RMC) code, showing that tally data, material data, and isotope densities in depletion are three major parts of memory storage. The domain decomposition method is investigated as a means of saving memory, by dividing spatial geometry into domains that are simulated separately by parallel processors. For the validity of particle tracking during transport simulations, particles need to be communicated between domains. In consideration of efficiency, an asynchronous particle communication algorithm is designed and implemented. Furthermore, we couple the domain decomposition method with MC burnup process, under a strategy of utilizing consistent domain partition in both transport and depletion modules. A numerical test of 3D full-core burnup calculations is carried out, indicating that the RMC code, with the domain decomposition method, is capable of pin-wise full-core burnup calculations with millions of depletion regions.

A Study on the Full-HD HEVC Encoder IP Design (고해상도 비디오 인코더 IP 설계에 대한 연구)

  • Lee, Sukho;Cho, Seunghyun;Kim, Hyunmi;Lee, Jehyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.12
    • /
    • pp.167-173
    • /
    • 2015
  • This paper presents a study on the Full-HD HEVC(High Efficiency Video Coding) encoder IP(Intellectual Property) design. The designed IP is for HEVC main profile 4.1, and performs encoding with a speed of 60 fps of full high definition. Before hardware and software design, overall reference model was developed with C language, and we proposed a parallel processing architecture for low-power consumption. And also we coded firmware and driver programs relating IP. The platform for verification of developed IP was developed, and we verified function and performance for various pictures under several encoding conditions by implementing designed IP to FPGA board. Compared to HM-13.0, about 35% decrease in bit-rate under same PSNR was achieved, and about 25% decrease in power consumption under low-power mode was performed.

Digit-Serial Finite Field Multipliers for GF($3^m$) (GF($3^m$)의 Digit-Serial 유한체 곱셈기)

  • Chang, Nam-Su;Kim, Tae-Hyun;Kim, Chang-Han;Han, Dong-Guk;Kim, Ho-Won
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.10
    • /
    • pp.23-30
    • /
    • 2008
  • Recently, a considerable number of studies have been conducted on pairing based cryptosystems. The efficiency of pairing based cryptosystems depends on finite fields, similar to existing public key cryptosystems. In general, pairing based ctyptosystems are defined over finite fields of chracteristic three, GF($3^m$), based on trinomials. A multiplication in GF($3^m$) is the most dominant operation. This paper proposes a new most significant digit(MSD)-first digit- serial multiplier. The proposed MSD-first digit-serial multiplier has the same area complexity compared to previous multipliers, since the modular reduction step is performed in parallel. And the critical path delay is reduced from 1MUL+(log ${\lceil}n{\rceil}$+1)ADD to 1MUL+(log ${\lceil}n+1{\rceil}$)ADD. Therefore, when the digit size is not $2^k$, the time delay is reduced by one addition.

Study on Fashion Illustration as Viewed from the Allegorical - Based on the theory of Craig Owens - (알레고리 관점의 패션 일러스트레이션에 관한 연구 - 크렉 오웬스의 이론을 중심으로 -)

  • Kim, Mi-Hyun
    • Journal of the Korean Society of Costume
    • /
    • v.62 no.4
    • /
    • pp.81-90
    • /
    • 2012
  • The contents of this study are as follows. First, an academic understanding has been achieved by exploring the theoretical concept "allegory", and a new theoretical approached methodology has been sought. Second, an analysis-index of fashion illustration cases has been suggested based on the allegory theory of Craig Owens. Third, in order to draw the characteristics of fashion illustration as viewed from the allegorical viewpoint and find out its feasibility, the case studies has been referred and the internal significance, external significance that combines different characteristics has been extracted. In regards to this study method, literature studies and case studies has been done in parallel with each other. This study was done in the following sequence: the establishment of the study system, the drawing of the allegory-associated concepts and the discovering the characteristics of aesthetic expressions. The results of this study on the expression characteristics of fashion illustration as viewed from the allegorical viewpoint of Craig Owens are as follows. First, the borrowing of image, which is a characteristic of allegory, contains the meaning of uncertainty in the fashion illustration as it expresses the image-synthesis and forms a completely different meaning as the fixed meaning is dissolved and it is utilized as a photo-montage technique. Second, the inference of pictogram is the mixture of linguistic medium and visual medium. Fashion illustration utilizes the characters and transmits the fashion information visually and immanently. It has the characteristic of making the information into pictograms and the internal significances of mutual-text with communication function. Third, the uniqueness of location in the fashion illustration has the special nature of utilized mediums as it is used for advertising or publicizing. The fashion illustration from the viewpoint of allegory has the impermanency of existing only for a limited time and reflects the coincidence that gives the meaning of utilized location according to the season trend. Fourth, the cross-breeding is expressed as the mixture of various materials in the fashion illustration. The expressions made by the mixture of media, such as the use of computer graphic programs mixed together with various materials showed the trend of diversity and genre dissolution.

Development of Multiscale Modeling Methods Coupling Molecular Dynamics and Stochastic Rotation Dynamics (분자동역학과 확률회전동역학을 결합한 멀티스케일 모델링 기법 개발)

  • Cha, Kwangho;Jung, Youngkyun
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.10
    • /
    • pp.534-542
    • /
    • 2014
  • Multiscale modeling is a new simulation approach which can manage different spatial and temporal scales of system. In this study, as part of multiscale modeling research, we propose the way of combining two different simulation methods, molecular dynamics(MD) and stochastic rotation dynamics(SRD). Our conceptual implementations are based on LAMMPS, one of the well-known molecular dynamics programs. Our prototype of multiscale modeling follows the form of the third party implementation of LAMMPS. It added MD to SRD in order to simulate the boundary area of the simulation box. Because it is important to guarantee the seamless simulation, we also designed the overlap zones and communication zones. The preliminary experimental results showed that our proposed scheme is properly worked out and the execution time is also reduced.

Design and Implementation of a Mobile Runtime Library for Execution of Large-scale Application (대용량 소프트웨어 실행을 위한 모바일 런타임 라이브러리 설계 및 구현)

  • Lee, Ye-In;Lee, Jong-Woo
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.1
    • /
    • pp.1-9
    • /
    • 2010
  • Today's growth of the mobile communication infrastructure made mobile computing systems like cellular phones came next to or surpassed the desktop PCs in popularity due to their mobility. Although the performance of mobile devices is now being improved continuously, it is a current common sense that compute intensive large-scale applications can hardly run on any kind of mobile handset devices. To clear up this problem, we decided to exploit the mobile cluster computing system and surveyed the existing ones first. We found out, however, that most of them are not the actual implementations but a mobile cluster infrastructure proposal or idea suggestions for reliable mobile clustering. To make cell phones participated in cluster computing nodes, in this paper, we propose a redesigned JPVM cluster computing engine and a set of WIPI mobile runtime functions interfacing with it. And we also show the performance evaluation results of real parallel applications running on our Mobile-JPVM cluster computing systems. We find out by the performance evaluation that large-scale applications can sufficiently run on mobile devices such as cellular phones when using our mobile cluster computing engine.

Design of Reed-Solomon Decoder for High Speed Data Networks

  • Park, Young-Shig;Park, Heyk-Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.1
    • /
    • pp.170-178
    • /
    • 2004
  • In this work a high speed 8-error correcting Reed-Solomon decoder is designed using the modified Euclid algorithm. Decoding algorithm of Reed-Solomon codes consists of four steps, those are, compute syndromes, find error-location polynomials, decide error-locations, and determine error values. The decoding speed is increased and the latency is reduced by using the parallel architecture in the syndrome generator and a faster clock speed in the modified Euclid algorithm block. In addition. the error locator polynomial in Chien search block is separated into even and odd terms to increase the overall speed of the decoder. All the functionalities of the decoder are verified first through C++ programs. Verilog is used for hardware description, and then the decoder is synthesized with a $.25{\mu}m$ CMOS TML library. The functionalities of the chip is also verified through test vectors. The clock speed of the chip is 250MHz, and the maximum data rate is 1Gbps.

An Analysis of Factors Affecting Quality of Life through the Analysis of Public Health Big Data (클라우드 기반의 공개의료 빅데이터 분석을 통한 삶의 질에 영향을 미치는 요인분석)

  • Kim, Min-kyoung;Cho, Young-bok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.6
    • /
    • pp.835-841
    • /
    • 2018
  • In this study, we analyzed public health data analysis using the hadoop-based spack in the cloud environment using the data of the Community Health Survey from 2012 to 2014, and the factors affecting the quality of life and quality of life. In the proposed paper, we constructed a cloud manager for parallel processing support using Hadoop - based Spack for open medical big data analysis. And we analyzed the factors affecting the "quality of life" of the individual among open medical big data quickly without restriction of hardware. The effects of public health data on health - related quality of life were classified into personal characteristics and community characteristics. And multiple-level regression analysis (ANOVA, t-test). As a result of the experiment, the factors affecting the quality of life were 73.8 points for men and 70.0 points for women, indicating that men had higher health - related quality of life than women.

An Improved Depth-Based TDMA Scheduling Algorithm for Industrial WSNs to Reduce End-to-end Delay (산업 무선 센서 네트워크에서 종단 간 지연시간 감소를 위한 향상된 깊이 기반 TDMA 스케줄링 개선 기법)

  • Lee, Hwakyung;Chung, Sang-Hwa;Jung, Ik-Joo
    • Journal of KIISE
    • /
    • v.42 no.4
    • /
    • pp.530-540
    • /
    • 2015
  • Industrial WSNs need great performance and reliable communication. In industrial WSNs, cluster structure reduces the cost to form a network, and the reservation-based MAC is a more powerful and reliable protocol than the contention-based MAC. Depth-based TDMA assigns time slots to each sensor node in a cluster-based network and it works in a distributed manner. DB-TDMA is a type of depth-based TDMA and guarantees scalability and energy efficiency. However, it cannot allocate time slots in parallel and cannot perfectly avoid a collision because each node does not know the total network information. In this paper, we suggest an improved distributed algorithm to reduce the end-to-end delay of DB-TDMA, and the proposed algorithm is compared with DRAND and DB-TDMA.

A Study on a large-scale materials simulation using a PC networked cluster (PC Network Cluster를 사용한 대규모 재료 시뮬레이션에 관한 연구)

  • Choi, Deok-Kee;Ryu, Han-Kyu
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.30 no.5
    • /
    • pp.15-23
    • /
    • 2002
  • For molecular dynamics requires high-performance computers or supercomputers to handle huge amount of computation, it is not until recent days that the application of molecular dynamics to materials fracture simulations draw some attention from many researchers. With the recent advent of high-performance computers, computation intensive methods become more tractable than ever. However, carrying out materials simulation on high-performance computers costs too much in general. In this study, a PC cluster consisting of multiple commodity PCs is established and computer simulations of materials with cracks are carried out on it via molecular dynamics technique. The effect of the number of nodes, speedup factors, and communication time between nodes are measured to verify the performance of the PC cluster. Upon using the PC cluster, materials fracture simulations with more than 50,000 molecules are carried out successfully.