file allocation problem

基本解釋

File Allocation Problem (FAP) is one of the classical problems in computer network and distribution system.
文件分配問題（FAP）是計算機網絡和分布式系統(tǒng)優(yōu)化中的經典問題。
Focusing on the file allocation problem, a computationally efficient algorithm for calculating the minimum makespan in tree type networks is proposed.
針對文件分配問題，提出了一種求解樹狀網絡中最短接通時間的快速算法。
This paper presented a new scheme based on disk striping and GEP to solve the problem, including the file partition algorithm based on disk striping and the file allocation algorithm for load balance.
提出了一種采用基因表達式編程（GEP）來實現(xiàn)基于分條技術的磁盤動態(tài)負載均衡的算法。