• Title/Summary/Keyword: 대용량 메모리

Search Result 373, Processing Time 0.024 seconds

Optimization of Lightweight Encryption Algorithm (LEA) using Threads and Shared Memory of GPU (GPU의 스레드와 공유메모리를 이용한 LEA 최적화 방안)

  • Park, Moo Kyu;Yoon, Ji Won
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.4
    • /
    • pp.719-726
    • /
    • 2015
  • As big-data and cloud security technologies become popular, many researchers have recently been conducted on faster and lighter encryption. As a result, National Security Research Institute developed LEA which is lightweight and fast block cipher. To date, there have been various studies on lightweight encryption algorithm (LEA) for speeding up using GPU rather than conventional CPU. However, it is rather difficult to explore any guideline how to manipulate the GPU for the efficient usage of the LEA. Therefore, we introduce a guideline which explains how to implement and design the optimal LEA using GPU.

Query Optimization Scheme using Query Classification in Hybrid Spatial DBMS (하이브리드 공간 DBMS에서 질의 분류를 이용한 최적화 기법)

  • Chung, Weon-Il;Jang, Seok-Kyu
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.1
    • /
    • pp.290-299
    • /
    • 2008
  • We propose the query optimization technique using query classification in hybrid spatial DBMS. In our approach, user queries should to be classified into three types: memory query, disk query, and hybrid query. Specialty, In the hybrid query processing, the query predicate is divided by comparison between materialized view creating conditions and user query conditions. Then, the deductions of the classified queries' cost formula are used for the query optimization. The optimization is mainly done by the selection algorithm of the smallest cost data access path. Our approach improves the performance of hybrid spatial DBMS than traditional disk-based DBMS by $20%{\sim}50%$.

3-Dimensional Analysis of Magnetic Road and Vehicle Position Sensing System for Autonomous Driving (자율주행용 자계도로의 3차원 해석 및 차량위치검출시스템)

  • Ryoo Young-Jae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.1
    • /
    • pp.75-80
    • /
    • 2005
  • In this paper, a 3-dimensional analysis of magnetic road and a position sensing system for an autonomous vehicle system is described. Especially, a new position sensing system, end of the important component of an autonomous vehicle, is proposed. In a magnet based autonomous vehicle system, to sense the vehicle position, the sensor measures the field of magnetic road. The field depends on the sensor position of the vehicle on the magnetic road. As the rotation between the magnetic field and the sensor position is highly complex, it is difficult that the relation is stored in memory. Thus, a neural network is used to learn the mapping from th field to the position. The autonomous vehicle system with the proposed position sensing system is tested in experimental setup.

Design of an SPI Interface for multimedia cards in ARM Embedded Systems (ARM 내장 임베디드 시스템용 멀티미디어카드를 위한 SPI 인터페이스 설계)

  • Moon, San-Gook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.2
    • /
    • pp.273-278
    • /
    • 2012
  • In this contribution, we design and implement an SPI hardware interface for the microprocessor to communicate with the MMC (Multi-Media Card) in an embedded system. Proposed architecture is compatible with the APB in AMBA bus architecture. Embedding OS in an embedded system means a big burden in terms of hardware and software ending up with performance decline. In this paper, we adopt the concept of SPI communication without using OS in the embedded system and implement in a form of FPGA chip. The designed SPI module was automatically synthesized, placed, and routed. Implementation was performed through the Altera FPGA and well operated at 25MHz clock frequency, which satisfied our target speed.

Indexing of XML with B+-tree (B+-tree를 이용한 XML 색인기법)

  • Kwon, Guk-Bong;Hong, Dong-Kweon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.1
    • /
    • pp.94-100
    • /
    • 2006
  • Computing paradigm shift to internet-based one has accelerated the use of XML in diverse applications. This phenomena has made the explosive increases of XML data and it triggered many active researches in maintaining very huge amount of XML data in turn. In this paper we present a persistent graph-based XML indexing lot data-centric XML data. In our approach we use 3 graphs to represent XML indexes and XML data itself. They are schema graph, data graph index. And then we have mapped those graphs to B+-trees the persistency. With our approach we can achieve linear query execution time with the increase of XML sizes.

Programmable Multimedia Platform for Video Processing of UHD TV (UHD TV 영상신호처리를 위한 프로그래머블 멀티미디어 플랫폼)

  • Kim, Jaehyun;Park, Goo-man
    • Journal of Broadcast Engineering
    • /
    • v.20 no.5
    • /
    • pp.774-777
    • /
    • 2015
  • This paper introduces the world's first programmable video-processing platform for the enhancement of the video quality of the 8K(7680x4320) UHD(Ultra High Definition) TV operating up to 60 frames per second. In order to support required computing capacity and memory bandwidth, the proposed platform implemented several key features such as symmetric multi-cluster architecture for parallel data processing, a ring-data path between the clusters for data pipelining and hardware accelerators for computing filter operations. The proposed platform based on RP(Reconfigurable Processor) processes video quality enhancement algorithms and handles effectively new UHD broadcasting standards and display panels.

Development of a Branch-and-Bound Global Optimization Based on B-spline Approximation (비스플라인 분지한계법 기반의 전역최적화 알고리즘 개발)

  • Park, Sang-Kun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.34 no.2
    • /
    • pp.191-201
    • /
    • 2010
  • This paper presents a new global optimization algorithm based on the branch-and-bound principle using Bspline approximation techniques. It describes the algorithmic components and details on their implementation. The key components include the subdivision of a design space into mutually disjoint subspaces and the bound calculation of the subspaces, which are all established by a real-valued B-spline volume model. The proposed approach was demonstrated with various test problems to reveal computational performances such as the solution accuracy, number of function evaluations, running time, memory usage, and algorithm convergence. The results showed that the proposed algorithm is complete without using heuristics and has a good possibility for application in large-scale NP-hard optimization.

A Recursive Procedure for the Queue Length Distribution of a Coxian Queueing Network (회귀적 방법을 이용한 Coxian 대기 네트워크의 대기길이 분포 계산)

  • Park, Doo-Yeong
    • The Journal of Engineering Research
    • /
    • v.3 no.1
    • /
    • pp.85-95
    • /
    • 1998
  • In this study, we consider a recursive procedure to obtain the stationary probability distribution for analyzing Coxian queueing networks with finite queues. This network deals with multiple class customers. Due to the state space representing multiple class customers, the sub-matrices corresponding to states can not be square matrices and can not be inverted. Therefore, we introduce more complex recursive method to avoid the singular problem. The open queueing network that we study consists of 3 parallel first-level sources linked to a single second level queue. We consider two types of schemes for entering a queue. The first scheme is assumed to be the first-blocked-first-enter (FBFE) and the second scheme is the higher-priority-first-enter (HPFE). Arrival and service times are assume to have a Coxian distribution with two phases. Comparison between the resulting using Gauss-Seidel method and recursive procedure will be shown.

  • PDF

Parallel Pipeline Architecture of H.264 Decoder and U-Chip Based on Parallel Array (병렬 어레이 프로세서 기반 U-Chip 및 H.264 디코더의 병렬 파이프라인 구조)

  • Suk, Jung-Hee;Lyuh, Chun-Gi;Roh, Tae Moon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2013.11a
    • /
    • pp.161-164
    • /
    • 2013
  • 본 논문에서는 다양한 멀티미디어 코덱을 고속으로 처리하기 위하여 전용하드웨어가 아닌 병렬 어레이 프로세서 기반의 U-Chip(Universal-Chip) 구조를 제안하고 TSMC 80nm 공정을 사용하여 11,865,090개의 게이트 수를 가지는 칩으로 개발하였다. U-Chip은 역양자화(IQ), 역변환(IT), 움직임 보상(MC) 연산을 위한 $4{\times}16$ 개의 프로세싱 유닛으로 구성된 병렬 어레이 프로세서와 문맥적응적 가변길이디코딩(CAVLC)을 위한 비트스트림 프로세서와 인트라 예측(IP), 디블록킹필터(DF) 연산을 위한 순차 프로세서와 DMAC의 데이터 전송 및 각 프로세서를 제어하여 병렬 파이프라인 스케쥴링을 처리하는 시퀀서 프로세서 등으로 구성된다. 1개의 프로세싱 유닛에 1개의 매크로블록 데이터를 맵핑하여 총 64개의 매크로블록을 병렬처리 하였다. 64개 매크로블록의 대용량 데이터 전송 시간과 각 프로세서들의 연산을 동시에 병렬 파이프라인 함으로서 전체 연산 성능을 높일 수 있는 이점이 있다. 병렬 파이프라인 구조의 H.264 디코더 프로그램을 개발하였고 제작된 U-Chip을 통해 $720{\times}480$ 크기의 베이스라인 프로파일 영상에 대하여 코어 192MHz 동작, DDR 메모리 96MHz 동작에서 30fps의 처리율을 가짐을 확인하였다.

  • PDF

LOCATION BASED ROUTING SERVICE IN DISTRIBUTED WEB ENVIRONMENT (분산 웹 환경에서의 위치기반 라우팅 서비스)

  • Kim, Do-Hyun;Kim, Min-Soo;Jang, Byoung-Tae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.11b
    • /
    • pp.709-712
    • /
    • 2003
  • 이동체의 위치를 기반으로 하는 다양한 응용 어플리케이션들은 그 영역을 점차 확대하고 있다. 위치를 기반으로 한다는 것은 이동체의 현재위치 뿐만 아니라 과거 및 미래 위치에 대한 예측을 모두 포함한다. 이런 이동체의 위치를 효율적으로 적용할 수 있는 분야가 이동체의 위치 기반 라우팅 분석 이다. 이는 특정 이동체의 과거 위치 궤적, 실시간 현재 위치 추적, 그리고 지도정보와 결합된 최단 및 최적 경로 산출 등의 다양한 분야를 포함한다. 본 논문에서는 이런 위치 기반 라우팅 서비스를 웹 서비스 환경으로 확장한 내용을 언급한다. 웹 지리정보시스템은 사용자에게 친숙한 방법으로 지리, 속성데이터의 디스플레이 및 분석 등 다양한 서비스를 제공한다. 이는 위치기반 라우팅 서비스를 웹 지리정보시스템과의 결합하여 분산 웹 환경에서 효율적으로 라우팅 서비스를 제공할 수 있는 구조를 서술한다. 이동체의 위치는 GPS 기반의 획득 방법으로 얻어지고 지리정보와의 맵 매칭을 통해 실세계의 좌표로 변환하게 된다. 또한, 대용량 위치 데이터를 엑세스 하기 위한 메모리와 기억장치 간의 효율적인 데이터 엑세스 기법이 제시된다. 위치 기반 라우팅 분석의 결과물은 웹상에서 제공되기 위해 XML 기반의 웹 서비스 데이터로 변형된다. 이를 위한 XML 기반의 지리정보 데이터 스카마인 GML 의 적용 기술을 언급한다.

  • PDF