• 제목/요약/키워드: Parallel Implementation

검색결과 880건 처리시간 0.034초

Implementation of a Wi-Fi Based Cluster System using Raspberry Pi for Multidisciplinary Education

  • Koo, Geum-Seo;Sim, Gab-Sig
    • 한국컴퓨터정보학회논문지
    • /
    • 제24권1호
    • /
    • pp.1-7
    • /
    • 2019
  • In this paper, we implemented a Wi-Fi based cluster system using raspberry pi for multidisciplinary education. The cluster implementation on the desktop was more difficult to maintain the complexity, big size, high price, power consumption as the number of nodes increased. In this paper, we implemented a cluster using Raspberry Pi, which is developed for educational purposes, to reduce the cost of connecting nodes. In addition, the complexity of system construction is reduced by replacing the connection between each node with Wi-Fi. Also, the inconvenience of configuration due to node increase was reduced. It is expected that the implementation of the cluster will be a good alternative in the educational environment where distributed processing and parallel processing are performed in the embedded environment. Also, it is confirmed that it can be applied to the multidisciplinary education.

NVIDIA CUDA PTX를 활용한 SPECK, SIMON, SIMECK 병렬 구현 (Parallel Implementation of SPECK, SIMON and SIMECK by Using NVIDIA CUDA PTX)

  • 장경배;김현준;임세진;서화정
    • 정보보호학회논문지
    • /
    • 제31권3호
    • /
    • pp.423-431
    • /
    • 2021
  • SPECK과 SIMON은 NSA(National Security Agency)에서 개발한 경량블록암호이며 SIMECK은 SPECK과 SIMON의 장점을 결합하여 만든 새로운 경량블록암호이다. 본 논문에서는 SPECK, SIMON, SIMECK을 사용한 대용량 암호화를 구현 하는데 있어 병렬 처리에 용이한 GPU를 활용하였다. NVIDIA에서 제공하는 CUDA 라이브러리를 활용하였으며 불필요한 연산들을 제거하기 위해 CUDA 어셈블리 언어 PTX를 사용하여 성능을 극대화 하였다. 단순 CPU 구현과 GPU를 활용한 구현 결과를 비교해보았을 때, 더 빠른 속도로 대용량 암호화를 수행할 수 있었다. 또한 GPU 구현 시, C언어를 사용한 구현과 PTX를 사용한 구현을 비교해 보았을 때, PTX 사용 시, 성능이 더욱 증가하는 것을 확인하였다.

Parallel Implementation of One Boltzmann Machine's Algorithm

  • Zhu, H.;Ren, F.;Sun, N.;Eguchi, K.;Tabata, T.
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -1
    • /
    • pp.265-268
    • /
    • 2002
  • Parallel-computation is very interesting topic. This paper describes that we apply it into the Boltzmann machine with the Parallel-Transit-Evaluation Method successfully.

  • PDF

DEVELOPMENT OF PARALLEL COMPUTATION METHOD FOR THE p VERSION IN THE FINITE ELEMENT METHOD

  • Kim, Chang-Geun;Cha, Ho-Jung
    • Journal of applied mathematics & informatics
    • /
    • 제6권2호
    • /
    • pp.649-659
    • /
    • 1999
  • This paper presents a parallel implementation of stiff-ness matrix calculation based on the processor farm model on a net-work of workstations running PVM programming environment. As the computational characteristics of stiffnes matrix exhibits good po-tentials for effective prallel computation the performance improve-ment is show to be almost linear with the number of sorkstations involved in the computation.

고속정보 전파특성을 갖는 실시간 비터비 디코더

  • 김종만;신동용;서범수
    • 한국전기전자재료학회:학술대회논문집
    • /
    • 한국전기전자재료학회 2010년도 춘계학술대회 논문집
    • /
    • pp.3-3
    • /
    • 2010
  • The Characteristics of Digital Vterbi Decoder utilizing the analog parallel processing circuit technology is proposed. The Analog parallel structure of the viterbi decoder acted by a replacement of the conventional digital viterbi Decoder is progressing fastly. The proposed circuits design han, low distortion, high accuracy over the previous implementation and dynamic programming.

  • PDF

A FAST POISSON SOLVER ON DISKS

  • Lee, Dae-Shik
    • Journal of applied mathematics & informatics
    • /
    • 제6권1호
    • /
    • pp.65-78
    • /
    • 1999
  • We present a fast/parallel Poisson solver on disks, based on efficient evaluation of the exact solution given by the Newtonian potential and the Poisson integral. Derived from an integral formula-tion it is more accurate and simpler in parallel implementation and in upgrading to a higher order algorithm than an algorithm which solves the linear system obtained from a differential formulation.

분산 및 병렬 알고리즘 시뮬레이터 (Distributed/parallel Algorithm Simulator)

  • 서영진
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 1999년도 가을 학술발표논문집 Vol.26 No.2 (3)
    • /
    • pp.777-779
    • /
    • 1999
  • A new distributed/parallel algorithm simulator, DASim(Distributed Algorithm Simulator), is proposed in this paper. The idea is to ease the task of design, analysis and implementation of distributed algorithms. A small high level language has been proposed for the purpose. Through this non-language specific high level language, the users are spared from the tedious details about how to program distributed or parallel algorithms. Further, visualization of these algorithms are pretty helpful to understand behaviors of these algorithms.

  • PDF

Design of Parallel Processor for Image Processing

  • 노석환;박종원
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2006년도 하계종합학술대회
    • /
    • pp.743-744
    • /
    • 2006
  • This paper presents implementation of parallel processing system for image processing. The parallel processing system proposed consisted of 16 processing elements, and multi-access memory system, and interface modules. The multi-access memory system we introduced is made up of a memory module selection, a data routing module, and an address calculation and routing module.

  • PDF

The Mapping Method for Parallel Processing of SAR Data

  • In-Pyo Hong;Jae-Woo Joo;Han-Kyu Park
    • 한국통신학회논문지
    • /
    • 제26권11A호
    • /
    • pp.1963-1970
    • /
    • 2001
  • It is essential design process to analyze processing method and set out top level HW configuration using main parameters before implementation of the SAR processor. This paper identifies the impact of the I/O and algorithm structure upon the parallel processing to be assessed and suggests the practical mapping method fur parallel processing to the SAR data. Also, simulation is performed to the E-SAR processor to examine the usefulness of the method, and the results are analyzed and discussed.

  • PDF

비선형계획법을 이용한 대규모 선형계획해법의 개발 (Development of Nonlinear Programming Approaches to Large Scale Linear Programming Problems)

  • 장수영
    • 대한산업공학회지
    • /
    • 제17권2호
    • /
    • pp.131-142
    • /
    • 1991
  • The concept of criterion function is proposed as a framework for comparing the geometric and computational characteristics of various nonlinear programming approaches to linear programming such as the method of centers, Karmakar's algorithm and the gravitational method. Also, we discuss various computational issues involved in obtaining an efficient parallel implementation of these methods. Clearly, the most time consuming part in solving a linear programming problem is the direction finding procedure, where we obtain an improving direction. In most cases, finding an improving direction is equivalent to solving a simple optimization problem defined at the current feasible solution. Again, this simple optimization problem can be seen as a least squares problem, and the computational effort in solving the least squares problem is, in fact, same as the effort as in solving a system of linear equations. Hence, getting a solution to a system of linear equations fast is very important in solving a linear programming problem efficiently. For solving system of linear equations on parallel computing machines, an iterative method seems more adequate than direct methods. Therefore, we propose one possible strategy for getting an efficient parallel implementation of an iterative method for solving a system of equations and present the summary of computational experiment performed on transputer based parallel computing board installed on IBM PC.

  • PDF