• Title/Summary/Keyword: Open Computing Environment

Search Result 204, Processing Time 0.029 seconds

Efficient Multicasting Mechanism for Mobile Computing Environment (스마트기기에서 얼굴 검출 기술을 이용한 3차원 화면 설계)

  • Park, Geun-Hong;Park, Su-Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.195-196
    • /
    • 2011
  • 휴대기기의 사용자 인터페이스는 사용자의 편의성에 맞춰 끊임없이 발전해 왔다. 현대의 휴대기기는 각종 센서와 다양한 기능을 이용하여 보다 확장된 서비스를 제공하며 이와 관련한 연구개발도 지속적으로 진행되고 있으며 이 분야는 지속적으로 연구개발 되어야한다. 따라서 본 연구에서는 스마트 기기의 내장된 카메라를 이용하여 3차원으로 구성된 객체를 관측하는 관측점을 제어하여 실제로 3차원 화면을 구성하는 방법을 제안하며 이를 이용해 애플리케이션의 확장된 서비스 개발에 초석을 다지는 연구개발을 목표로 하고 있다.

  • PDF

OpenCL-based Efficient Parallel Processing in a Heterogeneous Computing Environment (이기종 컴퓨팅 환경에서 OpenCL을 이용한 효율적인 병렬처리)

  • Kim, Heegon;Lee, Sungju;Chung, Yongwha;Park, Daihee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.11a
    • /
    • pp.111-114
    • /
    • 2013
  • 최근 고성능 컴퓨팅과 모바일 컴퓨팅에서 GPU 등의 성능가속기 사용이 증가함에 따라 성능가속기를 사용한 다양한 병렬처리 방법이 소개되고 있다. 그러나 성능 가속기를 처음 접하거나 성능가속기를 사용한 병렬처리 경험이 적은 사용자의 경우, 이러한 성능가속기를 이용하여 효과적인 병렬처리를 하는 것은 쉽지 않다. 본 논문에서는 성능가속기와 마이크로프로세서를 동시에 사용하여 단순히 성능가속기만을 사용한 병렬처리보다 효율적인 병렬처리 방법을 제안하고, 성능가속기만을 사용하여 얻은 성능과 제안한 방법의 성능을 비교한다. 실험결과, 제안방법은 순차처리와 비교하여 약 40배의 성능 향상을 얻을 수 있었고, 성능가속기만을 사용한 병렬처리 방법보다도 25%의 성능 향상이 가능함을 확인하였다.

Molecular Docking System using Parallel GPU (병렬 GPU를 이용한 분자 도킹 시스템)

  • Park, Sung-Jun
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.12
    • /
    • pp.441-448
    • /
    • 2008
  • The molecular docking system needs a large amount of computation and requires super-computing power. Since the experiment requires a large amount of time, the experiment is conducted in the distributed environment or in the grid environment. Recently, researches on using parallel GPU of far higher performance than that of CPU in scientific computing have been very actively conducted. CUDA is an open technique by which a parallel GPU programming is made possible. This study proposes the molecular docking system using CUDA. It also proposes algorithm that parallels energy-minimizing-computation. To verify such experiments, this study conducted a comparative analysis on the time required for experimenting molecular docking in general CPU and the time and performance of the parallel GPU-based molecular docking which is proposed in this study.

Experimental Evaluation of Unmanned Aerial Vehicle System Software Based on the TMO Model

  • Park, Han-Sol;Kim, Doo-Hyun;Kim, Jung-Guk;Chang, Chun-Hyon
    • Journal of Computing Science and Engineering
    • /
    • v.2 no.4
    • /
    • pp.357-374
    • /
    • 2008
  • Over the past few decades, a considerable number of studies have been conducted on the technologies to build an UAV (Unmanned Aerial Vehicle) control system. Today, focus in research has moved from a standalone control system towards a network-centric control system for multiple UAV systems. Enabling the design of such complex systems in easily understandable forms that are amenable to rigorous analysis is a highly desirable goal. In this paper, we discuss our experimental evaluation of the Time-triggered Message-triggered Object (TMO) structuring scheme in the design of the UAV control system. The TMO scheme enables high-level structuring together with design-time guaranteeing of accurate timings of various critical control actions with significantly smaller efforts than those required when using lower-level structuring schemes based on direct programming of threads, UDP invocations, etc. Our system was validated by use of environment simulator developed based on an open source flight simulator named FlightGear. The TMO-structured UAV control software running on a small computing platform was easily connected to a simulator of the surroundings of the control system, i.e., the rest of the UAV and the flight environment. Positive experiences in both the TMO-structured design and the validation are discussed along with potentials for future expansion in this paper.

A Study on Recommendation Method Based on Web 3.0

  • Kim, Sung Rim;Kwon, Joon Hee
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.4
    • /
    • pp.43-51
    • /
    • 2012
  • Web 3.0 is the next-generation of the World Wide Web and is included two main platforms, semantic technologies and social computing environment. The basic idea of web 3.0 is to define structure data and link them in order to more effective discovery, automation, integration, and reuse across various applications. The semantic technologies represent open standards that can be applied on the top of the web. The social computing environment allows human-machine co-operations and organizing a large number of the social web communities. In the recent years, recommender systems have been combined with ontologies to further improve the recommendation by adding semantics to the context on the web 3.0. In this paper, we study previous researches about recommendation method and propose a recommendation method based on web 3.0. Our method scores documents based on context tags and social network services. Our social scoring model is computed by both a tagging score of a document and a tagging score of a document that was tagged by a user's friends.

An Adaptively Speculative Execution Strategy Based on Real-Time Resource Awareness in a Multi-Job Heterogeneous Environment

  • Liu, Qi;Cai, Weidong;Liu, Qiang;Shen, Jian;Fu, Zhangjie;Liu, Xiaodong;Linge, Nigel
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.670-686
    • /
    • 2017
  • MapReduce (MRV1), a popular programming model, proposed by Google, has been well used to process large datasets in Hadoop, an open source cloud platform. Its new version MapReduce 2.0 (MRV2) developed along with the emerging of Yarn has achieved obvious improvement over MRV1. However, MRV2 suffers from long finishing time on certain types of jobs. Speculative Execution (SE) has been presented as an approach to the problem above by backing up those delayed jobs from low-performance machines to higher ones. In this paper, an adaptive SE strategy (ASE) is presented in Hadoop-2.6.0. Experiment results have depicted that the ASE duplicates tasks according to real-time resources usage among work nodes in a cloud. In addition, the performance of MRV2 is largely improved using the ASE strategy on job execution time and resource consumption, whether in a multi-job environment.

Evaluation of Alignment Methods for Genomic Analysis in HPC Environment (HPC 환경의 대용량 유전체 분석을 위한 염기서열정렬 성능평가)

  • Lim, Myungeun;Jung, Ho-Youl;Kim, Minho;Choi, Jae-Hun;Park, Soojun;Choi, Wan;Lee, Kyu-Chul
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.2
    • /
    • pp.107-112
    • /
    • 2013
  • With the progress of NGS technologies, large genome data have been exploded recently. To analyze such data effectively, the assistance of HPC technique is necessary. In this paper, we organized a genome analysis pipeline to call SNP from NGS data. To organize the pipeline efficiently under HPC environment, we analyzed the CPU utilization pattern of each pipeline steps. We found that sequence alignment is computing centric and suitable for parallelization. We also analyzed the performance of parallel open source alignment tools and found that alignment method utilizing many-core processor can improve the performance of genome analysis pipeline.

A Study on Effective Peer Search Algorithm Considering Peer's Attribute using JXTA in Peer-to-Peer Network (JXTA를 이용한 Peer-to-Peer 환경에서 Peer의 성향을 고려한 Peer 탐색 알고리즘의 연구)

  • Lee, Jong-Seo;Moon, Il-Young
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.4
    • /
    • pp.632-639
    • /
    • 2011
  • Searching distributed resource efficiently is very important in distributed computing, cloud computing environment. Distributed resource searching may have system overheads and take much time in proportion to the searching number, because distributed resource searching has to circuit many peers for searching information. The open-source community project JXTA defines an open set of standard protocols for ad hoc, pervasive, peer-to-peer computing as a common platform for developing a wide variety of decentralized network applications. In this paper, we proposed peer search algorithm based on JXTA-Sim. original JXTA peer searching algorithm selected a loosely-consistent DHT. Our Lookup algorithm decreases message number of WALK_LOOKUP and reduce the network system overload, and we make a result of same performance both original algorithm and our proposed algorithm.

Performance Improvement of SCAM Climate Model using PGI Compiler with OpenACC (SCAM 기상모델의 성능향상을 위한 PGI Compiler의 OpenACC 활용)

  • Lee, Chang-Hyun;Kang, Bol-Kyung;Chung, Sung-Wook
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.15 no.3
    • /
    • pp.189-197
    • /
    • 2022
  • With the development of high-performance computing technology and the advancement of numerical model, it is possible to predict the better weather forecasting. The purpose of this paper is the performance improvement for the SCAM climate model for the model running time excluding the compilation time. Therefore, the model previously performed using the Intel Fortran Compiler was changed to PGI Fortran Compiler. To this end, we reconfigure system environment variables, reset compilation options, install dependencies SW and library, and modify source code. In addition, we proposed and applied the 'PGI Compile with OpenACC' method. As a result, when the compiler was changed from intel to PGI, it led to an improvement of 6.08% in running time and when the openACC method was applied, it led to an improvement of 43.05% in running time. This demonstrates that the PGI Compile with OpenACC method proposed in this paper leads to excellent performance.

A Dynamic Power Management System for Multiple Client in Cloud Computing Environment (클라우드 환경에서 다중 클라이언트를 위한 동적 전원관리 시스템)

  • Cha, Seung-Min;Lee, Bong-Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.2
    • /
    • pp.213-221
    • /
    • 2012
  • In this paper, a dynamic power management system is proposed to reduce energy consumption for multiple clients in cloud computing environments. The proposed system monitors both keyboard and mouse input from the user, available memory, and CPU usage in the virtual machine. If the system detects no keyboard and mouse input for a certain amount of time and both available memory and CPU usage reach predefined threshold value, the manager in the virtual machine orders the client to shutdown the client machine, which results in significant power save. The developed system is applied to the real university computer lab and the performance of the system is evaluated.