|
ABSTRACT
In this paper, the problem of determining an optimal location strategy for an individual program execution is considered. In addition, we propose a heuristic approach for the dynamic file allocation problem. In order to reduce the complexity of the optimization problems, a cluster-based approach is used.To access the data files of a distributed file system, a user initiates a program execution. Based on the current allocation of the program and data files as well as the knowledge about the characteristics of the programs, a first optimization calculates the optimal cluster for each individual program execution. The objective of this optimization is the minimization of the intercluster traffic of an individual program execution. Within the optimal cluster, a simple load-balancing strategy is used to determine the corresponding executing node.A second optimization looks for file allocations where the global intercluster traffic is minimized subject to the following constraints: minimal number of file copies, availability, and storage capacity.Experimental results showing the efficiency of the proposed algorithms are examined, and the implications of the model for the design of very large distributed file systems are discussed.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
[1] Adam, N.R., Tewari, R.: Regeneration with Virtual Copies for Replicated Databases. Proc. 11th IEEE Int. Conf. on Distributed Computing Systems, Arlington, TX, May 1991. Los Alamitos, CA: IEEE Comp. Soc. Press, pp. 429-436.
|
| |
2
|
[2] Akoka, J.: Design of Optimal Distributed Database Systems. Proc. 1st Int. Symp. on Distributed Data Base, Paris, France, 1980, pp. 229-245.
|
| |
3
|
[3] Banawan, S.A.: An Evaluation of Load Sharing in Locally Distributed Systems. Dept. of Computer Science, Univ. of Washington, Seattle, WA, Technical Report 87-08-02, Aug. 1987.
|
 |
4
|
|
 |
5
|
|
| |
6
|
|
| |
7
|
|
| |
8
|
|
| |
9
|
[9] Borghoff, U.M.: Fehlertoleranz in verteilten Dateisystemen: Eine Übersicht über den heutigen Entwicklungsstand bei den Votierungsverfahren. Informatik-Spektrum 14:1, 15-27 (Feb. 1991).
|
| |
10
|
[10] Carroll, J.L., Long, D.D.E., Pâris, J.-F.: Block-level Consistency of Replicated Files. Proc. 7th IEEE Int. Conf. on Distributed Computing Systems, Berlin, Germany, Sep. 1987. Los Alamitos, CA: IEEE Comp. Soc. Press, pp. 146-153.
|
| |
11
|
[11] Casey, R.G.: Allocation of Copies of a File in an Information Network. Proc. Spring Joint Computer Conf. 40, 1972. Arlington, VA: AFIPS Press, pp. 617-625.
|
| |
12
|
[12] Ceri, S., Martella, G., Pelagatti, G.: Optimal File Allocation in a Computer Network: A Solution Based on the Knapsack Problem. Computer Networks, pp. 345-357 (1982).
|
| |
13
|
[13] Chen, P.P.S., Akoka, J.: Optimal Design of Distributed Information Systems. IEEE Transactions on Computers c-20:12, 1068-1080 (Dec. 1980).
|
| |
14
|
[14] Chu, W.W.: Optimal File Allocation in a Multiple Computer System. IEEE Transactions on Computers c-18:10, 885-889 (Oct. 1969).
|
| |
15
|
[15] Chu, W.W.: Optimal File Allocation in a Computer Network. In: Abramson, N., Kuo, F.F. (eds.): Computer Communication Systems, 1973. Englewood Cliffs, NJ: Prentice-Hall, pp. 82-84.
|
| |
16
|
[16] Coffman, E.G., Gelenbe, E., Plateau, B.: Optimization of the Number of Copies of Files in a Distributed Database. IEEE Transactions on Software Engineering SE-7:1, 78-84 (Jan. 1981).
|
 |
17
|
|
 |
18
|
|
 |
19
|
|
 |
20
|
|
| |
21
|
|
| |
22
|
[22] Eswaran, K.P.: Placement of Records in a File and File Allocation in a Computer Network. Proc. IFIP Conf. Information Processing 74, Stockholm, Schweden, Aug. 1974. Amsterdam, New York: North-Holland, pp. 304-307.
|
| |
23
|
[23] Garcia-Molina, H., Abbott, R.K.: Reliable Distributed Database Management. Proc. IEEE 75:5, 601-620 (May 1987).
|
 |
24
|
|
| |
25
|
|
| |
26
|
|
 |
27
|
|
| |
28
|
[28] Gerbessiotis, A.B., Kollias, J.G.: Towards an Optimal Allocation of Fragments of Relations. In: Speth, R. (ed.): Proc. EUTECO '88 - Research into Networks and Distributed Applications, Vienna, Austria, Apr. 1988. Amsterdam, New York: North-Holland.
|
 |
29
|
|
 |
30
|
|
| |
31
|
|
| |
32
|
[32] Hac, A., Jin, X.: Dynamic Load Balancing in a Distributed System Using a Decentralized Algorithm. Proc. 7th IEEE Int. Conf. on Distributed Computing Systems, Berlin, Germany, Sep. 1987. Los Alamitos, CA: IEEE Comp. Soc. Press, pp. 170-177.
|
| |
33
|
|
| |
34
|
[34] Hac, A., Johnson, T.J.: Dynamic Load Balancing Through Process and Read-Site Placement in a Distributed System. AT & T Bell Techn. Journal, pp. 72-85 (Oct. 1988).
|
 |
35
|
|
| |
36
|
[36] Jacqmot, C., Milgrom, E., Joosen, W., Berbers, Y.: UNIX and Load Balancing: A Survey. Proc. Europ. UNIX Systems User Group Conf. Spring '89, Brussels, Belgium, Apr. 1989. Buntingford Herts, UK: EUUG, pp. 1-15.
|
| |
37
|
|
| |
38
|
|
| |
39
|
[39] Kurose, J.F., Simha, R.: A Microeconomic Approach to Optimal File Allocation. Proc. 6th IEEE Int. Conf. on Distributed Computing Systems, Cambridge, MA, May 1986. Los Alamitos, CA: IEEE Comp. Soc. Press, pp. 28-35.
|
| |
40
|
[40] Kurose, J.F., Simha, R.: Second Derivative Algorithms for Optimal Resource Allocation in Distributed Computer Systems. Proc. 7th IEEE Int. Conf. on Distributed Computing Systems, Berlin, Germany, Sep. 1987. Los Alamitos, CA: IEEE Comp. Soc, Press, pp. 56-63.
|
| |
41
|
[41] Laning, L.J., Leonard, M.S.: File Allocation in a Distributed Computer Communication Network. IEEE Transactions on Computers c-32:3, 232-244 (Mar. 1983).
|
| |
42
|
[42] Levin, K.D., Morgan, H.L.: Optimizing Distributed Data Bases - A Framework for Research. Proc. AFIPS Nat. Computer Conf. 44, 1975. Arlington, VA: AFIPS Press, pp. 473-478.
|
| |
43
|
[43] Litzkow, M.J., Livny, M., Mutka, M.W.: Condor - A Hunter of Idle Workstations. Proc. 8th IEEE Int. Conf. on Distributed Computing Systems, San Jose, CA, Jun. 1988. Los Alamitos, CA: IEEE Comp. Soc. Press, pp. 104-111.
|
| |
44
|
[44] Long, D.D.E.: The Management of Replication in a Distributed System. Dept. of Computer and Information Science, Univ. of California, Santa Cruz, CA, Technical Report UCSC/CRL 88/07, 1988.
|
 |
45
|
|
 |
46
|
|
| |
47
|
|
| |
48
|
[48] Pattipati, K.R., Wolf, J.L.: A File Assignment Problem Model for Extended Local Area Network Environments. Proc. 10th IEEE Int. Conf. on Distributed Computing Systems, Paris, France, May 1990. Los Alamitos, CA: IEEE Comp. Soc. Press, pp. 554-561.
|
| |
49
|
[49] Pirkul, H.: An Integer Programming Model for the Allocation of Databases in a Distributed Computer System. Europ. Journal of Operational Research 26, 401-411 (1986).
|
| |
50
|
|
| |
51
|
[51] Ramamoorthy, C.V., Wah, B.W.: The Isomorphism of Simple File Allocation. IEEE Transactions on Computers c-32:3, 221-232 (Mar. 1983).
|
| |
52
|
[52] Ramesh, R., Ryan, B.: Optimal File Allocation and Report Assignment in Distributed Information Networks. Naval Research Logistics 37:1, 165-181 (Feb. 1990).
|
| |
53
|
|
| |
54
|
|
 |
55
|
|
| |
56
|
[56] Wah, B.W.: File Placement on Distributed Computer Systems. IEEE Computer 17:1, 23-33 (Jan. 1984).
|
| |
57
|
[57] Wang, Y.-T., Morris, R.J.T.: Load Sharing in Distributed Systems. IEEE Transactions on Computers c-34:3, 204-217 (Mar. 1985).
|
| |
58
|
|
| |
59
|
|
|