• Title/Summary/Keyword: 파티션 컴퓨팅

Search Result 9, Processing Time 0.029 seconds

A Fault-tolerant Inertial Navigation System for UAVs Based on Partition Computing (파티션 컴퓨팅 기반의 무인기 고장 감내 관성 항법 시스템)

  • Jung, Byeongyong;Kim, Jungguk
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.1
    • /
    • pp.29-39
    • /
    • 2015
  • When new inertial navigation systems for an unmanned aerial vehicles are being developed and tested, construction of a fault-tolerant system is required because of various types of hazards caused by S/W and H/W faults. In this paper, a new fault-tolerant flight system that can be deployed into one or more FCCs (Flight Control Computers) is introduced, based on a partition scheme wherein each OFP (Operational Flight Program) partition uses an independent CPU and memory slot. The new fault-tolerant navigation system utilizes one or two FCCs, and executes a primary navigation OFP under development and a stable shadow OFP partition on each node. The fault-tolerant navigation system based on a single FCC can be used for UAVs with small payloads. For larger UAVs, an additional FCC with two OFP partitions can be used to provide both H/W and S/W fault-tolerance. The developed fault-tolerant navigation system significantly removes various hazards in testing new navigation S/Ws for UAVs.

Linux-based Memory Efficient Partition Scheduler using Partition Bitmap (파티션 비트맵을 이용한 메모리 효율적인 리눅스 파티션 스케줄러)

  • Kwon, Cheolsoon;Joe, Hyunwoo;Kim, Duksoo;Kim, Hyungshin
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.9
    • /
    • pp.519-524
    • /
    • 2014
  • The operating systems in the system architecture, which is integrated several applications and modular electronic devices in the same computing device, demand partitioning technology for safety. Thus, operation system requires partition scheduler for partition scheduling. When we design partition scheduler in embedded system, which has small memory and low performance, such as space system, we must consider not only performance but also memory. In this paper, we introduces a linux-based memory efficient partition scheduler using partition bitmap. This partition scheduler demands small memory space and produce low partition switching overhead. The prototype was executed on a LEON4 processor, which is the Next Generation Multicore Processor (NGMP) in the space sector. In evaluation, this prototype shows accuracy, additional memory space and low partition switching overhead.

Study of Hard Disk Layout for Xen Virtualization Environment (Xen 가상화 환경을 위한 하드디스크 레이아웃 연구)

  • Lee, Nam-Su;Kang, Dong-Woo;Kim, Se-Woog;Choi, Jong-Moo;Kim, Jun-Mo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06a
    • /
    • pp.155-157
    • /
    • 2012
  • 최근 클라우드 컴퓨팅의 핵심 기술로서 가상화 기술이 대두되고 있다. 가상화는 컴퓨터 자원의 물리적인 특징을 추상화하여 사용자에게는 논리적 자원을 제공하고 이를 통해 기술적 및 관리적 이점을 제공한다. Xen 가상화 환경에서 가상머신에 디스크 공간을 할당하는 한 가지 방식으로 하나의 하드디스크 파티션을 가상머신에 할당하는 방식이 있다. 위와 같은 환경에서는 같은 하드디스크에 존재하는 가상머신들임에도 불구하고 데이터에 접근하는 물리적 특성으로 인해 읽기/쓰기 성능 불균형이 발생하고, 가상머신의 수가 증가함에 따라 파티션 간의 최단 탐색거리 증가로 인해 동시적 읽기/쓰기의 성능이 저하되는 문제점이 발생한다. 본 논문은 이러한 문제점을 해결하기 위해 새로운 파티션 구조인 Onion 파티션 구조를 제안한다. Xen버전 4.1의 환경에서 Domain-0 커널버전 2.6.32를 수정하여 구현 및 실험을 하였다. 실험 결과, 각 가상머신의 독립적 읽기/쓰기 성능 편차가 기존대비 8%, 10%수준으로 개선되었으며, 가상머신들의 동시적 읽기/쓰기 성능은 기존대비 156.76%, 119.01%의 성능 향상을 보였다.

Performance Comparison of Task Partitioning with Offloading and Migration in MEC (MEC 환경에서 오프로딩과 마이그레이션을 이용한 태스크 파티셔닝 기법의 성능비교)

  • Moon, Sungwon;Koo, Seolwon;Lim, Yujin
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2021.11a
    • /
    • pp.100-103
    • /
    • 2021
  • 5G 의 발전과 함께 차량과 IT 통신 기술을 융합한 어플리케이션들이 급증하면서 멀티 액세스 엣지 컴퓨팅(MEC)이 차세대 기술로 등장했다. 낮은 지연시간 안에 계산 집약적인 서비스들을 제공하기 위해 단독적인 MECS 서버(MECS)에서의 수행이 아닌 다수의 MECS 에서 동시에 연산을 수행할 수 있도록 태스크를 파티셔닝하는 기법이 주목받고 있다. 특히 차량이 다수의 MECS 로 태스크를 파티셔닝하여 오프로딩하는 기법과 하나의 MECS 로 오프로딩한 후 다른 MECS 들로 파티셔닝하여 마이그레이션하는 기법들이 연구되고 있다. 본 논문에서는 오프로딩과 마이그레이션을 이용한 파티셔닝 기법들을 서비스 지연시간과 차량의 에너지 소비량 측면에서 성능을 비교 분석을 하였다.

Performance Comparison of Task Partitioning Methods in MEC System (MEC 시스템에서 태스크 파티셔닝 기법의 성능 비교)

  • Moon, Sungwon;Lim, Yujin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.11 no.5
    • /
    • pp.139-146
    • /
    • 2022
  • With the recent development of the Internet of Things (IoT) and the convergence of vehicles and IT technologies, high-performance applications such as autonomous driving are emerging, and multi-access edge computing (MEC) has attracted lots of attentions as next-generation technologies. In order to provide service to these computation-intensive tasks in low latency, many methods have been proposed to partition tasks so that they can be performed through cooperation of multiple MEC servers(MECSs). Conventional methods related to task partitioning have proposed methods for partitioning tasks on vehicles as mobile devices and offloading them to multiple MECSs, and methods for offloading them from vehicles to MECSs and then partitioning and migrating them to other MECSs. In this paper, the performance of task partitioning methods using offloading and migration is compared and analyzed in terms of service delay, blocking rate and energy consumption according to the method of selecting partitioning targets and the number of partitioning. As the number of partitioning increases, the performance of the service delay improves, but the performance of the blocking rate and energy consumption decreases.

Matrix-based Filtering and Load-balancing Algorithm for Efficient Similarity Join Query Processing in Distributed Computing Environment (분산 컴퓨팅 환경에서 효율적인 유사 조인 질의 처리를 위한 행렬 기반 필터링 및 부하 분산 알고리즘)

  • Yang, Hyeon-Sik;Jang, Miyoung;Chang, Jae-Woo
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.7
    • /
    • pp.667-680
    • /
    • 2016
  • As distributed computing platforms like Hadoop MapReduce have been developed, it is necessary to perform the conventional query processing techniques, which have been executed in a single computing machine, in distributed computing environments efficiently. Especially, studies on similarity join query processing in distributed computing environments have been done where similarity join means retrieving all data pairs with high similarity between given two data sets. But the existing similarity join query processing schemes for distributed computing environments have a problem of skewed computing load balance between clusters because they consider only the data transmission cost. In this paper, we propose Matrix-based Load-balancing Algorithm for efficient similarity join query processing in distributed computing environment. In order to uniform load balancing of clusters, the proposed algorithm estimates expected computing cost by using matrix and generates partitions based on the estimated cost. In addition, it can reduce computing loads by filtering out data which are not used in query processing in clusters. Finally, it is shown from our performance evaluation that the proposed algorithm is better on query processing performance than the existing one.

Support for ARINC 653 Processes over Linux-based Unmanned Aerial Vehicles (리눅스 기반의 무인항공기를 위한 ARINC 653 프로세스 지원)

  • Han, Sang-Hyun;Lee, Sang-Hun;Jin, Hyun-Wook
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.11
    • /
    • pp.1056-1060
    • /
    • 2010
  • The software running on avionic systems is required to be highly reliable and productive. Due to these demands, the standard such as ARINC 653 has been suggested, which includes the abstraction of resource partitioning and defines interfaces between avionic operating system and applications. Though there are many manned aerial vehicles employing ARINC 653 based operating systems, Linux-based ARINC 653 for unmanned aerial vehicles has not been studied yet. In this paper, we propose the design of Linux-based ARINC 653 process model and present preliminary implementation. The experiment results present that the implementation is enough to support control software of unmanned helicopter.

An Efficient Method to Find Accurate Spot-matching Patterns in Protein 2-DE Image Analysis (단백질 2-DE 이미지 분석에서 정확한 스팟 매칭 패턴 검색을 위한 효과적인 방법)

  • Jin, Yan-Hua;Lee, Won-Suk
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.5
    • /
    • pp.551-555
    • /
    • 2010
  • In protein 2-DE image analysis, the accuracy of spot-matching operation which identifies the spot of the same protein in each 2-DE gel image is intensively influenced by the errors caused by the various experimental conditions. This paper proposes an efficient method to find more accurate spot-matching patterns based on multiple reference gel images in spot-matching pattern analysis in protein 2-DE image analysis. Additionally, in order to improve the reduce the execution time which is increased exponentially along with the increasing number of gel images, a "partition then extension" framework is used to find spot-matching pattern of long length and of higher accuracy. In the experiments on real 2-DE images of human liver tissue are used to confirm the accuracy and the efficiency of the proposed algorithm.

A Study on Sharing the Remote Devices through USB over IP (USB/IP를 이용한 원격장치공유에 대한 연구)

  • Yoo, Jin-Ho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.11
    • /
    • pp.4592-4596
    • /
    • 2010
  • This paper is related to the method for sharing some remote devices through USB/IP on the connected system environment. Sharing the remote devices is actually based on the connection technology using USB which is one way of access methods on virtualized server environment. The users who receive server computing unit might want to connect to remote allocated server with the local devices. We can solve the problem of the access methods related to the sharing devices through USB device emulation. This paper discusses the implementation of USB emulation which is based on personalized services on virtualized server environment. Like this, this paper will share devices on the level of USB device. This research can write to the device directly due to virtualizing the device level.