Earticle

This paper suggests a visual debugging plaftorm based on the game engine, Unity3D for massive parallel processing routines implemented in CUDA. In general, it is tiresome to debug or check the accuracy of numerical geometry information results calculated in a parallel way by GPU; usually, developers would pick and check each numerical value by rummaging overwhelming lines of seemingly meaningless numbers. This manual process is less productive and time-consuming. Also, it is not easy to produce some continuous movements of geometry information to check the validity of implemented CUDA codes for realtime geometry processing applications. To solve those problems, this paper presents a way to use Unity3D game engine to visually and interactively debug CUDA implementations. Also, some practical test results are presented with discussions on limitations of Unity3D as a CUDA debugging platform.

최근 다양한 클라우드 서비스가 데스크탑 및 서버 컴퓨터 뿐만 아니라 모바일 장치에 적용되었다. 또한 스 마트폰 사용자들이 급속히 증가는 클라우드 서비스, 게임, 은행업무 및 모바일 사무실과 같은 다양한 서비스를 즐기 면서 클라우드 환경에서의 IT 자원의 효율적 관리 방안이 요구되었다. 본 논문에서는 모바일 장치들 간에 상호 이용 가능한 물리 장치인 CPU, 메모리 및 저장장치들을 가상화 하고, 가상화 기반의 클라우드 환경에서 물리적 자원의 효율적 사용방법을 제시한다. 제안된 기술은 모바일 단말기의 서비스 활용시에 클라우드 접속을 통한 가상화 기반의 자원 관리가 효율적임을 증명하였고, 또한 처리과정의 실시간성을 보장하였다.

Recently, various cloud service has been being provided on mobile devices as well as desktop pc and server computer. Also, Smartphone users are very rapidly increasing, and they are using it for enjoying various services(cloud service, game, banking service, mobile office, etc.). So, research to utilize resources on mobile device has been conducted. In this paper, We have suggested efficient method of cloud resource management by using information of available physical resources(CPU, memory, storage, etc.) between mobile devices, and information of physical resource in mobile device. Suggested technology is possible to guarantee real-time process and efficiently manage resources.

본 논문에서는 인터넷 프로토콜 라우팅에서 널리 사용되는 벨만-포드 라우팅 알고리즘을 그래픽스 처리 장치 상에서 구현한다. 제안하는 그래픽스 처리 장치 기반 소프트웨어 라우터 구현 기법에서는 각각의 정점 거리를 순차적으로 계산하는 기존 방법과 달리, 수많은 스트리밍 프로세서의 다중 쓰레드를 동시에 수행함으로써 정점 거리 계산을 가속화 시킨다. 또한, 본 논문에서는 다양한 수의 정점을 변화시키면서 제안하는 기법과 CPU를 이용한 동일한 순차 구현과의 성능 및 에너지 소모량을 비교한다. 모의실험결과, 제안하는 GPU기반 기법은 수많은 스트리밍 프로세서를 동시에 수행함으로써CPU 기반 구현 보다 15배에서 242배의 우수한 성능을 보였다. 또한, 제안하는 기법은 CPU 구현보다 평균적으로 90% 이상의 에너지 소모를 줄였다.

his paper presents a GPU-based implementation of the Bellman-Ford (BF) routing algorithm widely used in internet protocol (IP) routing. In the proposed GPU-based approach, multiple threads concurrently run in numerous streaming processors in the GPU to update the routing information instead of computing the individual vertex distances one-by-one, where an individual vertex distance is considered as a single thread. In this paper, we compare the performance and energy consumption of the GPU-based approach with that of the equivalent CPU-based implementation for varying the number of vertices. Experimental results show that the GPU-based approach achieves 15x to 242x better performance than the CPU-based implementation in terms of execution time because of executing numerous streaming processors of GPU concurrently. In addition, the proposed GPU-based approach reduces about 90% energy consumption compared to the sequential CPU-based implementation.

마이크로커널 기반의 기능성 서버인 디스크 캐쉬 관리자(DCM)은 공유 디스크의 입출력 성능을 향상하는 목적으로 설계 및 구현되었다. DCM은 Misix3 마이크로커널의 멀티 쓰레드 모드로 동작하는 시스템 엑터간의 포트 를 통하여 다른 서버들과 메시지 교환으로 정합한다. 본 논문에서 제안된 DCM은 병렬 입출력이 가능하도록 공유 디스크를 논리적으로 Seven 디스크와 Sodd 디스크로 나누어 사용한다. 본 논문에서 제안하는 DCM은 특정 디스크의 사용 빈도에 따라 캐쉬 사이즈를 증감함으로써 이용율이 높은 디스크의 캐시 사이즈 확대하여 캐시 적중률을 높여주 므로서 효과적인 성능을 향상할 수 있게 한다. 경험적 결과를 통해서, 본 논문에서 제안한 DCM은 높은 이용율을 갖 는 공유 디스크에서 아주 효과적임을 보였다.

Disk Cache Manager(DCM), a functional server of microkernel based, to improve the I/O power of shared disks is designed and implemented in this work. DCM interfaces other different servers with message passing through ports by serving as a system actor the multi-thread mode on the Minix3 micro-kernel. DCM proposed in this paper uses the shared disk logically as a Seven Disk and Sodd Disk to enable parallel I/O. DCM enables the efficient placement of disk data because it raises disk cache hit-ratio by increasing the cache size when the utilization of the particular disk is high. Through experimental results, we show that DCM is quite efficient for a shared disk with higher utilization.

스테레오 비전 분야에서 영역 기반의 영상 정합은 스테레오 영상 분석을 위한 대표적인 방법이다. SAD (Sum of Absolute Difference) 알고리즘은 영역 기반 정합 알고리즘의 한 종류로서 대규모 데이터 집약적 계산을 요 구하여 소프트웨어 방식을 사용할경우 처리속도가 매우 느리게 된다. 본 논문에서는 소프트웨어 기반 SIMD (Single Instruction Multiple Data) 병렬 기법인 SSE (Streaming SIMD Extensions) 명령어를 이용한 고속 SAD 알고리즘을 제안한다. SSE 명령어를 지원하는 CPU는 16개의 128비트크기의 XMM 레지스터를 보유하여 SIMD 명령어 집합 확장을 가능하게 하였다. 제안하는 소프트웨어 기반 병렬 고속화 기법의성능 측정을 위하여 일반 적 SAD를 이용한 영상 정합 알고리즘과 SSE 명령어를 사용한 알고리즘의 수행 속도차이를 측정하였다. 제안하는 기법은 일반적 SAD 알고리즘보다 평균 4배의 성능 향상의 결과를 보임으로 소프트웨어 기반 고속병 렬 처리를 통한 실시간 스테레오 비전 응용분야에 효과적으로 적용될 수 있음을 보였다.

Area-based stereo matchng algorithms are widely used for image analysis for stereo vision. SAD (Sum of Absolute Difference) algorithm is one of well known area-based stereo matchng algorithms with the characteristics of data intensive computing application. Therefore, it requires very high computation capabilities and its processing speed becomes very slow with software realization. This paper proposes a fast SAD algorithm utilizing SSE (Streaming SIMD Extensions) instructions based on SIMD (Single Instruction Multiple Data) parallism. CPU supporing SSE instructions has 16 XMM registers with 128 bits. For the performance evaluation of the proposed scheme, we compare the processing speed between SAD with/without SSE instructions. The proposed scheme achieves four times performance improvement over the general SAD, which shows the possibility of the software realization of real time SAD algorithm.

GPU는 높은 연산 성능에 비해 그래픽 처리를 하지 않을 경우에는 유휴상태에 놓여있다. 최근 유휴상태인 GPU를 이용하여 그래프 문제, 대용량 탐색 및 정렬, 행렬 연산 등 다양한 문제들을 병렬처리 하는 GPGPU가 각광받고 있고 NVIDIA사의 CUDA플랫폼의 등장으로 이러한 흐름은 더욱 가속화 되고 있다. GPGPU의 발전에 맞추어 GPU상에서 몇몇의 암호 알고리즘들이 구현되었지만, 스트림 암호의 경우에는 최근에서야 ECRYPT에 의해 표준이 제정되었기 때문에 아직 연구 결과가 미비하다. 이에 본 논문에서는 ECRYPT의 소프트웨어 기반 암호인 Salsa20을 GPU상에서 구현하고 이를 최적화하였으며, 파이프라이닝 기법을 사용하여 성능을 극대화하였다. 본 논문의 실험 결과에 따르면 CUDA를 사용한 Salsa20은 6.2Gbps의 암호화 속도를 보여주어 138.7Mbps의 성능을 보인 CPU상에서의 구현에 비해 무려 45배 이상의 성능 향상을 보여주었다.

Recent performance improvements in GPU enabled optimized parallel implementation of various algorithmsincluding graph algorithms, searching and sorting of massive data, matrix operations, and so on. After theadvent of CUDA platform of NVIDIA, more algorithms including several cryptographic algorithms are beingimplemented over GPUs. However, little work has been done on the parallel implementation of stream ciphersbecause it hasn’t been long since the first standard for stream cipher were published by ECRYPT. In thispaper, we provide a parallel implementation of Salsa20 stream cipher, one of the four software-based streamciphers in the ECRYPT standard, over a GPU, and optimize its performance using a pipelining technique.According to our experimental results, the throughput of Salsa20 on the CUDA platform is up to 6.2Gbps,which is approximately 45 times faster than the implementation over a CPU with 138.7Mbps.

기존 하드웨어 기반의 소프트웨어 검증 플랫폼이 가지는 제한 조건을 해결하는 방안으로 위성 개발 초기부터 소프트웨어 기반의 위성 시뮬레이터 개발이 함께 시작되며, 위성 시뮬레이터를 활용할 경우 탑재소프트웨어 개발이 지속적으로 이루어 질 수 있는 큰 장점을 가지게 된다. 위성 시뮬레이터는 탑재컴퓨터, 위성의 전자장비 그리고 탑재체까지 모두 모사해주며 소프트웨어 개발자들이 사용할 수 있도록 쉽게 복제, 배포가 가능하며 위성 하드웨어 형상이 변경되더라도 적용 및 변경이 용이하다. 그리고 실제 하드웨어 에서 동작하는 탑재소프트웨어를 별도의 수정 없이 로딩할 수 있으며, 개발자를 위한 디버깅 채널과 테스트 환경을 제공하며 실제 수행시간 보다 빠르게 가속화 할 수 있는 기능을 제공한다. 본 논문에서는 현재 개발 중인 정지궤도복합위성의 특징인 Hot-Standby 잉여구조를 지원하기 위한 위성 시뮬레이터의 구조와 개발방안을 제시하고, 시뮬레이터 기반에서 탑재소프트웨어 개발 및 테스트 방안을 제시한다.

The software-based satellite simulator has been developed from the start of the project to resolve the restriction and limitation of using hardware-based software development platform. It enables the development of flight software to be performed continuously since initial phase. The satellite simulator emulates the on-board computer, I/O modules, electronics and payloads, and it can be easily adapted and changed on hardware configuration change. It supports the debugging and test facilities for software engineers to develop flight software. Also the flight software can be loaded without any modification and can be executed as faster than real-time. This paper presents the architecture and design of software-based GEO satellite simulator which has hot-standby redundancy mechanism, and flight software development and test under this environment.

최근 페이스북, 트위터 등의 SNS(Social Networking Service)가 발전함에 따라, 사용자가 생성하는 데이터가 급격히 증가하고 있다. 사용자 데이터는 민감한 개인정보를 포함하기 때문에, 원본 데이터를 공격자로부터 보호하기 위해서는 데이터를 암호화하는 것이 필요하다. 따라서 암호화된 데이터의 복호화 없이 질의를 처리하는 암호화 질의 처리 기법이 제안되었다. 그러나 기존의 질의처리 기법은 암호화 데이터에 대한 색인 구조를 구축하고 이를 순차적 으로 탐색하기 때문에, 데이터의 크기가 증가함에 따라 질의탐색 비용이 증가하는 문제점이 존재한다. 이를 위해, P.B.Volk, et al.은 prefix 트리 기반 병렬 질의처리 알고리즘을 제안하였다. 제안하는 알고리즘은 암호화된 데이 터를 위해 prefix 트리 구조를 구축하고, 트리를 부분 트리로 분할하여 생성된 모든 부분 트리를 병렬적으로 탐색한 다. 그러나 이 알고리즘은 모든 부분 트리를 탐색하기 때문에, 트리 깊이에 따라 연산 비용이 급격히 증가하는 문제 점이 존재한다. 아울러, 이 알고리즘은 범위 질의나 부분 매칭 등의 다양한 질의를 지원하지 못하는 문제점이 존재 한다. 이러한 문제를 해결하기 위해, 본 논문에서는 prefix 트리 및 해시 테이블을 사용하는 GPU 기반 병렬 질의처 리 알고리즘을 제안한다. 제안하는 알고리즘은 prefix 트리 loop-up 테이블을 사용하여 범위 질의 및 부분매칭 질 의를 지원한다. 아울러 제안하는 알고리즘이 기존 P.B.Volk, et al. 의 알고리즘보다 검색 시간 측면에서 약 30% 우수한 성능을 나타냄을 보인다.

Recently, social networking services, such as Facebook and Twitter, have been widely used, so the amount of the data created by users has been dramatically increased. Because the user-created data can contain privacy information, it is required to encrypt the data for protecting the original data from adversaries. Thus, an encrypted query processing scheme has been proposed to process the query without the decryption of the encrypted data. The existing schemes construct an index for the encrypted data, so they can process the query by sequentially accessing the index. As a result, the query processing cost increases as the amount of the data is increased. For this, P.B.Volk, et al. proposed a prefix-tree based parallel query processing algorithm. The algorithm constructs a prefix-tree structure for the encrypted data and searches all sub-trees on GPU in parallel by dividing the tree into sub-trees. However, the algorithm has a problem that its computational cost is highly increased according to the depth of the tree because it searches all sub-trees. In addition, the algorithm does not support the various types of queries, such as a range query and a partial matching query. To solve these problems, we, in this paper, propose a GPU-based parallel query processing algorithm using both a prefix-tree and a hash table. By using the prefix-tree look-up table, the proposed algorithm can support both a range query and a partial matching query. In addition, we show that the proposed algorithm is about 30% better on retrieval performance than the existing algorithm by P.B.Volk, et al.

3D Graphic Rendering has been used to express realistic, 3-dimensional, and emphasized effects in the graphics. As 3D Graphic Rendering developed and became more prevalent, the need for acceleration in data processing grew as well, leading to a development of GPU (Graphic Processing Unit) and shading language used for GPU such as GLSL (OpenGL Shading Language) and HLSL (Higher Language Shading Language). 3D Graphic Rendering based on GPU, however, clearly has its limitation in processing complicated calculations such as calculating curvatures of the surface or ray tracing method, especially as the greater magnitude of the 3D polygonal model data is being used. The following paper will discuss the new method of 3D graphic rendering that is based on faster GPU parallel processing system called CUDA (Compute Unified Device Architecture) to administer 3D polygonal model data and process calculations. In the paper, we will discuss about the characteristics of CUDA and test for graphic rendering of 3D polygonal model according to those characteristics. We will also examine whether it is possible to accelerate the graphic rendering process using CUDA for 3D graphic rendering.

This paper proposes a method for optimizing and parallelizing a pedestrian detection algorithm based on CENTRIST in the embedded environment. Pedestrian detection is applied to various areas, but there is a difficulty in the real-time processing of pedestrian detection in the embedded environment. In this paper, a pedestrian detection algorithm that has improved performance by reducing unnecessary memory access due to duplicate computations for real-time processing. The proposed algorithm was implemented in the ALDEBARAN embedded processor(300MHz) which can perform parallel processing. For efficient parallel processing, images were divided into halves which were then processed separately in two CPU cores and the volume of computations was balanced between the two CPU cores. For input images, 512x360 sized images were used. The single core showed the performance of 3.1 frames per second. In the dual core for which the wait time in the process of parallelizing was reduced, the performance improved by about 55% to 4.8 frames per second.

Microarray gene expression techniques and tools have become of a substantial importance and widely used to analyze the protein-protein interaction (PPI) and gene regulation network (GRN) research in recent years since it can capture the expressions of thousands of genes in a single experiment. Such dataset poses a great challenge for finding association rules in a faster way because of the presence of large number of columns but a small number of rows. Therefore, to meet the challenge of high volume of gene expression and the complexity of microarray data, various data mining methods and applications have been proposed for analyzing gene expressions. However, it is not trivial to extract biologically meaningful information from the huge amount of gene expression data in understanding of gene regulation networks and cellular state, because most cellular processes are regulated by changes in gene expression. Association rule mining techniques are helpful to find relationship between genes, but most of the developed association rule mining algorithms are based on main memory and single processor based techniques which are not capable of handling ever increasing large data and producing result in a faster way. In this paper, we proposed a MapReduce framework for mining association rules from a huge microarray gene expression dataset on Hadoop; which not only overcomes of the main memory bottleneck but also highly scalable in terms of increasing data size. When we apply this new method to the mice lungs and spinal cord microarray compendium data, it identifies a majority of known regulons as well as novel potential target genes of numerous key transcription factors. Extensive experimental results show that our proposed approach is efficient for mining high confident association rules from large microarray gene expression datasets in terms of time and scalability.

Once a designed network is embedded into a newly designed network, a developed algorithm in the designed network is reusable in a newly designed network. Petersen-Torus has been designed recently, and Hyper Petersen has already been designed as a well-known interconnection network. In this study, it was proven that Hyper Petersen network whose degree increases with the increased number of nodes can be embedded into a Petersen-Torus network having fixed degree. Hyper Petersen was embedded into Petersen-Torus PT(n,n) with expansion 1, dilation 1.5n+2, and congestion 5n. The embedding algorithm was designed for expansion 1, and congestion and dilation are in proportion to O(n) owing to the aspect of Hyper Petersen that the degree increases.

The technological demand for graphically generating natural plants in real time recently have been more and more increasing in a variety of interactive content-creating areas such as computer games. In this paper, we propose a GPU-driven high-speed parallel processing algorithm for generating trees and their branches and leaves in real time. The method that we propose ensures the realistic generation of a multitude of trees and motions of their branches and leaves triggered by external force while it maintains the stability of the system.

Hadoop–a popular open-source implementation of MapReduce is widely used for the analysis of large datasets. The current Hadoop implementation assumes that computing nodes in a cluster are homogeneous in nature. In this paper we evaluate performance of Hadoop Platform and Oracle for Distributed Parallel Processing in large datasets. For evaluation, we implement a prototype of a virtual datacenter using distributed and parallel computing technology. The purpose of this paper is to reduce datacenter implementation cost using commodity hardware and provide high performance. Hadoop is installed on a commodity Linux cluster the distributed processing of large data sets across clusters of computers using distributed and parallel computing architecture. This paper also helps to explain about some new technology and framework which are open source; that can easily utilize those technologies for our complex data analysis which resembling structured, semi structured and non-structured data. Here we tried to demonstrate a performance comparison by executing some queries between distributed parallel computing system and traditional single computing system. For the simulation of the infrastructure Hadoop cluster has been used for distributed parallel processing and Oracle 11g is used for traditional single processing system. We prepare three virtual host for Hadoop cluster and a high-end hardware for Oracle 11g.

Cloud computing is a technology in which the Cloud Service Providers (CSP) provide many virtual servers to the users to store their information in the cloud. The faults occurring on the assignment and dismission of the virtual machines, the processing cost in the allocation of resources must also be considered. The parallel processing of the information on the virtual machines must be done effectively and in an efficient manner. A variety of systems were developed to facilitate Many Task Computing (MTC). These systems aim to hide the issues of parallelism and fault tolerant and they are used in many applications. In this paper, we introduced Nephele, a data processing framework to exploit dynamic resource provisioning offered by IaaS clouds. The performance evaluation of the virtual machines has been evaluated and the allocation and de-allocation of job tasks to the specific virtual machines has also been considered. A performance comparison with the well known data processing framework hadoop has been done. Thus this paper tells about the effective and efficient manner of processing the data by parallel processing and allocating the correct resources for the desired task. It also helps to reduce the cost of resource utilization by exploiting the dynamic resource utilization.

Intelligent Transportation Systems (ITS) is one of the important application areas of the Internet of Things (IoT). The key issue is how to process the huge events generated by IoT system to support ITS. In this paper a proactive parallel complex event processing method is proposed for congestion control in large-scale ITS. A Bayesian model averaging method is used to obtain accurate predictions under different event context. Based on the predictive analysis, a parallel Markov decision processes model is designed to support decision making for large-scale ITS. An optimized parallel policy iteration algorithm is proposed based on state partition and policy decomposition. The experimental evaluations show that this method has good accuracy and scalability when used to process congestion control in large-scale ITS.

Processing very large graphs efficiently is a challenging task. Distributed graph processing systems process the billion-scale graphs efficiently but incur overheads of partitioning and distribution of the large graph over a cluster of nodes. In order to overcome these problems a disk-based engine, GraphChi was proposed recently that processes the graph in chunks on a single PC. GraphChi significantly outperformed all the representative distributed processing frameworks. Still, we observe that GraphChi incurs some serious degradation in performance due to 1) high number of non-sequential I/Os for processing every chunk of the graph; and 2) limited parallelism to process the graph. In this paper, we propose a novel engine named BiShard Parallel Processor (BSPP) to efficiently process billions-scale graphs on a single PC. We introduce a new storage structure BiShard. BiShard divides the large graph into subgraphs and maintains the in and out edges separately. This storage mechanism significantly reduces the number of non-sequential I/Os. We implement a new processing model named BiShard Parallel (BSP) on top of Bishard. BSP exploits the properties of Bishard to enable full CPU parallelism for processing the graph. Our experiments on real large graphs show that our solution significantly outperforms GraphChi.

This paper discusses an effective synchronization algorithm. It is different from the existing synchronization methods by inserting appropriate synchronization instructions between statements according to different kinds of data dependences. The overhead caused by too many synchronization instructions in a loop can be a critical problem. Synchronization optimization is a method which discriminates and eliminates the redundant synchronization instructions in a loop. In this paper, a new synchronization optimization algorithm - ICPG (Improved Controlled Path Graph) - is developed, and the algorithm is extended to the case of nested loops. In case of nested loops, the existing methods were not safe because of the incomplete management in hyper-rectangle areas, etc. But, the errorneous methods are completely corrected in this paper. Finally, performance analysis using simulation on the UNIX operating system is carried out. It is shown that the ICPG algorithm is much more effective than the existing methods.

도로이동 오염원 대기환경 빅데이터는 상시 교통량 조사장비인 AVC, VDS, WIM, DTG를 활용한 차종, 속도, 하중 등 실시간 교통류 데이터와 GIS를 활용한 도로형상(오르막, 내리막, 회전구간) 데이터를 연계한 교통류 데이터로 구성되어 있다. 또한, 일반적인 데이터와 달리 단위시간 당 데이터가 많이 발생하고, 다양한 포맷을 가지고 있다. 특히, 이들 상세 교통류 정보로 수집되는 대용량의 실시간 데이터들은 약 총 740만 건/시간 이상이 수집되어 저장 및 가공되 기 때문에 효율적으로 데이터를 처리할 수 있는 시스템이 필요하다. 따라서 본 연구에서는 도로이동 오염뭔 대기환경 빅데이터 시각화를 위한 오픈소스 기반의 데이터 병렬처리 성능 최적화 연구를 수행한다.

Road movement pollutant air environment big data is a link between real-time traffic data such as vehicle type, speed, and load using AVC, VDS, WIM, and DTG, which are always traffic volume survey equipment, and road shape (uphill, downhill, turning section) data using GIS. It consists of traffic flow data. Also, unlike general data, a lot of data per unit time is generated and has various formats. In particular, since about 7.4 million cases/hour or more of large-scale real-time data collected as detailed traffic flow information are collected, stored and processed, a system that can efficiently process data is required. Therefore, in this study, an open source-based data parallel processing performance optimization study is conducted for the visualization of big data in the air environment of road transport pollution.

Circuit testing process is very important in IC Manufacturing there are two ways in research for circuit testing improvement. These are ATPG Tool Design and Test simulation application. We are interested in how to use parallel technique such as one-side communication, parallel IO and dynamic Process with data partition for circuit testing improvement and we use one-side communication technique in this paper. The parallel ATPG Tool can reduce the test pattern sets of the circuit that is designed in laboratory for make sure that the fault is not occur. After that, we use result for parallel circuit test simulation to find fault between designed circuit and tested circuit. From the experiment, We use less execution time than non-parallel Process. And we can set more parameter for less test size. Previous experiment we can't do it because some parameter will affect much waste time. But in the research, if we use the best ATPG Tool can optimize to least test sets and parallel circuit testing application will not work. Because there are too little test set for circuit testing application. In this paper we use a standard sequential circuit of ISCAS89.