file allocation problem

基本解释

File Allocation Problem (FAP) is one of the classical problems in computer network and distribution system.
文件分配问题（FAP）是计算机网络和分布式系统优化中的经典问题。
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）来实现基于分条技术的磁盘动态负载均衡的算法。