• Title/Summary/Keyword: Storage Speed

Search Result 842, Processing Time 0.029 seconds

A Novel Redundant Data Storage Algorithm Based on Minimum Spanning Tree and Quasi-randomized Matrix

  • Wang, Jun;Yi, Qiong;Chen, Yunfei;Wang, Yue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.227-247
    • /
    • 2018
  • For intermittently connected wireless sensor networks deployed in hash environments, sensor nodes may fail due to internal or external reasons at any time. In the process of data collection and recovery, we need to speed up as much as possible so that all the sensory data can be restored by accessing as few survivors as possible. In this paper a novel redundant data storage algorithm based on minimum spanning tree and quasi-randomized matrix-QRNCDS is proposed. QRNCDS disseminates k source data packets to n sensor nodes in the network (n>k) according to the minimum spanning tree traversal mechanism. Every node stores only one encoded data packet in its storage which is the XOR result of the received source data packets in accordance with the quasi-randomized matrix theory. The algorithm adopts the minimum spanning tree traversal rule to reduce the complexity of the traversal message of the source packets. In order to solve the problem that some source packets cannot be restored if the random matrix is not full column rank, the semi-randomized network coding method is used in QRNCDS. Each source node only needs to store its own source data packet, and the storage nodes choose to receive or not. In the decoding phase, Gaussian Elimination and Belief Propagation are combined to improve the probability and efficiency of data decoding. As a result, part of the source data can be recovered in the case of semi-random matrix without full column rank. The simulation results show that QRNCDS has lower energy consumption, higher data collection efficiency, higher decoding efficiency, smaller data storage redundancy and larger network fault tolerance.

Design and Construction of 10 kWh Class Flywheel Energy Storage System (10 kWh급 플라이휠 에너지 저장 시스템 설계 및 제작)

  • Jung, S.Y.;Han, S.C.;Han, Y.H.;Park, B.J.;Bae, Y.C.;Lee, W.R.
    • Progress in Superconductivity
    • /
    • v.13 no.1
    • /
    • pp.40-46
    • /
    • 2011
  • A superconductor flywheel energy storage system (SFES) is an electro-mechanical battery which transforms electrical energy into mechanical energy for storage, and vice versa. A 10 kWh class flywheel energy storage system (FESS) has been developed to evaluate the feasibility of a 35 kWh class SFES with a flywheel $I_p/I_t$ ratio larger than 1. The 10 kWh class FESS is composed of a main frame, a composite flywheel, active magnetic dampers (AMDs), a permanent magnet bearing, and a motor/generator. The flywheel of the FESS rotates at a very high speed to store energy, while being levitated by a permanent magnetic bearing and a pair of thrust AMDs. The 10 kWh class flywheel is mainly composed of a composite rotor assembly, where most of the energy is stored, two radial and two thrust AMD rotors, which dissipate vibration at critical speeds, a permanent magnet rotor, which supports most of the flywheel weight, a motor rotor, which spins the flywheel, and a central hollow shaft, where the parts are assembled and aligned to. The stators of each of the main components are assembled on to housings, which are assembled and aligned to the main frame. Many factors have been considered while designing each part of the flywheel, stator and frame. In this study, a 10 kWh class flywheel energy storage system has been designed and constructed for test operation.

Design and Implementation of iATA-based RAID5 Distributed Storage Servers (iATA 기반의 RAID5 분산 스토리지 서버의 설계 및 구현)

  • Ong, Ivy;Lim, Hyo-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.2
    • /
    • pp.305-311
    • /
    • 2010
  • iATA (Internet Advanced Technology Attachment) is a block-level protocol developed to transfer ATA commands over TCP/IP network, as an alternative network storage solution to address insufficient storage problem in mobile devices. This paper employs RAID5 distributed storage servers concept into iATA, in which the idea behind is to combine several machines with relatively inexpensive disk drives into a server array that works as a single virtual storage device, thus increasing the reliability and speed of operations. In the case of one machine failed, the server array will not destroy immediately but able to function in a degradation mode. Meanwhile, information can be easily recovered by using boolean exclusive OR (XOR) logical function with the bit information on the remaining machines. We perform I/O measurement and benchmark tool result indicates that additional fault tolerance feature does not delay read/write operations with reasonable file size ranged in 4KB-2MB, yet higher data integrity objective is achieved.

A Memory Mapping Technique to Reduce Data Retrieval Cost in the Storage Consisting of Multi Memories (다중 메모리로 구성된 저장장치에서 데이터 탐색 비용을 줄이기 위한 메모리 매핑 기법)

  • Hyun-Seob Lee
    • Journal of Internet of Things and Convergence
    • /
    • v.9 no.1
    • /
    • pp.19-24
    • /
    • 2023
  • Recently, with the recent rapid development of memory technology, various types of memory are developed and are used to improve processing speed in data management systems. In particular, NAND flash memory is used as a main media for storing data in memory-based storage devices because it has a nonvolatile characteristic that it can maintain data even at the power off state. However, since the recently studied memory-based storage device consists of various types of memory such as MRAM and PRAM as well as NAND flash memory, research on memory management technology is needed to improve data processing performance and efficiency of media in a storage system composed of different types of memories. In this paper, we propose a memory mapping scheme thought technique for efficiently managing data in the storage device composed of various memories for data management. The proposed idea is a method of managing different memories using a single mapping table. This method can unify the address scheme of data and reduce the search cost of data stored in different memories for data tiering.

A Design of Temperature Management System for Preventing High Temperature Failures on Mobility Dedicated Storage (모빌리티 전용 저장장치의 고온 고장 방지를 위한 온도 관리 시스템 설계)

  • Hyun-Seob Lee
    • Journal of Internet of Things and Convergence
    • /
    • v.10 no.2
    • /
    • pp.125-130
    • /
    • 2024
  • With the rapid growth of mobility technology, the industrial sector is demanding storage devices that can reliably process data from various equipment and sensors in vehicles. NAND flash memory is being utilized as a storage device in mobility environments because it has the advantages of low power and fast data processing speed as well as strong external shock resistance. However, flash memory is characterized by data corruption due to long-term exposure to high temperatures. Therefore, a dedicated system for temperature management is required in mobility environments where high temperature exposure due to weather or external heat sources such as solar radiation is frequent. This paper designs a dedicated temperature management system for managing storage device temperature in a mobility environment. The designed temperature management system is a hybrid of traditional air cooling and water cooling technologies. The cooling method is designed to operate adaptively according to the temperature of the storage device, and it is designed not to operate when the temperature step is low to improve energy efficiency. Finally, experiments were conducted to analyze the temperature difference between each cooling method and different heat dissipation materials, proving that the temperature management policy is effective in maintaining performance.

Development of a Flywheel Energy Storage System using Superconducting Magnetic Bearing (초전도 플라이휠 에너지 저장시스템 개발)

  • 정환명;연제욱;최재호;고창섭
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.4 no.5
    • /
    • pp.433-441
    • /
    • 1999
  • This paper presents a S-FES(Superconducting magnetic becuing Flywheel Energy Storage System) for the p purpose of replacing battery used to store the energy. Especially, the design elements of FES, such as the b beming, wheel mateηaI, and power converter, etc., are described. The design and manufacturing techniques of t the controllable IXlwer converter are proposed to generate the sinusoidal output current in the high speed operation and to get the const빠synchronous motor with halbach cuTay of high coesive I\d-Fe-B permanent magnet is used as the driver of F FES. The proposed S-FES system shows the stable rotation characteristics at high speed range about l 10,000[rpm]. To verify the validity of proposed system, the comparative study with the conventional ball b beming s~rstem is proceeded and it is well confirmed with the result of the lower friction losses of S-FES S system.

  • PDF

Program Execution Speed Improvement using Executable Compression Method on Embedded Systems (임베디드 시스템에서 실행 가능 압축 기법을 이용한 프로그램 초기 실행 속도 향상)

  • Jeon, Chang-Kyu;Lew, Kyeung-Seek;Kim, Yong-Deak
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.49 no.1
    • /
    • pp.23-28
    • /
    • 2012
  • The performance improvement of the secondary storage is very slow compared to the main memory and processor. The data is loaded from secondary storage to memory for the execution of an application. At this time, there is a bottleneck. In this paper, we propose an Executable Compression Method to speed up the initial loading time of application. and we examined the performance. So we implemented the two applications. The one is a compressor for Execution Binary File. and The other is a decoder of Executable Compressed application file on the Embedded System. Using the test binary files, we performed the speed test in the six files. At the result, one result showed that the performance was decreased. but others had a increased performance. the average increasing rate was almost 29% at the initial loading time. The level of compression had different characteristics of the file. And the performance level was dependent on the file compressed size and uncompress time. so the optimized compression algorithm will be needed to apply the execution binary file.

Enhancing LRU Buffer Replacement Policy with Delayed Write of Not-cold-dirty-pages for Flash Memory (플래시 메모리를 위한 Not-cold-Page 쓰기지연을 통한 LRU 버퍼교체 정책 개선)

  • Jung Ho-Young;Park Sung-Min;Cha Jae-Hyuk;Kang Soo-Yong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.9
    • /
    • pp.634-641
    • /
    • 2006
  • Flash memory has many advantages like non-volatility and fast I/O speed, but it has also disadvantages such as not-in-place-update data and asymmetric read/write/erase speed. For the performance of flash memory storage, it is essential for the buffer replacement algorithms to reduce the number of write operations that also affects the number of erase operations. A new buffer replacement algorithm is proposed in this paper, that delays the writes of not-cold-dirty pages in the buffer cache of flash storage. We show that this algorithm effectively decreases the number of write operations and erase operations without much degradation of hit ratio. As a result overall performance of flash I/O speed is improved.

A Study on High Speed Playback of AR Contents based on Beacon RSSI Signals (무선 RSSI 신호 기반의 AR 콘텐츠 초고속 재생에 관한 연구)

  • Kim, Goo;Kim, Jin-Woo;Ha, Yeon-Chul
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.21 no.2
    • /
    • pp.67-72
    • /
    • 2020
  • AR service using the client-server method and existing physical markers(eg, OR Codes, etc.) causes a delay in the playback time of the contents because the contents download is executed after the marker recognition. In the case of the one-time installation method rather than the client-server method, proactive download of high-capacity contents for playback may cause an inefficiency of the storage space of the device(eg, smartphone, etc.). Therefore, in AR contents playback based on beacon's RSSI to secure the efficiency of the playback device storage space and to quickly play AR contents. The technique for high-speed playback in this study can be applied to various fields such as MICE exhibition using beacon signal.

Real time Storage Manager to store very large datausing block transaction (블록 단위 트랜잭션을 이용한 대용량 데이터의 실시간 저장관리기)

  • Baek, Sung-Ha;Lee, Dong-Wook;Eo, Sang-Hun;Chung, Warn-Ill;Kim, Gyoung-Bae;Oh, Young-Hwan;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.2
    • /
    • pp.1-12
    • /
    • 2008
  • Automatic semiconductor manufacture system generating transaction from 50,000 to 500,000 per a second needs storage management system processing very large data at once. A lot of storage management systems are researched for storing very large data. Existing storage management system is typical DBMS on a disk. It is difficult that the DBMS on a disk processes the 500,000 number of insert transaction per a second. So, the DBMS on main memory appeared to use memory. But it is difficultthat very large data stores into the DBMS on a memory because of limited amount of memory. In this paper we propose storage management system using insert transaction of a block unit that can process insert transaction over 50,000 and store data on low storage cost. A transaction of a block unit can decrease cost for a log and index per each tuple as transforming a transaction of a tuple unit to a block unit. Besides, the proposed system come cost to decompress all block of data because the information of each field be loss. To solve the problems, the proposed system generates the index of each compressed block to prevent reducing speed for searching. The proposed system can store very large data generated in semiconductor system and reduce storage cost.

  • PDF