• Title/Summary/Keyword: file I/O

Search Result 165, Processing Time 0.019 seconds

Mounting Time Reduction and Clean Policy using Content-Based Block Management for NAND Flash File System (NAND 플래시 파일 시스템을 위한 내용기반 블록관리기법을 이용한 마운트 시간 감소와 지움 정책)

  • Cho, Wan-Hee;Lee, Dong-Hwan;Kim, Deok-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.3
    • /
    • pp.41-50
    • /
    • 2009
  • The flash memory has many advantages such as low power consumption, strong shock resistance, fast I/O and non-volatility. And it is increasingly used in the mobile storage device. Many researchers are studying the YAFFS, NAND flash file system, which is widely used in the embedded device. However, the existing YAFFS has two problems. First, it takes long time to mount the YAFFS file system because it scans whole spare areas in all pages. Second, the cleaning policy of the YAFFS does not consider the wear-leveling so that it cannot guarantee the duration of data completely. In order to solve these problems, this paper proposes a new content-based YAFFS that consists of a mounting time reduction technique and a content-cleaning policy by using content-based block management. The proposed method only scans partial spare areas of some special pages and provides the block swapping which enables the wear-leveling of data blocks. We performed experiments to compare the performance of the proposed method with those of the JFFS2 system and YAFFS system. Experimental results show that the proposed method reduces the average mounting time by 82.2% comparing with JFFS2 and 42.9% comparing with YAFFS. Besides, it increases the life time of the flash memory by 35% comparing with the existing YAFFS whereas no overheat is added.

Video Retrieval System supporting Adaptive Streaming Service (적응형 스트리밍 서비스를 지원하는 비디오 검색 시스템)

  • 이윤채;전형수;장옥배
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.1
    • /
    • pp.1-12
    • /
    • 2003
  • Recently, many researches into distributed processing on Internet, and multimedia data processing have been performed. Rapid and convenient multimedia services supplied with high quality and high speed are to be needed. In this paper, we design and implement clip-based video retrieval system on the Web enviroment in real-time. Our system consists of the content-based indexing system supporting convenient services for video content providers, and the Web-based retrieval system in order to make it easy and various information retrieval for users in the Web. Three important methods are used in the content-based indexing system, key frame extracting method by dividing video data, clip file creation method by clustering related information, and video database construction method by using clip unit. In Web-based retrieval system, retrieval method ny using a key word, two dimension browsing method of key frame, and real-time display method of the clip are used. In this paper, we design and implement the system that supports real-time display method of the clip are used. In this paper, we design and implement the system that supports real-time retrieval for video clips on Web environment and provides the multimedia service in stability. The proposed methods show a usefulness of video content providing, and provide an easy method for serching intented video content.

The Development of PLD Design Tool using the EDIF Netlist (EDIF Netlist를 이용한 PLD 설계용 툴 개발)

  • Kim, Hi-Seok;Byun, Sang-Zoon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.4
    • /
    • pp.1025-1032
    • /
    • 1998
  • In this paper, the PLD design tool which realizes a digital circuit as PLD, by using EDIF netlist of the digital circuit designed at OrCAD have been developed. This paper is proposed the following algorithms: JIE(Joined Information Extractor) which extracts the connecting information between both cells in order to realize the digital circuit as PLD using the EDIF netlist, FND(Feedback Node Detector) which look into whether feedback exists or not, BEG(Boolean Equation Generator) which generates a boolean equation, and so on. Also, this paper is developed auto-select function which selects the PLD element with consideration of number of I/O variables of the minimized boolean equation, and algorithm generation JEDEC file of GAL6001 and GAL6002, having a forms of EPLD which is bigger than PLD.

  • PDF

Benchmarking of BioPerl, Perl, BioJava, Java, BioPython, and Python for Primitive Bioinformatics Tasks and Choosing a Suitable Language

  • Ryu, Tae-Wan
    • International Journal of Contents
    • /
    • v.5 no.2
    • /
    • pp.6-15
    • /
    • 2009
  • Recently many different programming languages have emerged for the development of bioinformatics applications. In addition to the traditional languages, languages from open source projects such as BioPerl, BioPython, and BioJava have become popular because they provide special tools for biological data processing and are easy to use. However, it is not well-studied which of these programming languages will be most suitable for a given bioinformatics task and which factors should be considered in choosing a language for a project. Like many other application projects, bioinformatics projects also require various types of tasks. Accordingly, it will be a challenge to characterize all the aspects of a project in order to choose a language. However, most projects require some common and primitive tasks such as file I/O, text processing, and basic computation for counting, translation, statistics, etc. This paper presents the benchmarking results of six popular languages, Perl, BioPerl, Python, BioPython, Java, and BioJava, for several common and simple bioinformatics tasks. The experimental results of each language are compared through quantitative evaluation metrics such as execution time, memory usage, and size of the source code. Other qualitative factors, including writeability, readability, portability, scalability, and maintainability, that affect the success of a project are also discussed. The results of this research can be useful for developers in choosing an appropriate language for the development of bioinformatics applications.

A Study on the Design and Requirements of the Object-oriented Database Systems (객체지향 데이터베이스 시스템의 필요요건과 설계에 관한연구)

  • Yu, Yang-Geun;Ryu, Hae-Yeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.2
    • /
    • pp.325-337
    • /
    • 1997
  • This paper introduces the basic concepts and requirements of database system based on the object-oriented paradigm,and presents the overview of the design of an object-oriented data base system which refects those conceprs and requirements . The system imolemented on C++,consists of three structure layers.The inner layer, which is in fact a storage system,performs file I/O,while the inermediate layer is responisible for most of the functions except the ones rerated to the user interface, such as the transaction management,the schema manage-ment,and the management of buffers in main memory etc.The outer layer,designed mainly for the uwerunteface,mot only privides the functions for graphical user interface,preprocessor,and interpreter etc,but also supports extended SQL for object-oriented features.

  • PDF

Development of an Agricultural Data Middleware to Integrate Multiple Sensor Networks for an Farm Environment Monitoring System

  • Kim, Joonyong;Lee, Chungu;Kwon, Tae-Hyung;Park, Geonhwan;Rhee, Joong-Yong
    • Journal of Biosystems Engineering
    • /
    • v.38 no.1
    • /
    • pp.25-32
    • /
    • 2013
  • Purpose: The objective of this study is to develop a data middleware for u-IT convergence in agricultural environment monitoring, which can support non-standard data interfaces and solve the compatibility problems of heterogenous sensor networks. Methods: Six factors with three different interfaces were chosen as target data among the environmental monitoring factors for crop cultivation. PostgresSQL and PostGIS were used for database and the data middleware was implemented by Python programming language. Based on hierarchical model design and key-value type table design, the data middleware was developed. For evaluation, 2,000 records of each data access interface were prepared. Results: Their execution times of File I/O interface, SQL interface and HTTP interface were 0.00951 s/record, 0.01967 s/record and 0.0401 s/record respectively. And there was no data loss. Conclusions: The data middleware integrated three heterogenous sensor networks with different data access interfaces.

AN EXPERIMENTAL STUDY ON THE EFFECT OF THE CANAL INRRIGANTS AND THE METHOD OF CANAL FILLING ON THE QUALITY OF CANAL OBTURATION (근관세척제(根管洗滌劑) 및 근관충전방법(根管充塡方法)에 의(依)한 근관폐쇄효과(根管閉鎖效果)에 관(關)한 실험적(實驗的) 연구(硏究))

  • Oh, Boeng-Won;Min, Byung-Soon;Choi, Ho-Young;Park, Sang-Jin
    • Restorative Dentistry and Endodontics
    • /
    • v.9 no.1
    • /
    • pp.59-68
    • /
    • 1983
  • The purpose of this study was to examine the influence of canal irrigants and the method of canal filling on the quality of canal obturation. Sixty extracted human teeth with single root were selected and divided into three different groups; In group I (control); 5 cc normal saline irrigated after each instrumentation In group II; 2.5 cc-3% NaOCl in combination with 2.5 cc-3% $H_2O_2$ In group III; RC-Prep in combination with 5 cc-3% NaOCl All specimens were cleaned, shaped(#50 file size), irrigated and obturated by lateral condensation and automated thermatic condensation filling method of gutta-percha and AH-26. After all the specimens were immersed in 2% methylene blue dye solution in $37^{\circ}C$ for 7 days and the degree of dye penetration into the canals observed by magnifying glass(${\times}$20) and reflected light microscope The results were as follows: 1. All the the teeth showed some degree of the dye penetration. 2. There were no significant difference among three groups in the degree of the dye penetration in each canal filling method. 3. There were no significant difference of the dye penetration between each canal filling method in group I. 4. There were no statistically significant difference of the dye penetration between each canal filling method in group II and group III, but lateral condensation group was showed slightly more than automated thermatic condensation group.

  • PDF

Analysis of Disk Array Architecture as a Storage Server of a Small-Sacle VOD Server (소규모 VOD 시스템의 저장 서버로서 디스크 배열 구조의 분석)

  • Go, Jeong-Guk;Kim, Gil-Yong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.3
    • /
    • pp.811-820
    • /
    • 1997
  • Disk arrays are using to enhance data trandfer rate and I/O performance in multimedia applications which need a high-performance storage device with large storage capacity and high-speed network.As performance varies with configuration and data layout scheme,disk array characteristic variables must be approrpriately deter-mined in desibning disk array archetecture for a speciffic applicatoin. In this paper,in order to design a disk array architecturte as a storage server of a small-scale VOD system,we evaluate performance of a disk array to chose the number of disks in the array,disk array cinfiguration,a degree of declustering for a given data block size of continous media file system and I/D request size through simulation.Simulation result shows that RAID level 5 with 5 disks ios a suitable candidate for the disk array architecture which privides MPEG-2 files with a rate of 6 Mbps,Moreover,we whow that stripe unit is 64 KB and a layout scheme is contigous placement.

  • PDF

SSD-based RAID-6 System Architecture for Reliability and Performance Enhancement (신뢰성 향상과 성능개선을 위해 다양한 Erasure 코드를 적용한 SSD 기반 RAID-6 시스템 구조)

  • Song, Jae-Seok;Huh, Joon-Moo;Yang, Yu-Seok;Kim, Deok-Hwan
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.6
    • /
    • pp.47-56
    • /
    • 2010
  • HDD-based RAIDs have been used in high-capacity storage systems for traditional data server. However, their data reliability are relatively low and they consume lots of power since hard disk drive is weak on shock and its power consumption is high due to frequent spindle motor operation. Therefore, this paper presents new SSD based RAID system architecture using various erasure codes. The proposed methode applys Reed-Solomon, EVENODD, and Liberation coding schemes onto file system level and device driver level, respectively. Besides, it uses data allocation method to minimize the side effect of reducing the lifespan of SSD. Detail experimental results show that Liberation code increase wear-leveling rates of SSD based RAID-6 more than other codes. The SSD based RAID system applying erasure codes at the device driver level shows better performance than that at the file system level. I/O performance of RAID-6 system using SSD is 4.5%~8.5% higher than that of using HDD and the power consumption of the RAID system using SSD is 18%~40% less than that of using HDD.

Parallel Processing of k-Means Clustering Algorithm for Unsupervised Classification of Large Satellite Images: A Hybrid Method Using Multicores and a PC-Cluster (대용량 위성영상의 무감독 분류를 위한 k-Means Clustering 알고리즘의 병렬처리: 다중코어와 PC-Cluster를 이용한 Hybrid 방식)

  • Han, Soohee;Song, Jeong Heon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.37 no.6
    • /
    • pp.445-452
    • /
    • 2019
  • In this study, parallel processing codes of k-means clustering algorithm were developed and implemented in a PC-cluster for unsupervised classification of large satellite images. We implemented intra-node code using multicores of CPU (Central Processing Unit) based on OpenMP (Open Multi-Processing), inter-nodes code using a PC-cluster based on message passing interface, and hybrid code using both. The PC-cluster consists of one master node and eight slave nodes, and each node is equipped with eight multicores. Two operating systems, Microsoft Windows and Canonical Ubuntu, were installed in the PC-cluster in turn and tested to compare parallel processing performance. Two multispectral satellite images were tested, which are a medium-capacity LANDSAT 8 OLI (Operational Land Imager) image and a high-capacity Sentinel 2A image. To evaluate the performance of parallel processing, speedup and efficiency were measured. Overall, the speedup was over N / 2 and the efficiency was over 0.5. From the comparison of the two operating systems, the Ubuntu system showed two to three times faster performance. To confirm that the results of the sequential and parallel processing coincide with the other, the center value of each band and the number of classified pixels were compared, and result images were examined by pixel to pixel comparison. It was found that care should be taken to avoid false sharing of OpenMP in intra-node implementation. To process large satellite images in a PC-cluster, code and hardware should be designed to reduce performance degradation caused by file I / O. Also, it was found that performance can differ depending on the operating system installed in a PC-cluster.