• Title, Summary, Keyword: Parallel Computing

Search Result 690, Processing Time 0.125 seconds

Evaluation of DES key search stability using Parallel Computing (병렬 컴퓨팅을 이용한 DES 키 탐색 안정성 분석)

  • Yoon, JunWeon;Choi, JangWon;Park, ChanYeol;Kong, Ki-Sik
    • Journal of Digital Contents Society
    • /
    • v.14 no.1
    • /
    • pp.65-72
    • /
    • 2013
  • Current and future parallel computing model has been suggested for running and solving large-scale application problems such as climate, bio, cryptology, and astronomy, etc. Parallel computing is a form of computation in which many calculations are carried out simultaneously. And we are able to shorten the execution time of the program, as well as can extend the scale of the problem that can be solved. In this paper, we perform the actual cryptographic algorithms through parallel processing and evaluate its efficiency. Length of the key, which is stable criterion of cryptographic algorithm, judged according to the amount of complete enumeration computation. So we present a detailed procedure of DES key search cryptographic algorithms for executing of enumeration computation in parallel processing environment. And then, we did the simulation through applying to clustering system. As a result, we can measure the safety and solidity of cryptographic algorithm.

A Study on Adaptive Parallel Computability in Many-Task Computing on Hadoop Framework (하둡 기반 대규모 작업처리 프레임워크에서의 Adaptive Parallel Computability 기술 연구)

  • Jik-Soo, Kim
    • Journal of Broadcast Engineering
    • /
    • v.24 no.6
    • /
    • pp.1122-1133
    • /
    • 2019
  • We have designed and implemented a new data processing framework called MOHA(Mtc On HAdoop) which can effectively support Many-Task Computing(MTC) applications in a YARN-based Hadoop platform. MTC applications can be composed of a very large number of computational tasks ranging from hundreds of thousands to millions of tasks, and each MTC application may have different resource usage patterns. Therefore, we have implemented MOHA-TaskExecutor(a pilot-job that executes real MTC application tasks)'s Adaptive Parallel Computability which can adaptively execute multiple tasks simultaneously, in order to improve the parallel computability of a YARN container and the overall system throughput. We have implemented multi-threaded version of TaskExecutor which can "independently and dynamically" adjust the number of concurrently running tasks, and in order to find the optimal number of concurrent tasks, we have employed Hill-Climbing algorithm.

A Fundamental Study of Thermal-Fluid Flow Analysis using High Performance Computing under the GRID (그리드 환경하에서 고성능 컴퓨팅을 이용한 열유동 해석 기법에 관한 기초연구)

  • Hong, Seung-Do;Lee, Dae-Sung;Lee, Jae-Ryong;Ha, Man-Yeong;Lee, Sang-San
    • Proceedings of the KSME Conference
    • /
    • /
    • pp.928-933
    • /
    • 2003
  • For simulation of three-dimensional turbulent flow with LES and DNS takes much time and expense with current available computing resources. It is nearly impossible to simulate turbulent flow with high Reynolds number. So, the emerging alternative is the Grid computing for needed computation power and working environment. In this study, the CFD code was parallelized to adapt it for the parallel computing under the Grid environment. In the first place, the Grid environment was built to connect the PC-Cluster facilities belong to the different institutions using communication network system. And CFD applications were calculated to check the performance of the parallel code developed for the Grid environment. Although it is a fundamental study, it brings about a important meaning as first step in research of the Grid.

  • PDF

Parallel Nonlinear Analysis of Prestressed Concrete Frame on Cluster System (클러스터 시스템에서 프리스트레스트 콘크리트 프레임의 병렬 비선형해석)

  • 이재석;최규천
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.14 no.3
    • /
    • pp.287-298
    • /
    • 2001
  • Analysis of nonlinear behavior of prestressed concrete frame structures on PC is a time-consuming computing job if the problem size increase to a certain degree. Cluster system has emerged as one of promising computing environments due to its good extendibility, portability, and cost-effectiveness, comparing it with high-end work-stations or servers. In this paper, a parallel nonlinear analysis procedure of prestressed concrete frame structure is presented using cluster computing. Cluster system is configured with readily available pentium III class PCs under Win98 or Linux and fast ethernet. Parallel computing algorithms 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 are developed using MPL. Validity of the method is discussed through typical numerical examples. For the case of 4 node system, maximum speedup is 3.15 and 3.74 for Win98 and Linux, respectively. Important issues for the efficient use of cluster computing system based un PCs and ethernet are addressed.

  • PDF

Virtual Optimal Design of Satellite Adapter in Parallel Computing Environment (병렬 컴퓨팅 환경 하에서 인공위성 어댑터 가상최적설계)

  • Moon, Jong-Keun;Yoon, Young-Ha;Kim, Kyung-Won;Kim, Sun-Won;Kim, Jin-Hee;Kim, Seung-Jo
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.35 no.11
    • /
    • pp.973-982
    • /
    • 2007
  • In this paper, optimal design framework is developed by automatic mesh generation and PSO(Particle Swarm Optimization) algorithm based on parallel computing environment and applied to structural optimal design of satellite adapter module. By applying automatic mesh generation, it became possible to change the structural shape of adapter module. PSO algorithm was merged with parallel computing environment and for maximizing a computing performance, asynchronous PSO algorithm was developed and could reduce the computing time of optimization process. As constraint conditions, eigen-frequency and maximum stress was considered. Finally using optimal design framework, weight reduction of satellite adapter module is derived with satisfaction of structural safety.

Space-Sharing Scheduling Schemes for NOW with Heterogeneous Computing Power (이질적 계산 능력을 가진 NOW를 위한 공간 공유 스케쥴링 기법)

  • Kim, Jin-Sung;Shim, Young-Chul
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.7
    • /
    • pp.650-664
    • /
    • 2000
  • NOW(Network of Workstations) is considered as a platform for running parallel programs by many people. One of the fundamental problems that must be addressed to achieve good performance for parallel programs on NOW is the determination of efficient job scheduling policies. Currently most research on NOW assumes that all the workstations in the NOW have the same processing power. In this paper we consider a NOW in which workstations may have different computing power. We introduce 10 classes of space sharing-based scheduling policies that can be applied to the NOW with heterogeneous computing power. We compare the performance of these scheduling policies by using the simulator which accepts synthetically generated sequential and parallel workloads and generates the response time and waiting time of parallel jobs as performance indices of various scheduling strategies. Through the experiments the case when a parallel program is partitioned heterogeneously in proportion to the computing power of workstations is shown to have better performance than when a parallel program is partitioned into parallel processes of the same size. When the owner returns to the workstation which is executing a parallel process, the policy which just lowers the priority of the parallel process shows better performance than the one which migrates the parallel process to a new idle workstation. Among the policies which use heterogeneous partitioning and process priority lowering, the adaptive policy performed best across the wide range of inter-arrival time of parallel programs but when the load imbalance among parallel processes becomes very high, the modified adaptive policy performed better.

  • PDF

Parallel and Sequential Implementation to Minimize the Time for Data Transmission Using Steiner Trees

  • Anand, V.;Sairam, N.
    • Journal of Information Processing Systems
    • /
    • v.13 no.1
    • /
    • pp.104-113
    • /
    • 2017
  • In this paper, we present an approach to transmit data from the source to the destination through a minimal path (least-cost path) in a computer network of n nodes. The motivation behind our approach is to address the problem of finding a minimal path between the source and destination. From the work we have studied, we found that a Steiner tree with bounded Steiner vertices offers a good solution. A novel algorithm to construct a Steiner tree with vertices and bounded Steiner vertices is proposed in this paper. The algorithm finds a path from each source to each destination at a minimum cost and minimum number of Steiner vertices. We propose both the sequential and parallel versions. We also conducted a comparative study of sequential and parallel versions based on time complexity, which proved that parallel implementation is more efficient than sequential.

On Parallel Implementation of Lagrangean Approximation Procedure (Lagrangean 근사과정의 병렬계산)

  • 이호창
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.18 no.3
    • /
    • pp.13-34
    • /
    • 1993
  • By operating on many part of a software system concurrently, the parallel processing computers may provide several orders of magnitude more computing power than traditional serial computers. If the Lagrangean approximation procedure is applied to a large scale manufacturing problem which is decomposable into many subproblems, the procedure is a perfect candidate for parallel processing. By distributing Lagrangean subproblems for given multiplier to multiple processors, concurrently running processors and modifying Lagrangean multipliers at the end of each iteration of a subgradient method,a parallel processing of a Lagrangean approximation procedure may provide a significant speedup. This purpose of this research is to investigate the potential of the parallelized Lagrangean approximation procedure (PLAP) for certain combinational optimization problems in manufacturing systems. The framework of a Plap is proposed for some combinatorial manufacturing problems which are decomposable into well-structured subproblems. The synchronous PLAP for the multistage dynamic lot-sizing problem is implemented on a parallel computer Alliant FX/4 and its computational experience is reported as a promising application of vector-concurrent computing.

  • PDF

Efficient Parallel Block-layered Nonbinary Quasi-cyclic Low-density Parity-check Decoding on a GPU

  • Thi, Huyen Pham;Lee, Hanho
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.6 no.3
    • /
    • pp.210-219
    • /
    • 2017
  • This paper proposes a modified min-max algorithm (MMMA) for nonbinary quasi-cyclic low-density parity-check (NB-QC-LDPC) codes and an efficient parallel block-layered decoder architecture corresponding to the algorithm on a graphics processing unit (GPU) platform. The algorithm removes multiplications over the Galois field (GF) in the merger step to reduce decoding latency without any performance loss. The decoding implementation on a GPU for NB-QC-LDPC codes achieves improvements in both flexibility and scalability. To perform the decoding on the GPU, data and memory structures suitable for parallel computing are designed. The implementation results for NB-QC-LDPC codes over GF(32) and GF(64) demonstrate that the parallel block-layered decoding on a GPU accelerates the decoding process to provide a faster decoding runtime, and obtains a higher coding gain under a low $10^{-10}$ bit error rate and low $10^{-7}$ frame error rate, compared to existing methods.

A Basic Study of Thermal-Fluid Flow Analysis Using Grid Computing (그리드 컴퓨팅을 이용한 열유동 해석 기법에 관한 기초 연구)

  • Hong, Seung-Do;Ha, Yeong-Man;Cho, Kum-Won
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.28 no.5
    • /
    • pp.604-611
    • /
    • 2004
  • Simulation of three-dimensional turbulent flow with LES and DNS lakes much time and expense with currently available computing resources and requires big computing resources especially for high Reynolds number. The emerging alternative to provide the required computing power and working environment is the Grid computing technology. We developed the CFD code which carries out the parallel computing under the Grid environment. We constructed the Grid environment by connecting different PC-cluster systems located at two different institutes of Pusan National University in Busan and KISTI in Daejeon. The specification of PC-cluster located at two different institutes is not uniform. We run our parallelized computer code under the Grid environment and compared its performance with that obtained using the homogeneous computing environment. When we run our code under the Grid environment, the communication time between different computer nodes takes much larger time than the real computation time. Thus the Grid computing requires the highly fast network speed.