• Title/Summary/Keyword: Parallel Computer

Search Result 1,770, Processing Time 0.026 seconds

Spin-polarized Current Switching of Co/Cu/Py Pac-man type II Spin-valve

  • Lyle, Andrew;Hong, Yang-Ki;Choi, Byoung-Chul;Abo, Gavin;Bae, Seok;Jalli, Jeevan;Lee, Jae-Jin;Park, Mun-Hyoun;Syslo, Ryan
    • Journal of Magnetics
    • /
    • v.15 no.3
    • /
    • pp.103-107
    • /
    • 2010
  • We investigated spin-polarized current switching of Pac-man type II (PM-II) nanoelements in Pac-man shaped nanoscale spin-valves (Co/Cu/Py) using micromagnetic simulations. The effects of slot angle and antiferromagnetic (AFM) layer were simulated to obtain optimum switching in less than 2 ns. At a critical slot angle of $105^{\circ}$, the lowest current density for anti-parallel to parallel (AP-P) switching was observed due to no vortex or antivortex formation during the magnetic reversal process. All other slot angles for AP-P formed a vortex or antivortex during the magnetization reversal process. Additionally, a vortex or anti-vortex formed for all slot angles for parallel to anti-parallel (P-AP) switching. The addition of an AFM layer caused the current density to decrease significantly for AP-P and P-AP at slot angles less than $90^{\circ}$. However, at slot angles greater than $90^{\circ}$, the current density tended to decrease by less amounts or actually increased slightly as shape anisotropy became more dominant. This allowed ultra-fast switching with 5.05 and $5.65{\times}10^8\;A/cm^2$ current densities for AP-P and P-AP, respectively, at a slot angle of $105^{\circ}$.

Performance Comparison of Parallel Programming Frameworks in Digital Image Transformation

  • Shin, Woochang
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.11 no.3
    • /
    • pp.1-7
    • /
    • 2019
  • Previously, parallel computing was mainly used in areas requiring high computing performance, but nowadays, multicore CPUs and GPUs have become widespread, and parallel programming advantages can be obtained even in a PC environment. Various parallel programming frameworks using multicore CPUs such as OpenMP and PPL have been announced. Nvidia and AMD have developed parallel programming platforms and APIs for program developers to take advantage of multicore GPUs on their graphics cards. In this paper, we develop digital image transformation programs that runs on each of the major parallel programming frameworks, and measure the execution time. We analyze the characteristics of each framework through the execution time comparison. Also a constant K indicating the ratio of program execution time between different parallel computing environments is presented. Using this, it is possible to predict rough execution time without implementing a parallel program.

A Vision Based Pallet Measurement Method by Estimating 3D Direction of A Line Parallel to The Ground (지면 평행 직선의 3차원 방향 추정에 의한 비전 기반 파렛트 측정 방법)

  • Kim, Minhwan;Byun, Sungmin
    • Journal of Korea Multimedia Society
    • /
    • v.23 no.10
    • /
    • pp.1229-1235
    • /
    • 2020
  • A line parallel to the ground is frequently shown in our daily life, which enables us to guess its direction. Especially, such a guess tends to become clear when a vanishing line of the ground is shown together. In this paper, a vision based pallet measurement method is suggested, which uses a technique for estimating three-dimensional direction of a line parallel to the ground. The technique computes actually a vector heading to intersection of a given imaged line parallel to the ground and the ground vanishing line determined previously on calibrating a measurement camera. Through an experiment of measuring a real commercial pallet with various orientation and distance, we found that the technique could measure the orientation of the pallet correctly and accurately. The technique worked well even though an edge line available on the front plane of a pallet was almost parallel to the ground vanishing line.

A Parallel Adaptive Evolutionary Algorithm for Thermal Unit Commitment (병렬 적응 진화알고리즘을 이용한 발전기 기동정지계획에 관한 연구)

  • Kim, Hyung-Su;Cho, Duck-Hwan;Mun, Kyeong-Jun;Lee, Hwa-Seok;Park, June-Ho;Hwang, Gi-Hyun
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.55 no.9
    • /
    • pp.365-375
    • /
    • 2006
  • This paper is presented by the application of parallel adaptive evolutionary algorithm(PAEA) to search an optimal solution of a thermal unit commitment problem. The adaptive evolutionary algorithm(AEA) takes the merits of both a genetic algorithm(GA) and an evolution strategy(ES) in an adaptive manner to use the global search capability of GA and the local search capability of ES. To reduce the execution time of AEA, the developed algorithm is implemented on an parallel computer which is composed of 16 processors. To handle the constraints efficiently and to apply to Parallel adaptive evolutionary algorithm(PAEA), the states of thermal unit are represented by means of real-valued strings that display continuous terms of on/off state of generating units and are involved in their minimum up and down time constraints. And the violation of other constraints are handled by repairing operator. The procedure is applied to the $10{\sim}100$ thermal unit systems, and the results show capabilities of the PAEA.

Calculation Effect of GPU Parallel Programing for Planar Multibody System Dynamics (평면 다물체 동역학 해석에서 GPU 병렬 프로그래밍의 계산효과)

  • Jun, C.W.;Sohn, J.H.
    • Journal of Power System Engineering
    • /
    • v.16 no.4
    • /
    • pp.12-16
    • /
    • 2012
  • In this paper, the equations of motions for planar multibody dynamics are established for considering the parallel programming based on GPU. Cartesian coordinates are used to formulate the equations of motion and implicit integration method called HHT-alpha is employed. Open chain multibody system is considered for computer simulation. CUDA toolkit is employed for establishing the GPU parallel programming. The exactness of the analysis is verified from the comparison with ADAMS. The results from parallel computing based on GPU are compared with the results from the sequential programming based on CPU in terms of calculation time. The multiple pendulum with bodies and joints is employed for the computer simulation. In the pendulum system that has 290 bodies, the parallel program indicates an improved efficiency of about 25.5 second(15.5% improvement). It is noted that the larger the size of system is, the time efficiency is better.

Performance Study of Satellite Image Processing on Graphics Processors Unit Using CUDA

  • Jeong, In-Kyu;Hong, Min-Gee;Hahn, Kwang-Soo;Choi, Joonsoo;Kim, Choen
    • Korean Journal of Remote Sensing
    • /
    • v.28 no.6
    • /
    • pp.683-691
    • /
    • 2012
  • High resolution satellite images are now widely used for a variety of mapping applications including photogrammetry, GIS data acquisition and visualization. As the spectral and spatial data size of satellite images increases, a greater processing power is needed to process the images. The solution of these problems is parallel systems. Parallel processing techniques have been developed for improving the performance of image processing along with the development of the computational power. However, conventional CPU-based parallel computing is often not good enough for the demand for computational speed to process the images. The GPU is a good candidate to achieve this goal. Recently GPUs are used in the field of highly complex processing including many loop operations such as mathematical transforms, ray tracing. In this study we proposed a technique for parallel processing of high resolution satellite images using GPU. We implemented a spectral radiometric processing algorithm on Landsat-7 ETM+ imagery using CUDA, a parallel computing architecture developed by NVIDIA for GPU. Also performance of the algorithm on GPU and CPU is compared.

Bilingual lexicon induction through a pivot language

  • Kim, Jae-Hoon;Seo, Hyeong-Won;Kwon, Hong-Seok
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.37 no.3
    • /
    • pp.300-306
    • /
    • 2013
  • This paper presents a new method for constructing bilingual lexicons through a pivot language. The proposed method is adapted from the context-based approach, called the standard approach, which is well-known for building bilingual lexicons using comparable corpora. The main difference between the standard approach and the proposed method is how to represent context vectors. The former is to represent context vectors in a target language, while the latter in a pivot language. The proposed method is very simplified from the standard approach thereby. Furthermore, the proposed method is more accurate than the standard approach because it uses parallel corpora instead of comparable corpora. The experiments are conducted on a language pair, Korean and Spanish. Our experimental results have shown that the proposed method is quite attractive where a parallel corpus directly between source and target languages are unavailable, but both source-pivot and pivot-target parallel corpora are available.

A Implementation of Loop Interchange Parallel Compiler (루프인터체인지 병렬컴파일러 구현)

  • Song, Worl-Bong
    • Journal of the Korea Computer Industry Society
    • /
    • v.8 no.3
    • /
    • pp.167-172
    • /
    • 2007
  • Generally, In a application program the core part for parallel processing is a loop. therefore in this paper, loop interchange parallel compiler is proposed. this is a procedure for the automatic conversion of a loop interchange. According to execution to the outside CDOALL statements of cedar fortran, loop interchange is more effectively method the extracting parallelism in order to parallel processing in iterations. This method will be expected to effectively execution result with mixed into linear conversion and go far toward solving the effectively implementation of the non-unimodular nested loop.

  • PDF

A Study on the Efficient m-step Parallel Generalization

  • Kim, Sun-Kyung
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.13-16
    • /
    • 2005
  • It would be desirable to have methods for specific problems, which have low communication costs compared to the computation costs, and in specific applications, algorithms need to be developed and mapped onto parallel computer architectures. Main memory access for shared memory system or global communication in message passing system deteriorate the computation speed. In this paper, it is found that the m-step generalization of the block Lanczos method enhances parallel properties by forming m simultaneous search direction vector blocks. QR factorization, which lowers the speed on parallel computers, is not necessary in the m-step block Lanczos method. The m-step method has the minimized synchronization points, which resulted in the minimized global communications compared to the standard methods.

  • PDF

Design and optimization of steel trusses using genetic algorithms, parallel computing, and human-computer interaction

  • Agarwal, Pranab;Raich, Anne M.
    • Structural Engineering and Mechanics
    • /
    • v.23 no.4
    • /
    • pp.325-337
    • /
    • 2006
  • A hybrid structural design and optimization methodology that combines the strengths of genetic algorithms, local search techniques, and parallel computing is developed to evolve optimal truss systems in this research effort. The primary objective that is met in evolving near-optimal or optimal structural systems using this approach is the capability of satisfying user-defined design criteria while minimizing the computational time required. The application of genetic algorithms to the design and optimization of truss systems supports conceptual design by facilitating the exploration of new design alternatives. In addition, final shape optimization of the evolved designs is supported through the refinement of member sizes using local search techniques for further improvement. The use of the hybrid approach, therefore, enhances the overall process of structural design. Parallel computing is implemented to reduce the total computation time required to obtain near-optimal designs. The support of human-computer interaction during layout optimization and local optimization is also discussed since it assists in evolving optimal truss systems that better satisfy a user's design requirements and design preferences.