• Title/Summary/Keyword: Dynamic storage management

Search Result 104, Processing Time 0.035 seconds

A study on the run-time storage management for recursice and nested structure (Recursive nested 구조를 위한 run-time 기억장소 운영에 관한 연구)

  • 김영택;차윤경
    • 전기의세계
    • /
    • v.31 no.4
    • /
    • pp.281-287
    • /
    • 1982
  • PASCAL has a recursive nested structure and uses deep binding of identifiers. This paper studies the problems and techniques in storage management for PASCAL on the IBM 370 system, and presents run-time storage administration algorithms which use stack scheme and heap efficiently on the view of storage. The stack-scheme was used to implement the feature of recursive nested structure and the heap was used to implement the feature of the dynamic allocation procedure and pointer variable, allowing an additional dynamic storage recovery procedure.

  • PDF

The Allocation Planning of Storage Location in a Dedicated Storage Method Warehuse System (지정식 보관방식 창고시스템에서 보관위치 할당계획)

  • Chang, Suk-Hwa
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.30 no.1
    • /
    • pp.8-14
    • /
    • 2007
  • This paper addresses the allocation planning of the storage location in a warehouse system that the dedicated storage method is used. In the discrete finite time period model, the demands for storage location of products are dynamic for time periods. The planning is to determine the reallocation time period and the storage location of the products in reallocation time period, which minimizes costs. The cost factors are the reallocation cost, the travel cost within warehouse and the surplus storage location cost. A model is formulated, and the property of optimal solution is characterized. The dynamic programming algorithm is developed, and a numerical example is shown.

Power Management Strategy and Performance Evaluation for OpenStack Object Storage (오픈스택 기반 객체 스토리지를 위한 전력관리 기법과 성능 평가)

  • Ahn, Cheong-Jin;Song, Tae-Gun;Lee, Byeong-Hyeon;Kim, Deok-Hwan
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.6
    • /
    • pp.296-301
    • /
    • 2016
  • Object-based storage is an efficient storage solution that can handle unstructured data and shows better security and scalability than traditional block-based storage. However, in terms of power management, Object-based storage writes multiple copies in storage cluster, hence many servers consume unnecessary power in idle state. In order to resolve this problem, it is necessary to apply power management strategy by adjusting power mode of servers in idle state according to their workloads. In this paper, we proposed a new dynamic power management (DPM) method to transform power mode of storage servers dynamically according to workload information sent from proxy server. The experimental result shows that the proposed power management technic reduces total power consumption by 12% in the OpenStack based Swift object storage.

Management Information System of the Nanji Islands National Marine Reserve, China

  • Qingmei, XIAO;Huaguo, ZHANG;Changbao, ZHOU;Weigen, HUANG;Dongling, LI;Junhua, Ten
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.298-300
    • /
    • 2003
  • A management information system of the Nanji Islands National Marine Reserve is designed and constructed based on method of integration of remote sensing and geographic information system (GIS). The system consists of two sub-systems, dynamic monitoring information system and general database system. The former is used for storage and manage fundamental geographical data (topographical and bathymetric map), satellite remote sensing data (IKONOS, SPOT, IRS, NOAA and SeaWiFS etc.) and multimedia data. The latter is used for storage and manage resource data (shellfish and alga etc.), environmental data (meteorological and hydrologic) and in situ data. As part of electronic government, this system will be submitted to local government for monitoring, management and decision.

  • PDF

Locating export containers in order to minimize the number of rehandles (재취급을 최소화하기 위한 수출컨테이너 장치위치 결정법)

  • 김갑환;박영만
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.473-476
    • /
    • 1996
  • In order to reduce the number of rehandles during the loading operation of export containers in port container terminals, the storage location of each arriving container should be determined considering of its weight. We formulate the problem by a dynamic programming model to get the optimal storage location.

  • PDF

Dynamic storage management for mobile platform based on the characteristics of mobile applications (응용프로그램 특성을 고려한 모바일 플랫폼의 동적 메모리 관리기법)

  • You, Yong-Duck;Park, Sang-Hyun;Choi, Hoon
    • The KIPS Transactions:PartA
    • /
    • v.13A no.7 s.104
    • /
    • pp.561-572
    • /
    • 2006
  • Performance of the mobile devices greatly depends on the efficient resource management because they are usually resource-restricted. In particular, the dynamic storage allocation algorithms very important part of the mobile device's operating system and OS-like software platform. The existing dynamic storage allocation algorithms did not consider application's execution style and the type, life-time, and characteristics of memory objects that the application uses. Those algorithms, as a result, could not manage memory efficiently Therefore, this Paper analyzes the mobile application's execution characteristics and proposes anew dynamic storage allocation algorithm which saves the memory space and improves mobile application's execution speed. The test result shows that the proposed algorithm works 6.5 times faster than the linked-list algorithm[11], 2.5 times faster better than the Doug. Lea's algorithm[12] and 10.5 times faster than the Brent algorithm[14].

Energy and Performance-Efficient Dynamic Load Distribution for Mobile Heterogeneous Storage Devices (에너지 및 성능 효율적인 이종 모바일 저장 장치용 동적 부하 분산)

  • Kim, Young-Jin;Kim, Ji-Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.4
    • /
    • pp.9-17
    • /
    • 2009
  • In this paper, we propose a dynamic load distribution technique at the operating system level in mobile storage systems with a heterogeneous storage pair of a small form-factor and disk and a flash memory, which aims at saving energy consumption as well as enhancing I/O performance. Our proposed technique takes a combinatory approach of file placement and buffer cache management techniques to find how the load can be distributed in an energy and performance-aware way for a heterogeneous mobile storage air of a hard disk and a flash memory. We demonstrate that the proposed technique provides better experimental results with heterogeneous mobile storage devices compared with the existing techniques through extensive simulations.

A Stochastic Dynamic Programming Model to Derive Monthly Operating Policy of a Multi-Reservoir System (댐 군 월별 운영 정책의 도출을 위한 추계적 동적 계획 모형)

  • Lim, Dong-Gyu;Kim, Jae-Hee;Kim, Sheung-Kown
    • Korean Management Science Review
    • /
    • v.29 no.1
    • /
    • pp.1-14
    • /
    • 2012
  • The goal of the multi-reservoir operation planning is to provide an optimal release plan that maximize the reservoir storage and hydropower generation while minimizing the spillages. However, the reservoir operation is difficult due to the uncertainty associated with inflows. In order to consider the uncertain inflows in the reservoir operating problem, we present a Stochastic Dynamic Programming (SDP) model based on the markov decision process (MDP). The objective of the model is to maximize the expected value of the system performance that is the weighted sum of all expected objective values. With the SDP model, multi-reservoir operating rule can be derived, and it also generates the steady state probabilities of reservoir storage and inflow as output. We applied the model to the Geum-river basin in Korea and could generate a multi-reservoir monthly operating plan that can consider the uncertainty of inflow.

Traceable Dynamic Public Auditing with Identity Privacy Preserving for Cloud Storage

  • Zhang, Yinghui;Zhang, Tiantian;Guo, Rui;Xu, Shengmin;Zheng, Dong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5653-5672
    • /
    • 2019
  • In cloud computing era, an increasing number of resource-constrained users outsource their data to cloud servers. Due to the untrustworthiness of cloud servers, it is important to ensure the integrity of outsourced data. However, most of existing solutions still have challenging issues needing to be addressed, such as the identity privacy protection of users, the traceability of users, the supporting of dynamic user operations, and the publicity of auditing. In order to tackle these issues simultaneously, in this paper, we propose a traceable dynamic public auditing scheme with identity privacy preserving for cloud storage. In the proposed scheme, a single user, including a group manager, is unable to know the signer's identity. Furthermore, our scheme realizes traceability based on a secret sharing mechanism and supports dynamic user operations. Based on the security and efficiency analysis, it is shown that our scheme is secure and efficient.