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

검색결과 259건 처리시간 0.023초

그레이 레벨 연결성 복원 하드웨어 구조 (A Hardware Architecture for Retaining the Connectivity in Gray-Scale Image)

  • 김성훈;양영일
    • 융합신호처리학회논문지
    • /
    • 제3권4호
    • /
    • pp.23-28
    • /
    • 2002
  • 본 논문에서는 그레이 레벨 영상을 세선화 하는 과정에서 골격이 끊어지는 것을 방지하는 연결성 복구 알고리즘을 구현하는 하드웨어 구조를 제안하였다. 영상에서 물체의 골격선을 찾아내는 영상의 세선화 과정을 실시간으로 처리하기 위해서는 실시간으로 골격선의 연결성을 검사하는 하드웨어가 필요하다. 본 논문에서는 골격선의 연결성을 4-클럭에 구하는 하드웨어 구조를 제안하였다. 제안된 구조는 PS(Parallel to Serial) Converter 블록, State Generator 블록, Ridge Checker 블록이 연속적으로 연결되어 있다. PS Converter 블록에서는 3$\times$3 그레이 레벨 영상을 4개의 직렬 화소값으로 만들어 State Generator 블록으로 보낸다. Staかe Generator 블록에서는 3$\times$3 그레이 값의 가운데 화소가 골격선에 접하는지를 검사하고, Ridge Checker 블록에서는 가운데 화소가 골격선상에 있는지를 판단한다. 본 논문에서 제안하는 구조는 3$\times$3 그레이 레벨의 가운데 화소의 연결성을 4-클럭에 검사한다. 전체적인 회로는 설계 툴을 사용하여 검증하였고 정상적인 동작을 수행하였다.

  • PDF

Content-Addressable Memory를 이용한 확장 가능한 범용 병렬 Associative Processor 설계 (Design of a scalable general-purpose parallel associative processor using content-addressable memory)

  • 박태근
    • 대한전자공학회논문지SD
    • /
    • 제43권2호
    • /
    • pp.51-59
    • /
    • 2006
  • 일반 컴퓨터에서 중앙처리장치와 메모리 사이의 병목현상인 "Von Neumann Bottleneck"을 보이는데 본 논문에서는 이러한 문제점을 해소하고 검색위주의 응용분야에서 우수한 성능을 보이는 Content-addressable memory(CAM) 기반의 확장 가능한 범용 Associative Processor(AP) 구조를 제안하였다. 본 연구에서는 Associative computing을 효율적으로 수행할 수 있는 명령어 세트를 제안하였으며 다양하고 대용량 응용분야에도 적용할 수 있도록 구조를 확장 가능하게 설계함으로써 유연한 구조를 갖는다. 12 가지의 명령어가 정의되었으며 프로그램이 효율적으로 수행될 수 있도록 명령어 셋을 구성하고 연속된 명령어를 하나의 명령어로 구현함으로써 처리시간을 단축하였다. 제안된 프로세서는 bit-serial, word-parallel로 동작하며 대용량 병렬 SIMD 구조를 갖는 32 비트 범용 병렬 프로세서로 동작한다. 포괄적인 검증을 위하여 명령어 단위의 검증 뿐 아니라 최대/최소 검색, 이상/이하 검색, 병렬 덧셈 등의 기본적인 병렬 알고리즘을 검증하였으며 알고리즘은 처리 데이터의 개수와는 무관한 상수의 복잡도 O(k)를 갖으며 데이터의 비트 수만큼의 이터레이션을 갖는다.

FMS 구축을 위한 DNC 시스템 통신기법 (Method of DNC System Communication for FMS Construction)

  • 이석희;배용환
    • 대한기계학회논문집
    • /
    • 제18권4호
    • /
    • pp.805-815
    • /
    • 1994
  • The development of automatic production systems has a trend toward Computer Integrated Manufacturing System(CIMS) in recent years. In hardware configuration, CIMS are composed of intelligent CAD/CAM work stations, multifunction CNC machining centers including material handling systems. The DNC systems present the key element of automation hierarchy in a FMS. A DNC system is one which connects a number of numerically-controlled machines to a common memory in a digital computer for part program storage with provision for on-demand distribution of part program data to machines using communication in hierarchical structure of central computer, control computer and cell controller. This paper describes the development of Behind-the-Tape-Reader(BTR) type DNC system using CYBER 180-830 as a central computer and IBM PC-386 cell control computer and NC lathe with FANUC 5T NC controller. In this system, the connection between central computer and cell control computer is done via RS-232C serial interface board, and the connection between cell control computer and FANUC 5T controller is done via parallel interface board. The software consists of two module, central computer communication module for NC program downloading and status uploading, NC machine running module for NC operating.

Patterns and Collections: Carpets from Central Asia in the Imperial Russian Imagination

  • Sohee, RYUK
    • Acta Via Serica
    • /
    • 제7권2호
    • /
    • pp.65-88
    • /
    • 2022
  • With the expansion of the Russian Empire southward in the nineteenth century, connoisseurs, art historians, and scholars in Russia began to pay attention to carpet traditions in the new territories of the Russian Empire in Turkestan. In journals and other specialty publications, they underscored a need to establish claims to authority over the knowledge of the traditional craft. They were highly attuned to parallel accounts of carpet weaving from regions that had a longer history of research and collecting of carpets. In contrast to the situation in Western Europe or the United States, commentators bemoaned the fact that the public and even professed experts in Russia did not properly appreciate carpets from the Caucasus and Central Asia. These scholars articulated a need to establish authority over the carpet weaving traditions of Russia's colonial possessions, resulting in a push toward a serious study of carpet weaving as a legitimate field of inquiry. This paper uses published sources on early carpet scholarship from the late nineteenth and early twentieth centuries to examine how carpet weaving traditions in Central Asia entered an imperial discourse of knowledge. It argues that attempts to understand and categorize carpet weaving as an art form occurred along two fronts. Intellectuals and scholars attempted to wrest control over the locus of knowledge from experts in the West as well as from local weavers. In the process, they established a distinctly imperial vision of carpet weaving in contrast to competing imperial discourses and over traditional forms of knowledge.

정사모자이크 제작을 위한 Agisoft Metashape의 병렬처리 성능 평가 (Assessment of Parallel Computing Performance of Agisoft Metashape for Orthomosaic Generation)

  • 한수희;홍창기
    • 한국측량학회지
    • /
    • 제37권6호
    • /
    • pp.427-434
    • /
    • 2019
  • 본 연구에서는 SfM (Structure from Motion) 기술을 기반으로 항공삼각측량을 수행하고 3차원 포인트 클라우드를 생성하며 정사모자이크를 제작할 수 있는 Agisoft Metashape의 병렬처리 성능을 평가하였다. SfM의 속성상 상호표정에 해당하는 Align photos와 3차원 포인트 클라우드를 생성하는 Build dense cloud가 대부분의 시간을 차지하는데, Metashape에서는 이러한 과정에서 CPU (Central Processing Unit)의 다중코어와 함께 GPU (Graphics Processing Unit)를 이용하여 병렬처리를 수행할 수 있다. 세 가지 병렬처리 방법(CPU only, GPU only, CPU + GPU)과 두 가지 운영체제(Windows, Linux)를 조합하여 총 여섯 가지 조건으로 대용량 무인기 영상으로부터 정사모자이크를 제작하였다. 아울러 사용자의 개입 없이 자동화된 방법으로 영상에서 지상기준점을 인식하여 항공삼각측량의 RMSE (Root Mean Square Error)를 측정함으로써 각 조건에 따른 결과의 일관성을 평가하였다. 4220만 화소의 무인기 영상 521장으로부터 정사모자이크를 제작한 결과, 본 연구에서 사용한 시스템에서는 CPU와 GPU의 조합이 가장 나은 성능을 나타내었고 모든 조건에서 Linux가 Windows보다 나은 성능을 나타내었다. 그러나 항공삼각측량의 RMSE를 측정한 결과, 각 설정에 따른 RMSE 값에서 오차 범위 안에서 미세한 차이가 나타났다. 따라서 Metashape는 운영체제 및 병렬처리 여부에 관계없이 동일한 결과가 도출되도록 개선할 여지가 있는 것으로 판단된다.

Parallel LDPC Decoding on a Heterogeneous Platform using OpenCL

  • Hong, Jung-Hyun;Park, Joo-Yul;Chung, Ki-Seok
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권6호
    • /
    • pp.2648-2668
    • /
    • 2016
  • Modern mobile devices are equipped with various accelerated processing units to handle computationally intensive applications; therefore, Open Computing Language (OpenCL) has been proposed to fully take advantage of the computational power in heterogeneous systems. This article introduces a parallel software decoder of Low Density Parity Check (LDPC) codes on an embedded heterogeneous platform using an OpenCL framework. The LDPC code is one of the most popular and strongest error correcting codes for mobile communication systems. Each step of LDPC decoding has different parallelization characteristics. In the proposed LDPC decoder, steps suitable for task-level parallelization are executed on the multi-core central processing unit (CPU), and steps suitable for data-level parallelization are processed by the graphics processing unit (GPU). To improve the performance of OpenCL kernels for LDPC decoding operations, explicit thread scheduling, vectorization, and effective data transfer techniques are applied. The proposed LDPC decoder achieves high performance and high power efficiency by using heterogeneous multi-core processors on a unified computing framework.

병렬 FEM 모형을 이용한 1983년 동해 중부 지진해일 시뮬레이션 (Simulation of 1983 Central East Sea Tsunami by Parallel FEM Model)

  • 최병호;에핌페리놉스키;홍성진
    • 한국해안해양공학회지
    • /
    • 제18권1호
    • /
    • pp.21-34
    • /
    • 2006
  • 지진해일 위험재해도의 작성과 재해경감대책 수립을 위해서는 연안역의 상세한 수심 및 지형을 이용한 범람 시뮬레이션이 요구되고 있다. 본 연구에서는 Beowulf 병렬계산을 통해 동해 전 영역에서 정밀산정이 가능한 병렬유한요소모형을 이용하여 1983년 5월 26일 동해안에 내습한 지진해일에 대한 시뮬레이션을 수행하고, 그 계산 결과와 관측치와의 비교결과를 제시한다. 또한, 해안에서의 지진해일고의 통계적 분포에 대해 논하며, 해안에서의 지진해일고의 파고분포가 대수정규분포를 따르는 경향을 제시한다.

Instability of Magnetized Ionization Fronts

  • Kim, Woong-Tae;Kim, Jeong-Gyu
    • 천문학회보
    • /
    • 제39권2호
    • /
    • pp.78.1-78.1
    • /
    • 2014
  • An ionization front (IF) surrounding an H II region is a sharp interface through which a cold neutral gas makes transition to a warm ionized phase by absorbing UV photons from central massive stars. We investigate the structure and instability of a plane-parallel D-type IF threaded by magnetic fields parallel to the front. We find that magnetic fields increase the maximum propagation speed of the IFs, while reducing the expansion factor, defined as the density ratio of neutral to ionized phases. IFs become unstable to distortional perturbations due to gas expansion across the fronts, exactly analogous to the Darrieus-Landau instability of ablation fronts in terrestrial flames. The growth rate of the IF instability is proportional linearly to the perturbation wavenumber as well as the upstream flow speed. The IF instability is stabilized by gas compressibility and becomes completely quenched when the front is D-critical. The instability is also stabilized by magnetic pressure when the perturbations propagate in the direction perpendicular to the fields. When the perturbations propagate in the direction parallel to the fields, on the other hand, it is magnetic tension that reduces the growth rate, completely suppressing the instability when ${\beta}$ < 1.5, with ${\beta}$ denoting the square of the ratio of the sound speed to the Alfven speed in the pre-IF region. When the front experiences an acceleration, the IF instability cooperates with the Rayleigh-Taylor instability to make the front more unstable. We discuss potential effects of IF instability on the evolution and dynamics of IFs in the interstellar medium.

  • PDF

Mathematical Modeling of the Tennis Serve: Adaptive Tasks from Middle and High School to College

  • Thomas Bardy;Rene Fehlmann
    • 한국수학교육학회지시리즈D:수학교육연구
    • /
    • 제26권3호
    • /
    • pp.167-202
    • /
    • 2023
  • A central problem of mathematics teaching worldwide is probably the insufficient adaptive handling of tasks-especially in computational practice phases and modeling tasks. All students in a classroom must often work on the same tasks. In the process, the high-achieving students are often underchallenged, and the low-achieving ones are overchallenged. This publication uses different modeling of the tennis serve as an example to show a possible solution to the problem and develops and discusses one adaptive task each for middle school, high school, and college using three mathematical models of the tennis serve each time. From model to model within the task, the complexity of the modeling increases, the mathematical or physical demands on the students increase, and the new modeling leads to more realistic results. The proposed models offer the possibility to address heterogeneous learning groups by their arrangement in the surface structure of the so-called parallel adaptive task and to stimulate adaptive mathematics teaching on the instructional topic of mathematical modeling. Models A through C are suitable for middle school instruction, models C through E for high school, and models E through G for college. The models are classified in the specific modeling cycle and its extension by a digital tool model, and individual modeling steps are explained. The advantages of the presented models regarding teaching and learning mathematical modeling are elaborated. In addition, we report our first teaching experiences with the developed parallel adaptive tasks.

Analysis of Implementing Mobile Heterogeneous Computing for Image Sequence Processing

  • BAEK, Aram;LEE, Kangwoon;KIM, Jae-Gon;CHOI, Haechul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권10호
    • /
    • pp.4948-4967
    • /
    • 2017
  • On mobile devices, image sequences are widely used for multimedia applications such as computer vision, video enhancement, and augmented reality. However, the real-time processing of mobile devices is still a challenge because of constraints and demands for higher resolution images. Recently, heterogeneous computing methods that utilize both a central processing unit (CPU) and a graphics processing unit (GPU) have been researched to accelerate the image sequence processing. This paper deals with various optimizing techniques such as parallel processing by the CPU and GPU, distributed processing on the CPU, frame buffer object, and double buffering for parallel and/or distributed tasks. Using the optimizing techniques both individually and combined, several heterogeneous computing structures were implemented and their effectiveness were analyzed. The experimental results show that the heterogeneous computing facilitates executions up to 3.5 times faster than CPU-only processing.