• Title/Summary/Keyword: Storage policy

Search Result 501, Processing Time 0.029 seconds

A Cleaning Policy for Mobile Computers using Flash Memory (플래시메모리를 사용하는 이동컴퓨터에서 클리닝 정책)

  • 민용기;박승규
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.495-498
    • /
    • 1998
  • Mobile computers have restrictions for size, weight, and power consumption that are different from traditional workstations. Storage device must be smaller, lighter. Low power consumed storage devices are needed. At the present time, flash memory device is a reasonable candidate for such device. But flash memory has drawbacks such as bulk erase operation and slow program time. This causes of worse average write performances. This paper suggests a storage method which improves write performance.

  • PDF

Completion Time Algorithm in Multiproduct Batch Processes with Storage Time and Product Allocation Restriction in Intermediate Storage Tank (중간저장조의 저장시간과 저장제품의 제약을 고려한 다품종 회분공정의 조업완료시간 알고리듬)

  • 하진국;이경법;이인범;이의수
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.9
    • /
    • pp.727-735
    • /
    • 2003
  • The determination of completion time constitutes an important step in developing algorithms for short-term production scheduling. Existing completion time algorithms of multi-product batch processes often assume that intermediate storage tanks are always available when it is needed. In this paper, we consider a serial multi-product batch plants with ZW and NIS policy intermediate storge tank. We limit storage residence time and allocated products in the intermediate storage tank to minimize the quality change of the stored material as well as to reduce the clearing time during product change. A set of recurrence relations is suggested to calculate the completion times for the given batch sequence of products on all processing units. Also analytic solution for the suggested model is solved by a graphical method. The effectiveness of these results is proved by a few illustrative examples.

Design of a renewable energy system with battery and power-to-methanol unit

  • Andika, Riezqa;Kim, Young;Yun, Choa Mun;Yoon, Seok Ho;Lee, Moonyong
    • Korean Journal of Chemical Engineering
    • /
    • v.36 no.1
    • /
    • pp.12-20
    • /
    • 2019
  • An energy storage system consisting of a battery and a power-to-methanol (PtM) unit was investigated to develop an energy storage system for renewable energy systems. A nonlinear programming model was established to optimize the energy storage system. The optimal installation capacities of the battery and power-to-methanol units were determined to minimize the cost of the energy system. The cost from a renewable energy system was assessed for four configurations, with or without energy storage units, of the battery and the power-to-methanol unit. The proposed model was applied to the modified electricity supply and demand based on published data. The results show that value-adding units, such as PtM, need be included to build a stable renewable energy system. This work will significantly contribute to the advancement of electricity supply and demand management and to the establishment of a nationwide policy for renewable energy storage.

Evaluating Water Supply Capacity of Embankment Raised Reservoir on Climate Change (기후변화에 따른 둑높임 저수지의 용수공급능력 평가)

  • Lee, Jaenam;Noh, Jaekyoung
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.57 no.4
    • /
    • pp.73-84
    • /
    • 2015
  • An embankment raising project on 113 agricultural reservoirs in Korea was implemented in 2009 to increase water supply capacity for agricultural water and instream uses. This study evaluated the future water supply capacity of the Imgo reservoir at which the agricultural reservoir embankment raising project was completed, considering climate change scenarios. The height of the embankment of the reservoir was increased by 4.5 m, thereby increasing its total storage from 1,657.0 thousand to 3,179.5 thousand cubic meters. To simulate the reservoir water storage with respect to climate changes, two climate change scenarios, namely, RCP 4.5 and RCP 8.5 (in which greenhouse gas reduction policy was executed and not executed, respectively) were applied with bias correction for reflecting the climate characteristics of the target basin. The analysis result of the agricultural water supply capacity in the future, after the agricultural reservoir embankment raising project is implemented, revealed that the water supply reliability and the agricultural water supply increased, regardless of the climate change scenarios. By simulating the reservoir water storage considering the instream flow post completion of the embankment raising project, it was found that water shortage in the reservoir in the future is not likely to occur when it is supplied with an appropriate instream flow. The range of instream flow tends to decrease over time under RCP 8.5, in which the greenhouse gas reduction policy was not executed, and the restoration of reservoir storage was lower in this scenario than in RCP 4.5, in which greenhouse gas reduction policy was executed.

Policy for Selective Flushing of Smartphone Buffer Cache using Persistent Memory (영속 메모리를 이용한 스마트폰 버퍼 캐시의 선별적 플러시 정책)

  • Lim, Soojung;Bahn, Hyokyung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.1
    • /
    • pp.71-76
    • /
    • 2022
  • Buffer cache bridges the performance gap between memory and storage, but its effectiveness is limited due to periodic flush, performed to prevent data loss in smartphones. This paper shows that selective flushing technique with small persistent memory can reduce the flushing overhead of smartphone buffer cache significantly. This is due to our I/O analysis of smartphone applications in that a certain hot data account for most of file writes, while a large proportion of file data incurs single-writes. The proposed selective flushing policy performs flushing to persistent memory for frequently updated data, and storage flushing is performed only for single-write data. This eliminates storage write traffic and also improves the space efficiency of persistent memory. Simulations with popular smartphone application I/O traces show that the proposed policy reduces write traffic to storage by 24.8% on average and up to 37.8%.

A study on the knowledge measurement of dental hygienists about dental waste (치과의료폐기물에 대한 치과위생사의 지식 측정 연구)

  • Sim, Eun-Bi;Noh, Hie-Jin;Mun, So-Jung;Jung, Won-Gyun;Choi, Eun-Sil
    • Journal of Korean society of Dental Hygiene
    • /
    • v.20 no.1
    • /
    • pp.73-83
    • /
    • 2020
  • Objectives: This study aimed to measure the knowledge of dental hygienists regarding dental waste, and identify the relationship between general characteristics and infection control characteristics. Methods: This study was conducted using a self-reported questionnaire in 250 dental hygienists. The questionnaire consisted of 21 items: storage container (5 items), storage locations (5 items), storage period (9 items), and storage method (3 items). The collected data were analyzed using the t-test and analysis of variance. Results: The education experience of infection management within the last year was reviewed for significant differences among dental hygienists regarding storage container and storage periods (p<0.05). Statistically significant differences were observed regarding the knowledge of storage container, storage locations, storage period, and storage method among the enrolled dental hygienists (p<0.05). Conclusions: This study examined the necessity of developing conservative education and job education programs to improve the knowledge level of dental hygienists regarding dental waste management.

A Study of File Replacement Policy in Data Grid Environments (데이터 그리드 환경에서 파일 교체 정책 연구)

  • Park, Hong-Jin
    • The KIPS Transactions:PartA
    • /
    • v.13A no.6 s.103
    • /
    • pp.511-516
    • /
    • 2006
  • The data grid computing provides geographically distributed storage resources to solve computational problems with large-scale data. Unlike cache replacement policies in virtual memory or web-caching replacement, an optimal file replacement policy for data grids is the one of the important problems by the fact that file size is very large. The traditional file replacement policies such as LRU(Least Recently Used) LCB-K(Least Cost Beneficial based on K), EBR(Economic-based cache replacement), LVCT(Least Value-based on Caching Time) have the problem that they have to predict requests or need additional resources to file replacement. To solve theses problems, this paper propose SBR-k(Sized-based replacement-k) that replaces files based on file size. The results of the simulation show that the proposed policy performs better than traditional policies.

A Smartphone Swapping Policy that Considers the Characteristics of Applications and Memory Situations (앱의 특성과 메모리 상황을 고려하는 스마트폰 스와핑 정책)

  • Hyokyung Bahn;Jisun Kim
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.3
    • /
    • pp.13-18
    • /
    • 2023
  • As the number of mobile applications increases rapidly, the overhead of swapping in smartphone memory systems keeps increasing. Unlike desktop or server systems, the basic setting of smartphones does not support swapping, so applications are killed when available memory is exhausted. This is because swapping in smartphones incurs excessive storage I/O overhead. In this article, we propose a swapping policy for smartphones, which significantly reduces storage I/Os. The proposed policy categorizes mobile applications based on their functional characteristics, and controls the number of applications to be swapped based on application priorities and memory situations. Measurement experiments with Android reference devices show that the proposed swapping policy dramatically reduces the overhead of swapping in various mobile applications.

A Design of SSD Dedicated RAID System for Efficient Resource Management (효율적인 자원관리를 위한 SSD 전용 RAID 시스템 설계)

  • Hyun-Seob Lee
    • Journal of Internet of Things and Convergence
    • /
    • v.10 no.2
    • /
    • pp.109-114
    • /
    • 2024
  • Enterprise storage systems that require high data reliability are applying RAID (Redundant Array of Independent Disks) systems to recover from data loss and failure. In particular, RAID 5 ensures space efficiency and reliability by distributing parity across multiple storage devices. However, when storage devices have different capacities, RAID is built based on the smallest capacity storage device, resulting in wasted storage space. Therefore, research is needed to solve this resource management problem. In this paper, we propose a method for RAID grouping of each independent NAND flash memory block in a RAID consisting of SSD (Solid State Disk) with external SSDs as well as internal SSDs. This method is divided into a policy for delivering block information inside SSDs to the RAID system and a policy for RAID grouping of physical addresses delivered from the RAID system. This method allows us to maintain a RAID that does not waste resources when SSDs of different capacities are grouped into RAID5. Finally, we demonstrate the effectiveness of the proposed method through experiments.