• Title/Summary/Keyword: 블록 레벨 I/O

Search Result 8, Processing Time 0.018 seconds

Single I/O System Using ENBD on Linux PC Clusters (리눅스 PC 클러스터에서 ENBD를 이용한 SIOS)

  • 김태규;김방현;김종현
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.4-6
    • /
    • 2004
  • 클러스터 컴퓨터에서 접속된 모든 노드들의 디스크들을 통합 사용하기 위한 SIOS의 구현은 사용자 레벨과 파일 시스템 레벨, 그리고 디바이스 드라이버 레벨로 분류할 수 있다. 본 연구에서 제안하는 방법은 현재 공개되어 있는 소프트웨어 라이브러리만을 이용하여 리눅스 클러스터에서 SIOS를 구현하는 방법으로서, 확장 네트워크 블록 디바이스(ENBD: Enhanced Network Block Device)를 이용한 디바이스 드라이버 레벨의 하위 계층과 S/W RAID 및 NFS를 이용한 파일 시스템 레벨의 상위 계층으로 구성된다. 이 방법의 주요 장점은 현재 공개되어 있는 소프트웨어 라이브러리를 이용하기 때문에 구현이 용이하고 비용이 들지 않는다는 점이다. 그리고 하위 계층으로서 디바이스 드라이버 레벨의 ENBD를 이용하기 때문에 파일 시스템을 변경하지 않기 때문에 이전의 응용 프로그램에 대한 호환성이 높다. 또한, 상위 계층에서는 파일 시스템 레벨의 S/W RAID와 NFS를 이용함에 따라 디스크 배열 방식의 조정이 비교적 자유롭다. 또 다른 장점은 하위 계층과 상위 계층이 서로 독립적이기 때문에, 클러스터의 사용 목적에 따라 각 계층을 다양한 방법으로 변경할 수 있다는 것이다. Bonnie 벤치마크를 이용한 성능 측정 결과에 따르면, ENBD를 이용하여 RAID-5로 구성한 경우에 오버헤드가 높은 NFS를 사용했음에도 불구하고 비용이 많이 드는 다른 방법과 대등한 성능을 보였으며, 부분적으로는 더 높은 성능과 확장성을 가지는 것으로 나타났다.

  • PDF

An Efficient Caching Algorithm to Minimize Duplicated Disk Blocks in 2-level Disk Cache System (2-레벨 디스크 캐쉬 시스템에서 디스크 블록 중복 저장을 최소화하는 효율적인 캐싱 알고리즘)

  • 류갑상;정수목
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.1
    • /
    • pp.57-64
    • /
    • 2004
  • The speed gap between processors and disks is a serious problem. So, I/O sub-system limits the performance of computer system. To overcome the speed gap, caches have been used in computer system. By using cache, the access times to disk blocks can be reduced and the performance of computer system can be improved. In this paper, we proposed an efficient cache management algorithm for computer system which have buffer cache and disk cache. The proposed algorithm can minimize the duplicated blocks between buffet cache and disk cache. We evaluate the proposed algorithm by trace-driven simulation. The simulation results show that the proposed algorithm can reduce the mean access time to disk blocks.

  • PDF

I/O Translation Layer Technology for High-performance and Compatibility Using New Memory (뉴메모리를 이용한 고성능 및 호환성을 위한 I/O 변환 계층 기술)

  • Song, Hyunsub;Moon, Young Je;Noh, Sam H.
    • Journal of KIISE
    • /
    • v.42 no.4
    • /
    • pp.427-433
    • /
    • 2015
  • The rapid advancement of computing technology has triggered the need for fast data I/O processing and high-performance storage technology. Next generation memory technology, which we refer to as new memory, is anticipated to be used for high-performance storage as they have excellent characteristics as a storage device with non-volatility and latency close to DRAM. This research proposes NTL (New memory Translation layer) as a technology to make use of new memory as storage. With the addition of NTL, conventional I/O is served with existing mature disk-based file systems providing compatibility, while new memory I/O is serviced through the NTL to take advantage of the byte-addressability feature of new memory. In this paper, we describe the design of NTL and provide experiment measurement results that show that our design will bring performance benefits.

Development of Test Equipment for KSLV-I Upper Stage (KSLV-I 상단부 시험장비(UTE) 설계 및 개발)

  • Kim, Kwang-Soo;Lee, Soo-Jin;Chung, Eui-Seung;Park, Jeong-Joo
    • Aerospace Engineering and Technology
    • /
    • v.6 no.2
    • /
    • pp.171-179
    • /
    • 2007
  • The Test Equipment for the upper stage of KSLV-I has following functions via umbilical cable interface; external power supply, command output such as discrete and analog, data acquisition, CS-I interface simulation for first stage of KSLV-I and RS-422 serial communication for PDU. The main purpose of UTE is the experiment or function verification of system-level upper stage. To realize this system, we used PXI control system. The UTE is consisted of the PXI control system, power supply, terminal block, internal harness, connector panel and so on. The software functions of UTE are classified by four blocks. These are Discrete/Analog I/O control, PDU RS-422 serial communication control, power supply GPIB control and UTE remote control. In this paper, we will describe the design on the hardware and software of UTE.

  • PDF

An Improved Way of Remote Storage Service based on iSCSI for Mobile Device using Intermediate Server (모바일 디바이스를 위한 iSCSI 기반의 원격 스토리지 서비스에서 중간 서버를 이용한 성능 개선 방안)

  • Kim Daegeun;Park Myong-Soon
    • The KIPS Transactions:PartC
    • /
    • v.11C no.6 s.95
    • /
    • pp.843-850
    • /
    • 2004
  • As mobile devices prevail, requests for various services using mobile devices have increased. Requests for application services that require large data space such as multimedia, game and database [1] specifically have greatly increased. However, mobile appliances have difficulty in applying various services like a wire environment, because the storage capacity of one is not enough. Therefore, research (5) which provides remote storage service for mobile appliances using iSCSI is being conducted to overcome storage space limitations in mobile appliances. But, when iSCSI is applied to mobile appliances, iSCSI I/O performance drops rapidly if a iSCSI client moves from the server to a far away position. In the case of write operation, $28\%$ reduction of I/O performance occurred when the latency of network is 64ms. This is because the iSCSI has a structural quality that is very .sensitive to delay time. In this paper, we will introduce an intermediate target server and localize iSCSI target to improve the shortcomings of iSCSI performance dropping sharply as latency increases when mobile appliances recede from a storage server.

An Efficient Page-Level Mapping Algorithm for Handling Write Requests in the Flash Translation Layer by Exploiting Temporal Locality (플래시 변환 계층에서 시간적 지역성을 이용하여 쓰기 요청을 처리하는 효율적인 페이지 레벨 매핑 알고리듬)

  • Li, Hai-Long;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.10
    • /
    • pp.1167-1175
    • /
    • 2016
  • This paper proposes an efficient page-level mapping algorithm that reduces the erase count in the FTL for flash memory systems. By maintaining the weight for each write request in the request buffer, the proposed algorithm estimates the degree of temporal locality for each incoming write request. To exploit temporal locality deliberately for determination of hot request, the degree of temporal locality should be much higher than the reference point determined experimentally. While previous LRU algorithm treats a new write request to have high temporal locality, the proposed algorithm allows write requests that are estimated to have high temporal locality to access hot blocks to store hot data intensively. The pages are more frequently updated in hot blocks than warm blocks. A hot block that has most of invalid pages is always selected as victim block at Garbage Collection, which results in delayed erase operation and in reduced erase count. Experimental results show that erase count is reduced by 9.3% for real I/O workloads, when compared to the previous LRU algorithm.

Design and Implementation of iATA-based RAID5 Distributed Storage Servers (iATA 기반의 RAID5 분산 스토리지 서버의 설계 및 구현)

  • Ong, Ivy;Lim, Hyo-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.2
    • /
    • pp.305-311
    • /
    • 2010
  • iATA (Internet Advanced Technology Attachment) is a block-level protocol developed to transfer ATA commands over TCP/IP network, as an alternative network storage solution to address insufficient storage problem in mobile devices. This paper employs RAID5 distributed storage servers concept into iATA, in which the idea behind is to combine several machines with relatively inexpensive disk drives into a server array that works as a single virtual storage device, thus increasing the reliability and speed of operations. In the case of one machine failed, the server array will not destroy immediately but able to function in a degradation mode. Meanwhile, information can be easily recovered by using boolean exclusive OR (XOR) logical function with the bit information on the remaining machines. We perform I/O measurement and benchmark tool result indicates that additional fault tolerance feature does not delay read/write operations with reasonable file size ranged in 4KB-2MB, yet higher data integrity objective is achieved.

Design of a Large-scale Task Dispatching & Processing System based on Hadoop (하둡 기반 대규모 작업 배치 및 처리 기술 설계)

  • Kim, Jik-Soo;Cao, Nguyen;Kim, Seoyoung;Hwang, Soonwook
    • Journal of KIISE
    • /
    • v.43 no.6
    • /
    • pp.613-620
    • /
    • 2016
  • This paper presents a MOHA(Many-Task Computing on Hadoop) framework which aims to effectively apply the Many-Task Computing(MTC) technologies originally developed for high-performance processing of many tasks, to the existing Big Data processing platform Hadoop. We present basic concepts, motivation, preliminary results of PoC based on distributed message queue, and future research directions of MOHA. MTC applications may have relatively low I/O requirements per task. However, a very large number of tasks should be efficiently processed with potentially heavy inter-communications based on files. Therefore, MTC applications can show another pattern of data-intensive workloads compared to existing Hadoop applications, typically based on relatively large data block sizes. Through an effective convergence of MTC and Big Data technologies, we can introduce a new MOHA framework which can support the large-scale scientific applications along with the Hadoop ecosystem, which is evolving into a multi-application platform.