• Title/Summary/Keyword: 스토리의 시간 구조

Search Result 46, Processing Time 0.027 seconds

Design and Implementation of DEVSim++ and DiskSim Interface for Interoperation of System-level Simulation and Disk I/O-level Simulation (시스템수준 시뮬레이션과 디스크 I/O수준 시뮬레이션 연동을 위한 DEVSim++과 DiskSim 사이의 인터페이스 설계 및 구현)

  • Song, Hae Sang;Lee, Sun Ju
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.4
    • /
    • pp.131-140
    • /
    • 2013
  • This paper deals with the design and implementation of an interface for interoperation between DiskSim, a well-known disk simulator, and a system-level simulator based on DEVSim++. Such inter-operational simulation aims at evaluation of an overall performance of storage systems which consist of multiple computer nodes with a variety of I/O level specifications. A well-known system-level simulation framework, DEVSim++ environment is based on the DEVS formalism, which provides a sound semantics of modular and hierarchical modeling methodology at the discrete event systems level such as multi-node computer systems. For maintainability we assume that there is no change of the source codes for two heterogeneous simulation engines. Thus, we adopt a notion of simulators interoperation in which there should be a means to synchronize simulation times as well as to exchange messages between simulators. As an interface for such interoperation DiskSimManager is designed and implemented. Various experiments, comparing the results of the standalone DiskSim simulation and the interoperation simulation using the proposed interface of DiskSimManager, proved that DiskSimManager works correctly as an interface for interoperation between DEVSim++ and DiskSim.

Properties of Ferroelectric Materials Applicable to Nano-storage Media (탐침형 정보 저장장치에 응용 가능한 강유전체 물질의 특성 연구)

  • Choi J.S.;Kim J.S.;Hwang I.R.;Byun I.S.;Kim S.H.;Jeon S.H.;Lee J.H.;Hong S.H.;Park B.H.
    • Journal of the Korean Vacuum Society
    • /
    • v.15 no.2
    • /
    • pp.173-179
    • /
    • 2006
  • We have investigated structural and electrical properties of $PbZr_{0.3}Ti_{0.7}O_{3}$ (PZT) thin films deposited by pulsed laser deposition methods. PZT thin films have been deposited on $LaMnO_3$ (LMO) bottom electrodes with $LaAlO_3$ (LAO) substrates during different deposition times. High-resolution x-ray diffraction data have shown that all the PZT films and bottom electrodes are highly oriented. The thickness of each film is determined by field-emission scanning electron microscope. We have also observed root mean square roughness by using atomic force microscopy mode, and local polarization distribution and retention behavior of a ferroelectric domain by using piezoelectric force microscopy mode. A PZT/LMO structure has shown good ferroelectric and retention properties as the media for nano-storage devices.

An Address Translation Technique Large NAND Flash Memory using Page Level Mapping (페이지 단위 매핑 기반 대용량 NAND플래시를 위한 주소변환기법)

  • Seo, Hyun-Min;Kwon, Oh-Hoon;Park, Jun-Seok;Koh, Kern
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.3
    • /
    • pp.371-375
    • /
    • 2010
  • SSD is a storage medium based on NAND Flash memory. Because of its short latency, low power consumption, and resistance to shock, it's not only used in PC but also in server computers. Most SSDs use FTL to overcome the erase-before-overwrite characteristic of NAND flash. There are several types of FTL, but page mapped FTL shows better performance than others. But its usefulness is limited because of its large memory footprint for the mapping table. For example, 64MB memory space is required only for the mapping table for a 64GB MLC SSD. In this paper, we propose a novel caching scheme for the mapping table. By using the mapping-table-meta-data we construct a fully associative cache, and translate the address within O(1) time. The simulation results show more than 80 hit ratio with 32KB cache and 90% with 512KB cache. The overall memory footprint was only 1.9% of 64MB. The time overhead of cache miss was measured lower than 2% for most workload.

FastIO: High Speed Launching of Smart TV Apps (FastIO: 스마트 TV 앱의 고속 구동 기법)

  • Lee, Cheolhee;Hwang, Taeho;Won, Youjip;Lee, Seongjin
    • Journal of KIISE
    • /
    • v.43 no.7
    • /
    • pp.725-735
    • /
    • 2016
  • Smart TV uses Webkit as a web browser engine to provide contents such as web surfing, VOD watching, and games. Webkit uses web resources, such as HTML, CSS, JavaScript, and images, in order to run applications. At the start of an application, Webkit loads resources to the memory and creates DOM tree and render tree, which is a time consuming process. However, DOM tree and render tree created by the smart TV application do not change over time because the smart TV application uses web resources stored in a disk. If DOM tree and render tree can be stored and reused, it is possible to reduce loading time of an application. In this paper, we propose FastIO technique that selectively adds persistency to dynamically allocated memory. FastIO reduces overall application loading time by eliminating the process of loading resources from storage, parsing the HTML documents, and creating DOM tree and render tree. Comparison of the application resource loading times indicates that the web browser with FastIO is 7.9x, 44.8x, and 2.9x faster than the legacy web browser in an SSD, Ramdisk, and eMMC environment, respectively.

Implications for Memory Reference Analysis and System Design to Execute AI Workloads in Personal Mobile Environments (개인용 모바일 환경의 AI 워크로드 수행을 위한 메모리 참조 분석 및 시스템 설계 방안)

  • Seokmin Kwon;Hyokyung Bahn
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.1
    • /
    • pp.31-36
    • /
    • 2024
  • Recently, mobile apps that utilize AI technologies are increasing. In the personal mobile environment, performance degradation may occur during the training phase of large AI workload due to limitations in memory capacity. In this paper, we extract memory reference traces of AI workloads and analyze their characteristics. From this analysis, we observe that AI workloads can cause frequent storage access due to weak temporal locality and irregular popularity bias during memory write operations, which can degrade the performance of mobile devices. Based on this observation, we discuss ways to efficiently manage memory write operations of AI workloads using persistent memory-based swap devices. Through simulation experiments, we show that the system architecture proposed in this paper can improve the I/O time of mobile systems by more than 80%.

Improving the Read Performance of OneNAND Flash Memory using Virtual I/O Segment (가상 I/O 세그먼트를 이용한 OneNAND 플래시 메모리의 읽기 성능 향상 기법)

  • Hyun, Seung-Hwan;Koh, Kern
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.7
    • /
    • pp.636-645
    • /
    • 2008
  • OneNAND flash is a high-performance hybrid flash memory that combines the advantages of both NAND flash and NOR flash. OneNAND flash has not only all virtues of NAND flash but also greatly enhanced read performance which is considered as a downside of NAND flash. As a result, it is widely used in mobile applications such as mobile phones, digital cameras, PMP, and portable game players. However, most of the general purpose operating systems, such as Linux, can not exploit the read performance of OneNAND flash because of the restrictions imposed by their virtual memory system and block I/O architecture. In order to solve that problem, we suggest a new approach called virtual I/O segment. By using virtual I/O segment, the superior read performance of OneNAND flash can be exploited without modifying the existing block I/O architecture and MTD subsystem. Experiments by implementations show that this approach can reduce read latency of OneNAND flash as much as 54%.

An Efficient Hybrid Replication Protocol for High Available Distributed System (고 가용성 분산 시스템을 위한 효율적인 하이브리드 복제 프로토콜)

  • Youn Hee Yong;Choi Sung Chune
    • The KIPS Transactions:PartA
    • /
    • v.12A no.2 s.92
    • /
    • pp.171-180
    • /
    • 2005
  • In distributed systems data are replicated and stored at several nodes to increase the availability and overall performance. Here Quorum protocol doffing a certain set of replicas required for read/write operation exists for global concurrency control. One of the representative replication Protocols - the Tree Quorum protocol - has a drawback of rapidly growing number of replicas as the level increases, while the Grid protocol requires the same operation cost even without any failure. In this paper, thus, we propose a new replication protocol called hybrid protocol which capitalizes the merits of the existing protocols and solves the problems of them at the same time. The proposed hybrid protocol has very low operation cost in the absence of failure like the tree quorum protocol, and has relatively lower operation cost and higher availability than existing protocols when failure occurs by employing tree architecture as the overall organization while each level of the tree is organized as a row of a grid architecture. It is thus effective to be applied to survival storage system. We conduct cost and availability analysis of the proposed protocol through mathematical modeling, and response time and throughput are compared with those of the Tree Quorum protocol through computer simulation.

A Design and Implementation for a Reliable Data Storage in a Digital Tachograph (디지털 자동차운행기록계에서 안정적인 데이터 저장을 위한 설계 및 구현)

  • Baek, Sung Hoon;Son, Myunghee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.1 no.2
    • /
    • pp.71-78
    • /
    • 2012
  • The digital tachograph is a device that automatically records speed and distance of a vehicle, together with the driver's activity and vehicle status at an accident. It records vehicle speed, break status, acceleration, engine RPM, longitude and latitude of GPS, accumulated distance, and so on. European Commission regulation made digital tachographs mandatory for all trucks from 2005. Republic of Korea made digital tachographs mandatory for all new business vehicles from 2011 and is widening the range of vehicles that must install digital tachographs year by year. This device is used to analyze driver's daily driving information and car accidents. Under a car accident that makes the device reliability unpredictable, it is very important to store driving information with maximum reliability for its original mission. We designed and implemented a practical digital tachograph. This paper presents a storage scheme that consists of a first storage device with small capacity at a high reliability and a second storage device with large capacity at a low cost in order to reliably records data with a hardware at a low cost. The first storage device records data in a SLC NAND flash memory in a log-structured style. We present a reverse partial scan that overcomes the slow scan time of log-structured storages at the boot stage. The scheme reduced the scan time of the first storage device by 1/50. In addition, our design includes a scheme that fast stores data at a moment of accident by 1/20 of data transfer time of a normal method.

Real-Time Video Indexing and Non-Linear Video Browsing for DTV Receivers (디지털 텔레비전 수신환경에서의 실시간 비디오 인덱싱과 비선형적 비디오 브라우징)

  • 윤경로;전성배
    • Journal of Broadcast Engineering
    • /
    • v.7 no.2
    • /
    • pp.79-87
    • /
    • 2002
  • The fast advances in digital video processing and multimedia processing technology over the last decade enabled various non-linear video browsing techniques. Based on the machine-understanding of the video content, non-linear video brows ing interfaces such as key-frame based content summarization have been introduced. The key-frame based user interfaces, such as storyboard or table of content, however, are still very hard for conventional TV users to use, and are very hard to implement without the service providers providing additional information for the construction of the key-frame based interfaces. In this paper, non-linear video browsing techniques, which not only overcome previously described drawbacks but also are easy-to-use, and real-time video indexing technology to support the proposed browsing techniques are proposed. The structure-based skipping and skimming help users easily find interesting scene and understand the content in a very short time, using real-time video indexing technology.

Hybrid Main Memory based Buffer Cache Scheme by Using Characteristics of Mobile Applications (모바일 애플리케이션의 특성을 이용한 하이브리드 메모리 기반 버퍼 캐시 정책)

  • Oh, Chansoo;Kang, Dong Hyun;Lee, Minho;Eom, Young Ik
    • Journal of KIISE
    • /
    • v.42 no.11
    • /
    • pp.1314-1321
    • /
    • 2015
  • Mobile devices employ buffer cache mechanisms, just as in computer systems such as desktops or servers, to mitigate the performance gap between main memory and secondary storage. However, DRAM has a problem in that it accelerates battery consumption by performing refresh operations periodically to maintain the stored data. In this paper, we propose a novel buffer cache scheme to increase the battery lifecycle in mobile devices based on a hybrid main memory architecture consisting of DRAM and non-volatile PCM. We also suggest a new buffer cache policy that allocates buffers based on process states to optimize the performance and endurance of PCM. In particular, our algorithm allocates each page to the appropriate position corresponding to the state of the application that owns the page, and tries to ensure a rapid response of foreground applications even with a small amount of DRAM memory. The experimental results indicate that the proposed scheme reduces the elapsed time of foreground applications by 58% on average and power consumption by 23% on average without negatively impacting the performance of background applications.