• Title/Summary/Keyword: Kernel Memory

Search Result 179, Processing Time 0.031 seconds

In-Memory File System Backed by Cloud Storage Services as Permanent Storages (클라우드 스토리지를 최종 저장 장치로 사용하는 인메모리 파일 시스템)

  • Lee, Kyungjun;Kim, Jiwon;Ryu, Sungtae;Han, Hwansoo
    • Journal of KIISE
    • /
    • v.43 no.8
    • /
    • pp.841-847
    • /
    • 2016
  • As network technology advances, a larger number of devices are connected through the Internet. Recently, cloud storage services are gaining popularity, as they are convenient to access anytime and anywhere. Among cloud storage services, object storage is the representative one due to their characteristics of low cost, high availability, and high durability. One limitation of object storage services is that they can access data on the cloud only through the HTTP-based RESTful APIs. In our work, we resolve this limitation with the in-memory file system which provides a POSIX interface to the file system users and communicates with cloud object storages with RESTful APIs. In particular, our flush mechanism is compatible with existing file systems, as it is based on the swap mechanism of the Linux kernel. Our in-memory file system backed by cloud storage reduces the performance overheads and shows a better performance than S3QL by 57% in write operations. It also shows a comparable performance to tmpfs in read operations.

An Improved Index Structure for the Flash Memory Based F2FS File System

  • Kim, Yong-Seok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.12
    • /
    • pp.1-8
    • /
    • 2022
  • As an efficient file system for SSD(Solid State Drive), F2FS is employed in the kernel of Linux operating system. F2FS applies various methods to improve performance by reflecting the characteristics of flash memory. One of them is improvement of the index structure that contains addresses of data blocks for each file. This paper presents a method for further improving performance by modifying the index structure of F2FS. F2FS manages all index blocks as logical numbers, and an address mapping table is used to find the physical block addresses of index blocks on flash memory. This paper shows performance improvement by applying logical numbers to the last level index blocks only. The count of mapping table search for a data block access is reduced to 1~2 from 1~4.

Criteria in ′Landscape and Memory′ as Sense of Place for the Sustainable Development of Korean Mountainous Landscape

  • Jino Kwon;Shin, Joon-Hwan;Park, Myoung-Sub
    • The Korean Journal of Quaternary Research
    • /
    • v.17 no.2
    • /
    • pp.85-99
    • /
    • 2003
  • Since the experience of major landscape change during last half of the century due to war and rapid urbanization, the traditional character has been weakened, and it is necessary for a reconsideration to improve the landscape for the future. To review these relationships, the importance of a comprehensive understanding of nature has been suggested. Therefore identification of a new concept based on the 'socio-cultural influence of landscape' and 'sense of place' which are related to peoples' previous experience, is required. Furthermore more practical definitions and criteria to reveal the relationship are necessary. Among the terms suggested to describe sense of place such as 'home', 'place identity', 'place-based meaning' and 'settlement identity' etc., the 'home' is selected to represent our surrounding landscape. For more practical classification of home landscape, additional terms are suggested and defined based on both the relationships between human beings and nature, and between memory derived from previous experience and shared values with in the community. The additional terms which are the most important in the role of landscape character related to humans' are; ⅰ) Personal Landscape: Landscape of an individual human, which derives from previous personal experience; involves distinguishable character for a given person, and it is emotional and flexible depending on circumstances. ⅱ) Ordinary Landscape: Landscape of the 'common interest' between members of a community, which is acceptable as a surrounding for everyday daily life, it produces the richness and variety of landscape. ⅲ) Kernel Landscape: Landscape of the 'common ground' which is acceptable to the majority members of the community, and it provides variety and stability for periods of time, and it could strongly represent community attitudes toward nature. ⅳ) Prototype Landscape: Landscape as the 'common denominator' of overall community from past to present and towards the future, which encompasses all the kernel landscape throughout history. It provides a sense of place, balances the homogeneity of character throughout overall communities. Some part of this can be shared throughout history to shape an overall sense of place. It can also represent short terms fashions. For a prototype landscape to reveal sense of place, there are a couple of points which we should underline the commencing point. Firstly, understanding the relationship between humans and nature should be based on a given character of surroundings. Secondly, reoccurring landscape elements which have sustained in history can lead to sense of place, and should be reviewed the influences between nature and humans.

  • PDF

FPGA Implementation of Real-time 2-D Wavelet Image Compressor (실시간 2차원 웨이블릿 영상압축기의 FPGA 구현)

  • 서영호;김왕현;김종현;김동욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.7A
    • /
    • pp.683-694
    • /
    • 2002
  • In this paper, a digital image compression codec using 2D DWT(Discrete Wavelet Transform) is designed using the FPGA technology for real time operation The implemented image compression codec using wavelet decomposition consists of a wavelet kernel part for wavelet filtering process, a quantizer/huffman coder for quantization and huffman encoding of wavelet coefficients, a memory controller for interface with external memories, a input interface to process image pixels from A/D converter, a output interface for reconstructing huffman codes, which has irregular bit size, into 32-bit data having regular size data, a memory-kernel buffer to arrage data for real time process, a PCI interface part, and some modules for setting timing between each modules. Since the memory mapping method which converts read process of column-direction into read process of the row-direction is used, the read process in the vertical-direction wavelet decomposition is very efficiently processed. Global operation of wavelet codec is synchronized with the field signal of A/D converter. The global hardware process pipeline operation as the unit of field and each field and each field operation is classified as decomposition levels of wavelet transform. The implemented hardware used FPGA hardware resource of 11119(45%) LAB and 28352(9%) ESB in FPGA device of APEX20KC EP20k600CB652-7 and mapped into one FPGA without additional external logic. Also it can process 33 frames(66 fields) per second, so real-time image compression is possible.

A 95% accurate EEG-connectome Processor for a Mental Health Monitoring System

  • Kim, Hyunki;Song, Kiseok;Roh, Taehwan;Yoo, Hoi-Jun
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.16 no.4
    • /
    • pp.436-442
    • /
    • 2016
  • An electroencephalogram (EEG)-connectome processor to monitor and diagnose mental health is proposed. From 19-channel EEG signals, the proposed processor determines whether the mental state is healthy or unhealthy by extracting significant features from EEG signals and classifying them. Connectome approach is adopted for the best diagnosis accuracy, and synchronization likelihood (SL) is chosen as the connectome feature. Before computing SL, reconstruction optimizer (ReOpt) block compensates some parameters, resulting in improved accuracy. During SL calculation, a sparse matrix inscription (SMI) scheme is proposed to reduce the memory size to 1/24. From the calculated SL information, a small world feature extractor (SWFE) reduces the memory size to 1/29. Finally, using SLs or small word features, radial basis function (RBF) kernel-based support vector machine (SVM) diagnoses user's mental health condition. For RBF kernels, look-up-tables (LUTs) are used to replace the floating-point operations, decreasing the required operation by 54%. Consequently, The EEG-connectome processor improves the diagnosis accuracy from 89% to 95% in Alzheimer's disease case. The proposed processor occupies $3.8mm^2$ and consumes 1.71 mW with $0.18{\mu}m$ CMOS technology.

A Prefetching and Memory Management Policy for Personal Solid State Drives (개인용 SSD를 위한 선반입 및 메모리 관리 정책)

  • Baek, Sung-Hoon
    • The KIPS Transactions:PartA
    • /
    • v.19A no.1
    • /
    • pp.35-44
    • /
    • 2012
  • Traditional technologies that are used to improve the performance of hard disk drives show many negative cases if they are applied to solid state drives (SSD). Access time and block sequence in hard disk drives that consist of mechanical components are very important performance factors. Meanwhile, SSD provides superior random read performance that is not affected by block address sequence due to the characteristics of flash memory. Practically, it is recommended to disable prefetching if a SSD is installed in a personal computer. However, this paper presents a combinational method of a prefetching scheme and a memory management that consider the internal structure of SSD and the characteristics of NAND flash memory. It is important that SSD must concurrently operate multiple flash memory chips. The I/O unit size of NAND flash memory tends to increase and it exceeded the block size of operating systems. Hence, the proposed prefetching scheme performs in an operating unit of SSD. To complement a weak point of the prefetching scheme, the proposed memory management scheme adaptively evicts uselessly prefetched data to maximize the sum of cache hit rate and prefetch hit rate. We implemented the proposed schemes as a Linux kernel module and evaluated them using a commercial SSD. The schemes improved the I/O performance up to 26% in a given experiment.

Development of Embedded X-System (임베디드 X-시스템 개발)

  • Jeong, Gab-Joong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.641-644
    • /
    • 2008
  • This paper describes the GUI implementation of an intelligent embedded system which can be used for a personal information platform and an industrial mobile application system. It shows the architecture and the necessary structure and components of X Window graphic system. The embedded system used in this paper has low power and high performance processor, and has a large memory size with a nand-flash memory device. We configured the linux kernel with a TIT-LCD and touch screen device for the operation of X Window system. And we used GTK+2 for running application softwares on the platform embedded system. The GUI library of GTK+2 is useful for providing the same graphics programming environment with host Linux PC. We have developed in this paper the X Window system and the GUI environment for GTK+2 in a new embedded system, and verified the full operation of X Window system and application softwares using GTK+2. The embedded system with large memory size can be used in X Window application softwares for providing a personal information service with a mobile embedded system.

  • PDF

A Study on GPU Computing of Bi-conjugate Gradient Method for Finite Element Analysis of the Incompressible Navier-Stokes Equations (유한요소 비압축성 유동장 해석을 위한 이중공액구배법의 GPU 기반 연산에 대한 연구)

  • Yoon, Jong Seon;Jeon, Byoung Jin;Jung, Hye Dong;Choi, Hyoung Gwon
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.40 no.9
    • /
    • pp.597-604
    • /
    • 2016
  • A parallel algorithm of bi-conjugate gradient method was developed based on CUDA for parallel computation of the incompressible Navier-Stokes equations. The governing equations were discretized using splitting P2P1 finite element method. Asymmetric stenotic flow problem was solved to validate the proposed algorithm, and then the parallel performance of the GPU was examined by measuring the elapsed times. Further, the GPU performance for sparse matrix-vector multiplication was also investigated with a matrix of fluid-structure interaction problem. A kernel was generated to simultaneously compute the inner product of each row of sparse matrix and a vector. In addition, the kernel was optimized to improve the performance by using both parallel reduction and memory coalescing. In the kernel construction, the effect of warp on the parallel performance of the present CUDA was also examined. The present GPU computation was more than 7 times faster than the single CPU by double precision.

Design and Implementation of an In-Memory File System Cache with Selective Compression (대용량 파일시스템을 위한 선택적 압축을 지원하는 인-메모리 캐시의 설계와 구현)

  • Choe, Hyeongwon;Seo, Euiseong
    • Journal of KIISE
    • /
    • v.44 no.7
    • /
    • pp.658-667
    • /
    • 2017
  • The demand for large-scale storage systems has continued to grow due to the emergence of multimedia, social-network, and big-data services. In order to improve the response time and reduce the load of such large-scale storage systems, DRAM-based in-memory cache systems are becoming popular. However, the high cost of DRAM severely restricts their capacity. While the method of compressing cache entries has been proposed to deal with the capacity limitation issue, compression and decompression, which are technically difficult to parallelize, induce significant processing overhead and in turn retard the response time. A selective compression scheme is proposed in this paper for in-memory file system caches that rapidly estimates the compression ratio of incoming cache entries with their Shannon entropies and compresses cache entries with low compression ratio. In addition, a description is provided of the design and implementation of an in-kernel in-memory file system cache with the proposed selective compression scheme. The evaluation showed that the proposed scheme reduced the execution time of benchmarks by approximately 18% in comparison to the conventional non-compressing in-memory cache scheme. It also provided a cache hit ratio similar to the all-compressing counterpart and reduced 7.5% of the execution time by reducing the compression overhead. In addition, it was shown that the selective compression scheme can reduce the CPU time used for compression by 28% compared to the case of the all-compressing scheme.

Power Management for Mobile Terminal (모바일 단말에서의 전원관리 기술)

  • Lee, Junghee;Park, Hojun;Kim, Jaemyoung
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.2 no.3
    • /
    • pp.194-201
    • /
    • 2007
  • As the performance of the mobile terminal becomes higher, the power consumption gradually increases. As a result, power management is one of the most important issues in mobile system with battery. In this paper, we describe an DPM(Dynamic Power Management) using DVS(Dynamic Power Management) as a power management mechanism in Qplus operating system. DVS generally considers a specific device such as CPU, whereas we consider the relations with other hardware components as well as each component. We specially focus on the relation between CPU, memory and LCD devices. We also designs a kernel monitor to collect information to decide the policy for power management. According to the experimental results, the proposed method enables to save much power.

  • PDF