• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.51-57
• /
• 2013

Storage device based on Flash Memory have many attractive features such as high performance, low power consumption, shock resistance, and low weight, so they replace HDDs to a certain extent. An Storage device based on Flash Memory has FTL(Flash Translation Layer) which emulate block storage devices like HDDs. A garbage collection, one of major functions of FTL, effects highly on the performance and the lifetime of devices. However, there is no de facto standard for new garbage collection algorithms. To solve this problem, we propose File Clustering Algorithm. File Clustering Algorithm respect to update page from same file at the same time. So, these are clustered to same block. For this mechanism, We propose Page Allocation Policy in FTL and use MIN-MAX GAP to guarantee wear leveling. To verify the algorithm in this paper, we use TPC Benchmark. So, The performance evaluation reveals that the proposed algorithm has comparable result with the existing algorithms(No wear leveling, Hot/Cold) and shows approximately 690% improvement in terms of the wear leveling.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.2
• /
• pp.125-134
• /
• 2016

NAND flash memory has unique characteristics like as 'out-place-update' and limited lifetime compared with traditional storage systems. According to out-of-place update scheme, a number of invalid (or called dead) pages can be generated. In this case, garbage collection is needed to reclaim invalid pages. Because garbage collection results in not only erase operations but also copy operations of valid (or called live) pages to other blocks, many garbage collection techniques have proposed to reduce the overhead and to increase the lifetime of NAND Flash systems. This techniques sometimes select victim blocks including cold data for the wear leveling. However, most of them overlook the cost of selecting victim blocks including cold data. In this paper, we propose a garbage collection technique named CAPi (Cost Age with Proportion of invalid pages). Considering the additional overhead of what to select victim blocks including cold data, CAPi improves the response time in garbage collection and increase the lifetime in memory systems. Additionally, the proposed scheme also improves the efficiency of garbage collection by separating cold data from hot data in valid pages. In experimental evaluation, we showed that CAPi yields up to, at maximum, 73% improvement in lifetime compared with existing garbage collections.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.15-20
• /
• 2016

Write amplification is a critical factor that limits the stable performance of flash-based storage systems. To reduce write amplification, this paper presents a new technique that cooperatively manages data in flash storage and nonvolatile memory (NVM). Our scheme basically considers NVM as the cache of flash storage, but allows the original data in flash storage to be invalidated if there is a cached copy in NVM, which can temporarily serve as the original data. This scheme eliminates the copy-out operation for a substantial number of cached data, thereby enhancing garbage collection efficiency. Experimental results show that the proposed scheme reduces the copy-out overhead of garbage collection by 51.4% and decreases the standard deviation of response time by 35.4% on average.

• 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.

• Journal of the Korean Society for Library and Information Science
• /
• v.55 no.1
• /
• pp.285-303
• /
• 2021

Efforts to establish a joint preservation facility for library collection are being discussed by some of regional representative libraries recently. In order for the efficient management and preservation of public library materials and to secure the space necessary for applying new services, there is a high demand for a cooperative shared storage for public libraries. The construction of a cooperative shared storage for public libraries is to minimize the cost of expanding the preservation space for each public library and to provide a pleasant service environment by separating the low-use materials stored in the library. Accordingly, discussions on the construction of a cooperative shared storage for public libraries are being initiated by some representative libraries. This study, in this regard, tried to propose a plan to build a cooperative shared storage for public libraries by a Seoul Metropolitan Library. To this end, it surveyed the estimate size of the collections of public libraries in Seoul and, based on this, proposed the size and strategies for the facility.

• ETRI Journal
• /
• v.43 no.5
• /
• pp.835-855
• /
• 2021

With the recent increase in data disclosure, the Comprehensive Knowledge Archive Network (CKAN), which is an open-source data distribution platform, is drawing much attention. CKAN is used together with additional extensions, such as Datastore and Datapusher for data management and Harvest and DCAT for data collection. This study derives the problems of CKAN itself and Harvest Extension. First, CKAN causes two problems of data inconsistency and storage space waste for data deletion. Second, Harvest Extension causes three additional problems, namely source deletion that deletes only sources without deleting data themselves, job stop that cannot delete job during data collection, and service interruption that cannot provide service, even if data exist. Based on these observations, we propose herein an improved CKAN that provides a new deletion function solving data inconsistency and storage space waste problems. In addition, we present an improved Harvest Extension solving three problems of the legacy Harvest Extension. We verify the correctness and the usefulness of the improved CKAN and Harvest Extension functions through actual implementation and extensive experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.6
• /
• pp.1-11
• /
• 2015

Recently, NAND flash memories are used for storage devices because of fast access speed and low-power. However, applications of FTL on low power computing devices lead to heavy workloads which result in a memory requirement and an implementation overhead. Consequently, studies of B+-Tree on embedded devices without the FTL have been proposed. The studies of B+-Tree are optimized for performance of inserting and updating records, considering to disadvantages of the NAND flash memory that it can not support in-place update. However, if a general garbage collection method is applied to the previous studies of B+-Tree, a performance of the B+-Tree is reduced, because it generates a rearrangement of the B+-Tree by changing of page positions on the NAND flash memory. Therefor, we propose a novel garbage collection method which can apply to the B+-Tree based on the NAND flash memory without the FTL. The proposed garbage collection method does not generate a rearrangement of the B+-Tree by using a block information table and a proxy block. We implemented the B+-Tree and ${\mu}$-Tree with the proposed garbage collection on physical devices with the NAND flash memory. In experiment results, the proposed garbage collection scheme compared to greedy algorithm garbage collection scheme increased the number of inserted keys by up to about 73% on B+-Tree and decreased elapsed time of garbage collection by up to about 39% on ${\mu}$-Tree.

• Korea Trade Review
• /
• v.46 no.4
• /
• pp.149-166
• /
• 2021

This paper aims to reduce the frequency of dangerous goods storage accidents in China. Advocating the managers of warehousing and logistics enterprises to pay attention to the operation process of dangerous goods warehousing business. Improving the safe storage and management capabilities of dangerous goods warehouses. This article first collects official data on dangerous goods storage accidents in China and conducts a general statistical analysis of the accidents. Based on the results of accident statistics and related literature research on dangerous goods storage management, establish a dangerous goods storage safety management factor system, use the analytic hierarchy process, establish a factor importance questionnaire and implement data collection. Through statistics, this paper finds that the storage accidents of dangerous goods in China in the past ten years mainly occurred in the inbound phase of dangerous goods and the storage phase of dangerous goods warehouses. Through the results of the analytic hierarchy process, it is found that the professionalism of the dangerous goods storage practitioners, the compliance of the practitioners with safety regulations, and the awareness of operational safety are the most important.

• Journal of Conservation Science
• /
• v.36 no.1
• /
• pp.28-36
• /
• 2020

The storage environment of a Japanese woodblock print collection was assessed for organic acids. The active air sampling method was used to collect organic acid emissions in the low microgram range from areas of a selected woodblock print with different pigments, following which an off-gassing mitigation strategy based on the fan filter unit(FFU) system was investigated. Research findings revealed that the off-gassing behavior of woodblock prints is significantly impacted by storage practices and to a lesser degree by the pigments. The FFU system can be used as a mitigation strategy, but the permanence of the results depends on the storage conditions.

• Transactions of the Korean hydrogen and new energy society
• /
• v.26 no.4
• /
• pp.331-338
• /
• 2015

Solar air heaters (SAHs) are simple in design and widely used for solar energy collection devices, and a packed bed is one of typical solar energy storage systems of thermal energy captured by SAHs. This paper presents mathematical modeling and simulation on the thermal performance of various packed bed energy storage systems. A MATLAB program is used to estimate the thermal efficiency of packed bed SAH. Among the various packed bed energy storage systems considered, the wire mesh screen packed bed SAH shows the best thermal efficiency over the entire range of design conditions. The maximum of thermal efficiency of packed bed SAH with wire mesh screen matrices has been found to be 0.794 for Re=2000 - 20000 and ${\Delta}T/I=0.002-0.02$.