• Title/Summary/Keyword: real-time storage

Search Result 623, Processing Time 0.03 seconds

Design and Implementation of a Hybrid Equipment Data Acquisition System(HEDAS) for Equipment Engineering System(EES) Framework (EES 프레임워크를 위한 하이브리드 생산설비 데이터 습득 시스템(HEDAS)의 설계 및 구현)

  • Kim, Gyoung-Bae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.2
    • /
    • pp.167-176
    • /
    • 2012
  • In this paper we design and implement a new Hybrid Equipment Data Acquisition System (HEDAS) for data collection of semiconductor and optoelectronic manufacturing equipments in the equipment engineering system(EES) framework. The amount of the data collected from equipments have increased rapidly in equipment engineering system. The proposed HEDAS efficiently handles a large amount of real-time equipment data generated from EES framework. It also can support the real-time ESS applications as well as non real-time ESS applications. For the real-time EES applications, it performs high-speed real-time processing that uses continuous query and filtering techniques based on memory buffers. The HEDAS can optionally store non real-time equipment data using a HEDAS-based database or a traditional DBMS-based database. In particular, The proposed HEDAS offers the compression indexing based on the timestamp of data and query processing technique saving the cost of disks storage against extremely increasing equipment data. The HEDAS is efficient system to collect huge real-time and non real-time equipment data and transmit the collected equipment data to several EES applications in EES framework.

AIOPro: A Fully-Integrated Storage I/O Profiler for Android Smartphones (AIOPro: 안드로이드 스마트폰을 위한 통합된 스토리지 I/O 분석도구)

  • Hahn, Sangwook Shane;Yee, Inhyuk;Ryu, Donguk;Kim, Jihong
    • Journal of KIISE
    • /
    • v.44 no.3
    • /
    • pp.232-238
    • /
    • 2017
  • Application response time is critical to end-user response time in Android smartphones. Due to the plentiful resources of recent smartphones, storage I/O response time becomes a major key factor in application response time. However, existing storage I/O trace tools for Android and Linux give limited information only for a specific I/O layer which makes it difficult to combine I/O information from different I/O layers, because not helpful for application developer and researchers. In this paper, we propose a novel storage I/O trace tool for Android, called AIOPro (Android I/O profiler). It traces storage I/O from application - Android platform - system call - virtual file system - native file system - page cache - block layer - SCSI layer and device driver. It then combines the storage I/O information from I/O layers by linking them with file information and physical address. Our evaluations of real smartphone usage scenarios and benchmarks show that AIOPro can track storage I/O information from all I/O layers without any data loss under 0.1% system overheads.

RSPM : Storage Reliability Scheme for Network Video Recorder System (RSPM : NVR 시스템 기반의 저장장치 신뢰성 향상 기법)

  • Lee, Geun-Hyung;Song, Jae-Seok;Kim, Deok-Hwan
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.2
    • /
    • pp.29-38
    • /
    • 2010
  • Network Video Recorder becomes popular as a next generation surveillance system connecting all cameras and video server in network environment because it can provide ease of installation and efficient management and maintenance. But in case of data damage, the storage device in traditional NVR has no recovery scheme and it is disabled in processing real-time requests. In this paper, we propose an Reliable Storage using Parity and Mirroring scheme for improving reliability on storage device and maintaining system on realtime. RSPM uses a Liberation coding to recover damaged multimedia data and dynamic mirroring to repair corrupted system data and to maintain real-time operation. RSPM using the Liberation code is 11.29% lesser than traditional file system and 5.21% less than RSPM using parity code in terms of loss rate of damaged multimedia data.

The Mapping Method by Equation for Adding Disks for Striping System (스트라이핑 시스템에서 디스크 추가를 위한 계산에 의한 매핑 방법)

  • 박유현;김창수;강동재;김영호;신범주
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.1
    • /
    • pp.15-27
    • /
    • 2003
  • Recently, the volume of data is increasing rapidly in server for multimedia service, according to development of multimedia application environment. In recent research for storage technology the technology like of the SAN(Storage Area Network) advantages in scalibility of storage devices, and can read data from multiple disk arrays through RAID 0, 5. The RAID 0 and 5 translate to logical address to physical address using equation, but in case of adding disks at the system with equation -based mapping, the problem that we must rearrange the whole data in the previous disks happens. We use the mapping table to solve this problem in recent, but we can not load the whole mapping table in main memory because it occupies too large space. Therefore the extra I/Os are demanded to evaluate real physical address of data, so total performance of the system is degraded. In this paper, we propose the mapping method that supports the scalibility in RAID 0 or 5 system. The proposing method applies small metadata, so- called SZIT and simple equation, so it is possible that we make translate logical address to physical address rapidly and it is scalable in disk extending simultaneously Our suggesting method, if we add disks to the striping system for expanding of storage capacity, has an advantage of never stop service. So, SZlT-based mapping method can do online-disk-expanding in real-time service.

  • PDF

Designing Test Methods for IT-Enabled Energy Storage System to Evaluate Energy Dynamics

  • Kim, Young Gon;Kim, Dong Hoon;Lee, Eun-Kyu
    • Journal of Information Processing Systems
    • /
    • v.13 no.6
    • /
    • pp.1487-1495
    • /
    • 2017
  • With increasing interests in renewables, more consumers are installing an energy storage system (ESS) in their backyards, and thus, the ESS will play a critical role in the emerging smart grid. Due to mechanical properties, however its operational dynamics must be well understood before connecting the ESS to the smart grid (and eventually to an IT system). To this end, we investigate charging and discharging processes in detail. This paper, then, proposes methods for four type tests (state of charge test, conversion efficiency test, response time test, and ramp rate test) that can assess the dynamics of the ESS. The proposed methods can capture accurate delay values of mechanical processes in the ESS, and it is expected for those values to help design real-time communication systems in the smart grid involving the ESS.

A Study of an Android Application implementation for Real-Time Streaming Service (안드로이드를 기반으로 한 실시간 스트리밍에 대한 연구)

  • Lee, Sangho;Choi, Yuseong;Park, Jongbin;Kim, Myungho;Kim, Youngjong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2019.05a
    • /
    • pp.316-319
    • /
    • 2019
  • In this paper, the streaming architecture is designed by analyzing the existing real-time streaming platform, and the real-time communication and media storage are handled by accommodating multiple users. Furthermore, the Android mobile app allows users to test their behavior and provide services for deployment.

FLASH : A Main Memory Storage System

  • Kim, Pyung-Chul;Jung, Byung-Gwan;Kim, Moon-Ja
    • The Journal of Information Technology and Database
    • /
    • v.1 no.2
    • /
    • pp.103-125
    • /
    • 1994
  • In this paper, we introduce a new main memory storage system called FLASH that is designed for real-time applications. The FLASH system is characterized by the memory residency of data and a new fast and dynamic hashing scheme called extendible chained bucket hashing. We compared the performance of the new hashing algorithm with other well-known ones. Also, we carried out an experiment to compare the overall performance of the FLASH system with a commercial one. Both comparison results show that the new hashing scheme and the FLASH system outperforms other competitives.

  • PDF

Moving Object Detection Using Sparse Approximation and Sparse Coding Migration

  • Li, Shufang;Hu, Zhengping;Zhao, Mengyao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.5
    • /
    • pp.2141-2155
    • /
    • 2020
  • In order to meet the requirements of background change, illumination variation, moving shadow interference and high accuracy in object detection of moving camera, and strive for real-time and high efficiency, this paper presents an object detection algorithm based on sparse approximation recursion and sparse coding migration in subspace. First, low-rank sparse decomposition is used to reduce the dimension of the data. Combining with dictionary sparse representation, the computational model is established by the recursive formula of sparse approximation with the video sequences taken as subspace sets. And the moving object is calculated by the background difference method, which effectively reduces the computational complexity and running time. According to the idea of sparse coding migration, the above operations are carried out in the down-sampling space to further reduce the requirements of computational complexity and memory storage, and this will be adapt to multi-scale target objects and overcome the impact of large anomaly areas. Finally, experiments are carried out on VDAO datasets containing 59 sets of videos. The experimental results show that the algorithm can detect moving object effectively in the moving camera with uniform speed, not only in terms of low computational complexity but also in terms of low storage requirements, so that our proposed algorithm is suitable for detection systems with high real-time requirements.

A Study on the Introduction of Fuzzy Theory to the Adjustment of Time Variant parameter

  • Lee, Jong-Kyu;Lee, Chang-Hae
    • Korean Journal of Hydrosciences
    • /
    • v.8
    • /
    • pp.69-83
    • /
    • 1997
  • The Parameters of the storage function model (SFM) are taken as constants, while they have different values during every rainfall period and the duration of the runoff. Therefore, the results of the SFM generally show remarkably large errors. In this study, the modified storage function model (MSFM), in which the time variant parameters are introduced, is proposed to improve the SFM which is a conceptual rainfall-runoff model. The fuzzy reasoning method is applied as a real-time control one of the time variant parameters of the proposed model. The applicability of the MSFM was examined in the Bochung river, at a tributary of the Geum River, Korea. The pattern of the predicted runoff hydrograph and the peak discharge by the MSFM with fuzzy control are very similar to the measured values, compared with the results produced by the SFM.

  • PDF

Integrated Decision-making for Sequencing and Storage Location of Export Containers at a Receiving Operation in the Container Terminal with a Perpendicular Layout (수직 배치형 컨테이너 터미널 반입작업에서 수출 컨테이너의 작업순서와 장치위치 통합 의사결정)

  • Bae, Jong-Wook;Park, Young-Man
    • Journal of Navigation and Port Research
    • /
    • v.35 no.8
    • /
    • pp.657-665
    • /
    • 2011
  • This study deals with an integrated problem for deciding sequencing and storage location of export containers together at its receiving operation in the container terminal with a perpendicular layout. The preferred storage location of an export container varies with the priority of the corresponding loading operation and the waiting time of an external truck depends on its storage time. This paper proposes the mixed integer programming model considering the expected arrival time and expected finish time of an external truck and the preferred storage location for its loading operation. And we suggest the heuristic algorithm based on a simulated annealing algorithm for real world adaption. We compare the heuristic algorithm with the optimum model in terms of the computation times and total cost and the performance of the heuristic algorithm is analyzed through a numerical experiment.