Design of optimal distributed file systems

摘要: In this paper, the problem of determining an optimal location strategy for individual program execution is considered. addition, we propose a heuristic approach dynamic file allocation problem. order to reduce complexity optimization problems, cluster-based used.To access data files distributed system, user initiates execution. Based on current and as well knowledge about characteristics programs, first calculates cluster each The objective minimization intercluster traffic Within cluster, simple load-balancing used determine corresponding executing node.A second looks allocations where global minimized subject following constraints: minimal number copies, availability, storage capacity.Experimental results showing efficiency proposed algorithms are examined, implications model design very large systems discussed.