• Title/Summary/Keyword: Layered File System

Search Result 14, Processing Time 0.024 seconds

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.

Effective Routing Schemes for Double-Layered Peer-to-Peer Systems in MANET

  • Kim, Ji-Hoon;Lee, Kwang-Jo;Kim, Taek-Hun;Yang, Sung-Bong
    • Journal of Computing Science and Engineering
    • /
    • v.5 no.1
    • /
    • pp.19-31
    • /
    • 2011
  • In this paper, we propose two new routing schemes for double-layered peer-to-peer systems; a shorter-lower mobility routing scheme and a reverse path routing scheme. The shorter-lower mobility routing scheme first chooses shortest routing paths among possible routing paths and selects the path associated with the relay peer who has lower mobility to improve the reliability of the system. The reverse path routing scheme carries out unicasting (instead of multicasting) based on the reverse path information that can be obtained during the initial file search to further reduce network traffic. The experimental results showed that a double-layered peer-topeer system with the proposed hybrid scheme improved the reliability of the system about 1.5% over the hop count scheme and reduced network traffic by about 0.5% compared to the hop count scheme.

Double-layered Peer-to-Peer Systems in MobileAd-hoc Networks (모바일애드혹 네트워크에서의 2계층 피어-투-피어 시스템)

  • Kim, Ji-Hoon;Yang, Sung-Bong
    • The KIPS Transactions:PartC
    • /
    • v.17C no.1
    • /
    • pp.61-68
    • /
    • 2010
  • As the mobile technology advances, file searching among the mobile device users becomes more important. In this paper, we propose the uniform grid, greedy, and MIS P2P systems that have double-layered topology to search files efficiently for mobile ad-hoc networks. In these systems, peers are classified into two groups, super-peers and sub-peers, and each super-peer manages its neighboring sub-peers. In the proposed systems, each super-peer maintains the appropriate information of its sub-peers so that when a peer requests a file, the request is sent to its super-peers and then to neighboring super-peers. Hence the proposed systems could avoid multi-broadcasting and reduce network overheads. The experimental results show that the proposed systems outperform a single-layered P2P system in terms of the average number of messages to find target files. Especially the MISsystem improves by reducing the average number of messages by 48.9% while maintaining the same search accuracy.

Structural Characteristics Analysis System "SpindleX" for Machine-Tool Spindle System (공작기계 주축계의 구조특성 해석시스템 SpindleX)

  • 김석일;조재완;이원재
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2000.05a
    • /
    • pp.1016-1020
    • /
    • 2000
  • In this study, a structural characteristics analysis system for motor-integrated high-speed spindle systems, “SpindleX”, is developed based on the Timoshenko theory and the multi-layered finite element method. Since “SpindleX” has the various analysis modules related to static deflection analysis, modal analysis, frequency response analysis, unbalance response analysis and so on, it is useful in performing systematically and quantitatively the design and evaluation processes of spindle system under the windows GUI environment. Also, to enhance the user-friendliness, “SpindleX” possesses the various additional functions such as the DXF file interface for auto-importing the shape and geometric data of spindle system from the DXF file, the bearing database for auto-importing the mechanical properties and geometric data of bearing by the bearing number, and the graphical visualization for certificating the imported and analysed data of spindle system.

  • PDF

File System for Performance Improvement in Multiple Flash Memory Chips (다중 플래시 메모리 기반 파일시스템의 성능개선을 위한 파일시스템)

  • Park, Je-Ho
    • Journal of the Semiconductor & Display Technology
    • /
    • v.7 no.3
    • /
    • pp.17-21
    • /
    • 2008
  • Application of flash memory in mobile and ubiquitous related devices is rapidly being increased due to its low price and high performance. In addition, some notebook computers currently come out into market with a SSD(Solid State Disk) instead of hard-drive based storage system. Regarding this trend, applications need to increase the storage capacity using multiple flash memory chips for larger capacity sooner or later. Flash memory based storage subsystem should resolve the performance bottleneck for writing in perspective of speed and lifetime according to its physical property. In order to make flash memory storage work with tangible performance, reclaiming of invalid regions needs to be controlled in a particular manner to decrease the number of erasures and to distribute the erasures uniformly over the whole memory space as much as possible. In this paper, we study the performance of flash memory recycling algorithms and demonstrate that the proposed algorithm shows acceptable performance for flash memory storage with multiple chips. The proposed cleaning method partitions the memory space into candidate memory regions, to be reclaimed as free, by utilizing threshold values. The proposed algorithm handles the storage system in multi-layered style. The impact of the proposed policies is evaluated through a number of experiments.

  • PDF

Multimedia Presentation Authoring and Virtual Collaboration in Medicine

  • Hong, Chul-Eui
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.6
    • /
    • pp.690-696
    • /
    • 2010
  • Web-based virtual collaboration is increasingly gaining popularity in almost every area in our society due to the fact that it can bridge the gap imposed by time and geographical constraints. However, in medical field, such collaboration has been less popular than other fields. Some of the reasons were timeliness, security, and preciseness of the information they are dealing with. In this paper, we are proposing a web-based distributed medical collaboration system called Virtual Collaboration System for Medicine (VCSM) for medical doctors that meet the needs. The proposed system consists of two parts - multimedia presentation and recordable virtual collaboration. The former supports synchronized multimedia presentation using Synchronous Multimedia Integration Language (SMIL.) It allows synchronization of the contents of a PowerPoint presentation file and a video file. The presentation may be provided to the participants before the discussion begins. Next, in the virtual collaboration stage, participants can use text along with associated symbols during the discussion over the presented medical images. The symbols such as arrows or polygons can be set or removed dynamically to represent areas of interest in digital images using so called layered architecture that separates image layer from annotation layer. XML files are used to record participants' opinions along with the symbols over some particular images

A Novel Query-by-Singing/Humming Method by Estimating Matching Positions Based on Multi-layered Perceptron

  • Pham, Tuyen Danh;Nam, Gi Pyo;Shin, Kwang Yong;Park, Kang Ryoung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.7
    • /
    • pp.1657-1670
    • /
    • 2013
  • The increase in the number of music files in smart phone and MP3 player makes it difficult to find the music files which people want. So, Query-by-Singing/Humming (QbSH) systems have been developed to retrieve music from a user's humming or singing without having to know detailed information about the title or singer of song. Most previous researches on QbSH have been conducted using musical instrument digital interface (MIDI) files as reference songs. However, the production of MIDI files is a time-consuming process. In addition, more and more music files are newly published with the development of music market. Consequently, the method of using the more common MPEG-1 audio layer 3 (MP3) files for reference songs is considered as an alternative. However, there is little previous research on QbSH with MP3 files because an MP3 file has a different waveform due to background music and multiple (polyphonic) melodies compared to the humming/singing query. To overcome these problems, we propose a new QbSH method using MP3 files on mobile device. This research is novel in four ways. First, this is the first research on QbSH using MP3 files as reference songs. Second, the start and end positions on the MP3 file to be matched are estimated by using multi-layered perceptron (MLP) prior to performing the matching with humming/singing query file. Third, for more accurate results, four MLPs are used, which produce the start and end positions for dynamic time warping (DTW) matching algorithm, and those for chroma-based DTW algorithm, respectively. Fourth, two matching scores by the DTW and chroma-based DTW algorithms are combined by using PRODUCT rule, through which a higher matching accuracy is obtained. Experimental results with AFA MP3 database show that the accuracy (Top 1 accuracy of 98%, with an MRR of 0.989) of the proposed method is much higher than that of other methods. We also showed the effectiveness of the proposed system on consumer mobile device.

Development of CAD/CAM system for dieless CNC forming (Dieless CNC Forming 을 위한 CAD/CAM 시스템 개발)

  • 최동우;진영길;강재관;왕덕현
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2004.10a
    • /
    • pp.405-408
    • /
    • 2004
  • The sheet parts are formed with dies conventionally. But this conventional forming process is not suited to small volume and varied production for the reason of high cost. For the solution of this problem, a new forming process, which is called CNC incremental sheet forming, is being introduced. This process can form sheet parts without die, and is very well suited to small volume and varied production in space flight and automobile. In this paper, dieless CNC forming system based on a machining center is developed. A special device to grasp and pull the blank sheet built in the machining center and tool path generation S/W from STL file of 3-D model are developed. Several sheet parts are incrementally formed to verify the effectiveness of the developed system.

  • PDF

Dieless CNC Forming System based on a Machining Center (머시닝센터 기반의 Dieless CNC Forming 시스템 개발)

  • Choi D. W.;Kang J. K.
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2004.10a
    • /
    • pp.184-187
    • /
    • 2004
  • The sheet parts are formed with dies conventionally. But this conventional forming process is not suited to small volume and varied production for the reason of high cost. For the solution of this problem, a new forming process, which is called CNC incremental sheet forming, is being introduced. This process can form sheet parts without die, and is very well suited to small volume and varied production in space flight and automobile. In this paper, dieless CNC forming system based on a machining center is developed. A special device to grasp and pull the blank sheet built in the machining center and tool path generation S/W from STL file of 3-D model are developed. Several sheet parts are incrementally formed to verify the effectiveness of the developed system.

  • PDF

A Java Virtual Machine for Sensor Networks (센서 네트워크를 위한 자바 가상 기계)

  • Kim, Seong-Woo;Lee, Jong-Min;Lee, Jung-Hwa;Shin, Jin-Ho
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.1
    • /
    • pp.13-20
    • /
    • 2008
  • Sensor network consists of a large number of sensor node distributed in the environment being sensed and controlled. The resource-constrained sensor nodes tend to have various and heterogeneous architecture. Thus, it is important to make its software environment platform-independent and reprogrammable. In this paper, we present BeeVM, a Java operating system designed for sensor networks. BeeVM offers a platform-independent Java programming environment with its efficiently executable file format and a set of class APIs for basic operating functions, sensing and wireless networking. BeeVM's high-level native interface and layered network subsystem allow complex program for sensor network to be short and readable. Our platform has been ported on two currently popular hardware platforms and we show its effectiveness through the evaluation of a simple application.