• Title/Summary/Keyword: Write Performance

Search Result 391, Processing Time 0.028 seconds

A Design of 256GB volume DRAM-based SSD(Solid State Drive) (256GB 용량 DRAM기반 SSD의 설계)

  • Ko, Dea-Sik;Jeong, Seung-Kook
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.4
    • /
    • pp.509-514
    • /
    • 2009
  • In this paper, we designed and analyzed 256GB DRAM-based SSD storage using DDR1 memory and PCI-e interface. SSD is a storage system that uses DRAM or NAND Flash as primary storage media. Since the SSD read and write data directly to memory chips, which results in storage speeds far greater than conventional magnetic storage devices, HDD. Architecture of the proposed SSD system has performance of high speed data processing duo to use multiple RAM disks as primary storage and PCI-e interface bus as communication path of RAM disks. We constructed experimental system with UNIX, Windows/Linux server, SAN Switch, and Ethernet Switch and measured IOPS and bandwidth of proposed SSD using IOmeter. In experimental results, it has been shown that IOPS, 470,000 and bandwidth,800MB/sec of the DDR-1 SSD is better than those of the HDD and Flash-based SSD.

  • PDF

Dynamic Monitoring Framework and Debugging System for Embedded Virtualization System (가상화 환경에서 임베디드 시스템을 위한 모니터링 프레임워크와 디버깅 시스템)

  • Han, Inkyu;Lim, Sungsoo
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.12
    • /
    • pp.792-797
    • /
    • 2015
  • Effective profiling diagnoses the failure of the system and informs risk. If a failure in the target system occurs, it is impossible to diagnose more than one of the exiting tools. In this respect, monitoring of the system based on virtualization is useful. We present in this paper a monitoring framework that uses the characteristics of hardware virtualization to prevent side-effects from a target guest, and uses dynamic binary instrumentation with instruction-level trapping based on hardware virtualization to achieve efficiency and flexibility. We also present examples of some applications that use this framework. The framework provides tracing of guest kernel function, memory dump, and debugging that uses GDB stub with GDB remote protocol. The experimental evaluation of our prototype shows that the monitoring framework incurs at most 2% write memory performance overhead for end users.

Implementation of Efficient and Reliable Flash File System (효율적이고 신뢰성 있는 플래시 파일시스템의 구현)

  • Jin, Jong-Won;Lee, Tae-Hoon;Lee, Seung-Hwan;Chung, Ki-Dong
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.5
    • /
    • pp.651-660
    • /
    • 2008
  • Flash memory is widely used in embedded systems because of its benefits such as non-volatile, shock resistant, and low power consumption. However, NAND flash memory suffers from out-place-update, limited erase cycles, and page based read/write operations. To solve these problems, YAFFS and RFFS, the flash memory file systems, are proposed. However YAFFS takes long time to mount the file system, because all the files are scattered all around flash memory. Thus YAFFS needs to fully scan the flash memory. To provide fast mounting, RFFS has been proposed. It stores all the block information, the addresses of block information and meta data to use them at mounting time. However additional operations for the meta data management are decreasing the performance of the system. This paper presents a new NAND flash file system called ERFFS (Efficient and Reliable Flash File System) which provides fast mounting and recovery with minimum mata data management. Based on the experimental results, ERFFS reduces the flash mount/recovery time and the file system overhead.

  • PDF

A Parallel Implementation of JPEG2000 4K Ultra High Definition Image using OpenCL (OpenCL을 이용한 JPEG2000 4K 초고화질 영상처리의 병렬고속화 구현)

  • Park, Daeseung;Kim, Cheong Ghil
    • Journal of Satellite, Information and Communications
    • /
    • v.10 no.1
    • /
    • pp.1-5
    • /
    • 2015
  • With the help of fast growing multimedia technology and high preference for users of large screens, the newest video coding standard, HEVC (High Efficiency Video Coding) high-quality video compression), has been introduced. Therefore, the high definition image services which are four times more clear than conventional HD video, are getting popular. JPEG 2000 also has stated to support 4K and 8K UHD. As a result, it requires fast processing technology to read and write UHD images. This paper introduces a study on fast parallel processing technology for UHD images. For this purpose, first, JPEG 2000 is reviewed and a GPU based parallel implementation is proposed for a preprocessing of color conversion stage. The parallelled algorithm is implemented with OpenCL (Open Computing Language). The simulation results show that the proposed method shows 5 times performance improvements on processing speed for 4K UHD over the method using threads.

RFFS : Design of a Reliable NAND Flash File System for Embedded system (임베디드 시스템을 위한 신뢰성 있는 NAND 플래시 파일 시스템의 설계)

  • Lee Tae-hoon;Park Song-hwa;Kim Tae-hoon;Lee Sang-gi;Lee Joo-Kyong;Chung Ki-Dong
    • The KIPS Transactions:PartA
    • /
    • v.12A no.7 s.97
    • /
    • pp.571-582
    • /
    • 2005
  • NAND flash memory has advantages of non-volatility, little power consumption and fast access time. However, it suffers from inability that dose not provide to update-in-place and the erase cycle is limited. Moreover, the unit of read and write operations is a page. A NAND flash file system called YAFFS has been proposed. But YAFFS has several problems to be addressed. In this paper, the Reliable Flash File System(RFFS) for NAND flash memory is designed and evaluated. In designing a file system the following four issues must be considered in particular for the design: (i) to minimize a repairing time when the system fault occurs, (ii) to balance the number of block erase operations by offering wear leveling policy, and (iii) to reduce turnaround time of memory operations by reducing the amount of data written. We demonstrate and evaluate the performance of the proposed schemes.

A Study on Generation of Parallel Task in High Performance Language (고성능 언어에서의 병렬 태스크 생성에 관한 연구)

  • Park, Sung-Soon;Koo, Mi-Soon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.6
    • /
    • pp.1636-1651
    • /
    • 1997
  • In task parallel language like Fortran M, programmer writes a task parallel program using parallel constructs which is provided. When some data dependencies exist between called procedures in various applications, it is difficult for programmer to write program according to their dependencies. Therefore, it is desirous that compiler can detect some implicit parallelisms and transform a program to parallelized form by using the task parallel constructs like PROCESSES block or PROCESSDO loop of Fortran M. But current task parallel language compilers can't provide these works. In this paper, we analyze the cases according to dependence relations and detect the implicit parallelism which can be transformed to task parallel constructs like PROCESSES block and PROCESSDO loop of Fortran M. Also, For the case which program can be paralleized both PROCESSES block and PROCESSDO loop, we analyze that which construct is more effective for various conditions.

  • PDF

I/O Scheduler Scheme for User Responsiveness in Mobile Systems (모바일 시스템에서 사용자 반응성을 고려한 입출력 스케줄링 기법)

  • Park, Jong Woo;Yoon, Jun Young;Seo, Dae-Wha
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.11
    • /
    • pp.379-384
    • /
    • 2016
  • NAND flash storage is widely used for computer systems, because of it has faster response time, lower power consumption, and larger capacity per unit area than hard disk. However, currently used I/O scheduler in the operating system is optimized for characteristics of the hard disk. Therefore, the conventional I/O scheduler includes the unnecessary overhead in the case of the NAND flash storage to be applied. Particularly, when the write requests performed intensively, garbage collection is performed intensively. So, it occurs the problem that the processing of the I/O request delay. In this paper, we propose the new I/O scheduler to solve the problem of garbage collection performs intensively, and to optimize for NAND flash storage. In the result of performance evaluation, proposed scheme shows an improvement the user responsiveness by reducing 1% of the average read response time and 78% of the maximum response time.

A Method of Selecting Layered File System Based on Learning Block I/O History for Service-Customized Container (서비스 맞춤형 컨테이너를 위한 블록 입출력 히스토리 학습 기반 컨테이너 레이어 파일 시스템 선정 기법)

  • Yong, Chanho;Na, Sang-Ho;Lee, Pill-Woo;Huh, Eui-Nam
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.10
    • /
    • pp.415-420
    • /
    • 2017
  • Virtualization technique of OS-level is a new paradigm for deploying applications, and is attracting attention as a technology to replace traditional virtualization technique, VM (Virtual Machine). Especially, docker containers are capable of distributing application images faster and more efficient than before by applying layered image structures and union mount point to existing linux container. These characteristics of containers can only be used in layered file systems that support snapshot functionality, so it is required to select appropriate layered file systems according to the characteristics of the containerized application. We examine the characteristics of representative layered file systems and conduct write performance evaluations of each layered file systems according to the operating principles of the layered file system, Allocate-on-Demand and Copy-up. We also suggest the method of determining a appropriate layered file system principle for unknown containerized application by learning block I/O usage history of each layered file system principles in artificial neural network. Finally we validate effectiveness of artificial neural network created from block I/O history of each layered file system principles.

A Study on the Development School Agenda 21 to Activate Environmental Education (학교 환경교육을 활성화시키기 위한 학교의제 21 개발 연구)

  • Park, Ha-Na;Nam, Young-Sook
    • Hwankyungkyoyuk
    • /
    • v.18 no.2 s.27
    • /
    • pp.23-30
    • /
    • 2005
  • The purpose of this study is to develop School Agenda 21 to activate environmental education at schools. In detail, this study is intended to develop operating procedures, major issue areas or domains, and instructions on the preparation for School Agenda 21. School Agenda 21 means the action plan which students, teachers, parents, and other concerned parties (including office of education, local municipal bodies, and NGOs) write under agreement with respect to their respective roles in order to activate environmental educations oriented toward sustainable development. The results of this study are as follow. First, the operating procedures for School Agenda 21 consist of seven steps; organization, diagnosis of problems, setup of targets or objectives, development of codes of behavior, system establishment, practices and reviews, and evaluation and feedbacks. Second, major issue areas for School Agenda 21 are classified into six; school management, class operation, independent subject activity, separate subject activity, non-subject activity, and external relations of school. Third, instructions of the preparation of School Agenda 21 address these 10 concepts; balance, unification, continuity, daily routine, linkage, environmental justice, participation, peculiarity of schools and classes, regional peculiarity, and concreteness, which consider 7 principles for environmental education, levels of learners, regional features, and concreteness. School Agenda 21 developed from this study converts existing environmental education toward sustainable development environmental education, and developed for the purpose to activate school environmental education, but ultimate purpose of this study are realizing sustainable society, sustainable future to realize education for sustainable development. So School Agenda 21 is expected to important performance way making possible Local Agenda 21, National Agenda 21, Agenda 21 as if education, public recognition and discipline contents of the 36 chapter of Agenda 21.

  • PDF

CL-Tree: B+ tree for NAND Flash Memory using Cache Index List (CL 트리: 낸드 플래시 시스템에서 캐시 색인 리스트를 활용하는 B+ 트리)

  • Hwang, Sang-Ho;Kwak, Jong Wook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.4
    • /
    • pp.1-10
    • /
    • 2015
  • NAND flash systems require deletion operation and do not support in-place update, so the storage systems should use Flash Translation Layer (FTL). However, there are a lot of memory consumptions using mapping table in the FTL, so recently, many studies have been proposed to resolve mapping table overhead. These studies try to solve update propagation problem in the nand flash system which does not use mapping table. In this paper, we present a novel index structure, called CL-Tree(Cache List Tree), to solve the update propagation problem. The proposed index structure reduces write operations which occur for an update propagation, and it has a good performance for search operation because it uses multi-list structure. In experimental evaluation, we show that our scheme yields about 173% and 179% improvement in insertion speed and search speed, respectively, compared to traditional B+tree and other works.