분산 시스템에서 경험적 방법을 이용한 동적 화일 할당 알고니즘 = A Dynamic File Allocation Algorithm Using Heuristic Method in Distributed System

다국어 초록 (Multilingual Abstract)

A lot of researches have been conducted for the optimal distribution of files among the nodes in distributed system. The purpose of those researches was to increase system reliability and to decrease read access cost.
This paper studied a file allocation algorithm which finds file replication and placement for maximizing file accessibility with minimun cast. The key method on this study was as to how effectively access to a created file that was depended on the timing and placing to each node. We proposed an optimal file allocation algorithm while considering read/write access number, communication cost and file size. Then, we presented an algorithm for deciding allocation time and placing minmum preallocation file access cost and for dynamic file allocation algorithm with O(N^4) time complexity.