• 산업경영시스템학회지
• /
• 제30권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.

• 한국시뮬레이션학회논문지
• /
• 제11권3호
• /
• pp.23-34
• /
• 2002

Dynamic storage allocation (DSA) is a field fairly well studied for a long time as a basic problem of system software area. Due to memory fragmentation problem of DSA and its unpredictable worst case execution time, real-time system designers have believed that DSA may not be promising for real-time application service. Recently, the need for an efficient DSA algorithm is widely discussed and the algorithm is considered to be very important in the real-time system. This paper proposes an efficient DSA algorithm called QSB (quick semi-buddy) which is designed to be suitable for real-time environment. QSB scheme effectively maintains free lists based on quick-fit approach to quickly accommodate small and frequent memory requests, and the other free lists devised with adaptation upon a typical binary buddy mechanism for bigger requests in harmony for the .improved performance. Comprehensive simulation results show that the proposed scheme outperforms QHF which is known to be effective in terms of memory fragmentation up to about 16%. Furthermore, the memory allocation failure ratio is significantly decreased and the worst case execution time is predictable.

• 정보처리학회논문지A
• /
• 제13A권7호
• /
• pp.561-572
• /
• 2006

모바일 다비이스는 시스템 자원이 매우 제한적이기 때문에 응용프로그램을 실행시키기 위해서는 자원들을 효율적으로 관리하여야 한다. 특히 제한적인 메모리에 대한 동적 관리기법은 모바일 디바이스의 운영체제 및 플랫폼에서 매우 중요한 요소이다. 그러나 기존 동적 메모리 관리기법들은 응용프로그램의 실행 스타일과 사용되는 객체의 라이프 타임(life time), 객체 종류 및 종류 분포를 고려하치 않음으로써 효율적으로 메모리를 관리할 수 없으며, 응용프로그램의 실행 속도를 저하시킨다. 따라서 본 논문에서는 모바일 응용프로그램의 실행 특성을 분석하고, 분석한 결과를 토대로 모바일 디바이스용 응용프로그램의 실행 시 메모리를 절약하고, 실행 속도를 향상시키는 새로운 동적 메모리관리기법을 제안 및 개발하였다. 기존 동적 메모리 관리 모듈과의 응용프로그램 실행 속도를 비교한 결과. 제안한 동적 메모리 관리기법은 테스트용 응용프로그램을 실행할 때 링크드 리스트[11]에 비하여 6.5배, Doug. Lea 메모리 관리기법[13]에 비하여 2.5배, Brent 메모리 관리기법[15]에 비하여 10.5배 빠른 실행 속도를 보였다.

• 전기의세계
• /
• 제31권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.

• 한국통신학회논문지
• /
• 제25권10B호
• /
• pp.1648-1664
• /
• 2000

This paper proposes a real-time dynamic storage allocation algorithm QSHF(quick-segregated-half-fit) that provides various memory allocation policies. that manages a free block list per each word size for memory requests of small size good(segregated)-fit policy that manages a free list per proper range size for medium size requests and half-fit policy that manages a free list per proper range size for medium size requests and half-fit policy that manages a free list per each power of 2 size for large size requests. The proposed algorithm has the time complexit O(1) and makes us able to easily estimate the worst case execution time(WCET). This paper also suggests two algorithm that finds the proper free list for the requested memory size in predictable time and if the found list is empty then finds next available non-empty free list in fixed time. In order to confirm efficiency of the proposed algorithm we simulated the memory utilization of each memory allocation policy. The simulation result showed that each policy guarantees the constant WCET regardless of memory size but they have trade-off between memory utilization and list management overhead.

• 한국정보처리학회논문지
• /
• 제7권7호
• /
• pp.2204-2218
• /
• 2000

This paper proposes a dynamic storage allocation algorithm, QHF(quick-half-fit) for real-time systems. The proposed algorithm manages a free block list per each worked size for memory requests of small size, and a free block list per each power of 2 size for memory requests of large size. This algorithms uses the exact-fit policy for small sie requests and provides high memory utilization. The proposed algorithm also has the time complexity O(I) and enables us to easily estimate the worst case execution time (WCET). In order to confirm efficiency of the proposed algorithm, we compare he memory utilization of proposed algorithm with that of half-fit and binary buddy system that have also time complexity O(I). The simulation result shows that the proposed algorithm guarantees the constant WCET regardless of the system memory size and provides lower fragmentation ratio and allocation failure ratio thant other two algorithms.

• 한국ITS학회 논문지
• /
• 제9권3호
• /
• pp.85-93
• /
• 2010

본 논문에서는 SOC 설계 자동화를 위한 할당 및 바인딩을 동시에 수행하는 새로운 동적인 하드웨어 할당 및 바인딩 알고리즘을 제안한다. 제안된 알고리즘은 스케줄링의 결과를 입력으로 받아들이고, 각 기능 연산자에 연결된 레지스터 및 연결 구조가 최대한 공유하도록 제어스텝마다 연산과 기억 소자의 상호 연결 관계를 고려하여 기능 연산자, 연결 구조 및 레지스터를 동시에 할당 및 바인딩을 한다. 제안된 알고리즘은 각 시스템마다 비교 실험을 통하여 기존의 기능 연산자와 레지스터의 수를 미리 정했거나, 분리하여 수행한 방식들과 비교함으로서 제안된 알고리즘의 효용성을 보인다.

• 산업공학
• /
• 제9권3호
• /
• pp.202-213
• /
• 1996

Video-on-demand is an interactive service that provides programs (movie, home shopping, etc.) to users connected to a network. This service will require high bandwidth network and video servers with a large amount of storage capacity. From the viewpoint of system analysis, there are optimization problems to be solved. In this paper, we present a dynamic programming method for allocating the storage for programs being served in a multi-level video-on-demand network. In the optimization of the network resource, we consider the three kinds of costs: installation cost for video servers, program storage cost, and transmission (or communication) cost. The factors related to the costs are investigated. An example is shown to illustrate the proposed method.

• 전자공학회논문지B
• /
• 제28B권9호
• /
• pp.703-711
• /
• 1991

In this paper, an efficient storage reclamation algorithm for RISC parallel processing in the object orented programming environments is presented. The memory management for the dynamic memory allocation and the frequent memory access in object oriented programming is the main factor that decreases RISC parallel processing performance. The proposed algorithm can be efficiently allocated the memory space of RISCy computer which is required the frequent memory access, so it can be increased RISC parallel processing performance. The proposed algorithm is verified the efficiency by implementing C language on SUN SPARC(4.3 BSD UNIX).

• Journal of information and communication convergence engineering
• /
• 제10권4호
• /
• pp.405-410
• /
• 2012

Several attempts have been made to add journaling capability to a traditional file allocation table (FAT) file system. However, they encountered issues such as excessive system load or instability of the journaling data itself. If journaling data is saved as a file format, it can be corrupted by a user application. However, if journaling data is saved in a fixed area such as a reserved area, the storage can be physically corrupted because of excessive system load. To solve this problem, a new method that dynamically allocates journaling data is introduced. In this method, the journaling data is not saved as a file format. Using a reserved area and reserved FAT status entry of the FAT file system specification, the journaling data can be dynamically allocated and cannot be accessed by user applications. The experimental results show that this method is more stable and scalable than other log-based FAT file systems. HFAT was tested with more than 12,000 power failures and was stable.