file allocation problem

基本解釋

File Allocation Problem (FAP) is one of the classical problems in computer network and distribution system.
文件分配問(wèn)題（FAP）是計(jì)算機(jī)網(wǎng)絡(luò)和分佈式系統(tǒng)優(yōu)化中的經(jīng)典問(wèn)題。
Focusing on the file allocation problem, a computationally efficient algorithm for calculating the minimum makespan in tree type networks is proposed.
針對(duì)文件分配問(wèn)題，提出了一種求解樹(shù)狀網(wǎng)絡(luò)中最短接通時(shí)間的快速算法。
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.
提出了一種採(cǎi)用基因表達(dá)式編程（GEP）來(lái)實(shí)現(xiàn)基於分條技術(shù)的磁磐動(dòng)態(tài)負(fù)載均衡的算法。