Dynamic file migration in distributed computer systems

ABSTRACT

The importance of file migration is increasing because of its potential to improve the performance of distributed office, manufacturing and hospital information systems. To encourage research in the file migration problem, the authors summarize accomplishments of researchers of the problem, provide a detailed comparison of file migration and dynamic file allocation problems, and identify important areas of research to support the development of effective file migration policies.

REFERENCES

• 1: Ames, J,E,, and Foster, D. Dynamic file assignment in a star network. In Proceedings of Computer Networks Symposium (Gaithersburg, Md., 1977), pp. 36-40.
• 2: Baumol, W.J., and Wolfe, P. A warehouse location problem~ Oper. Res. 6, 263 (1958), 252-263.
• 3: Casey, R.G. Allocation of copies of a file in an information nelwork. In Proceedings of the Spring Joint Computer Conference IFIPS (1972). pp. 617-625.
• 4: Ceri, S., Martella, G., and Pelagatt, G. Optimal file allocation in a computer network: A solution method based on the knapsack problem. Comp. Netw. 6 (1982), 345-357.
• 5: Chen, P.P., and Akoka, J. Optimal design of distributed information systems. IEEE Trans. Comput. C-29, 12 (Dec. 1980), 1068-1080.
• 6: Chu, W.W. Optimal file allocation in a minicomputer information system. IEEE Trans. Comput. 018, 10 (Oct. 1969), 885-889.
• 7: Lawrence W. Dowdy , Derrell V. Foster, Comparative Models of the File Assignment Problem, ACM Computing Surveys (CSUR), v.14 n.2, p.287-313, June 1982 [doi>10.1145/356876.356883]
• 8: ElllS,C., and Foyd, R. The ROE file system. IN proceedings of the 3rd Symposium on Reliability in Distributed Software Systems (Oct. 1983), pp. 175-181.
• 9: Eswaran, K.P. Placement of records in a file and file allocation in a computer network~ In Information Processing 74. IFIPS, N.Y., 1974.
• 10: Marshall L. Fisher , Dorit S. Hochbaum, Database Location in Computer Networks, Journal of the ACM (JACM), v.27 n.4, p.718-735, Oct. 1980 [doi>10.1145/322217.322226]
• 11: Foster, D.V., Dowdy, L~W., and Ames, J.E. File assignment in a computer network. Comput. Netw, 5 (1981), 341-349.
• 12: Gavish, B. Models for configuring large scale distributed computing systems. AT&T technical J. 64, 2 (1985), 491-532.
• 13: B. Gavish, Optimization models for configuring distributed computer systems, IEEE Transactions on Computers, v.36 n.7, p.773-793, July 1987 [doi>10.1109/TC.1987.1676975]
• 14: Gavish, B., and Pirkul, H. Allocation of data bases in distributed computing systems. In I. Akoka, Ed., Management of Distributed Data Processing. North-Holland, 1982, pp. 215-231.
• 15: Bezalel Gavish , Hasan Pirkul, Computer and database location in distributed computer systems, IEEE Transactions on Computers, v.35 n.7, p.583-590, July 1986 [doi>10.1109/TC.1986.1676799]
• 16: Ghosh, S.P. Distributing a data base with logical associations on a computer network for parallel searching. IEEE Trans. Softw. Eng. SE-2, 2 (June 1976).
• 17: Enrique Grapa , Geneva G. Belford, Some theorems to aid in solving the file allocation problem, Communications of the ACM, v.20 n.11, p.878-882, Nov. 1977 [doi>10.1145/359863.359895]
• 18: Hac, A. File migration and process migration in a local area network. In Proceedings of INFOCOM86 (1986), pp. 488-495.
• 19: A. R. Hevner , A. Rao, Distributed data allocation strategies, Advances in computers, Academic Press Professional, Inc., San Diego, CA, 1988
• 20: Irani, K.B., and Khabbaz, N.G. A methodology for the design of communication networks and the distribution of data in distributed supercomputer systems. IEEE Trans. Comput. C-31, 5 {May 1982), 419-434.
• 21: }enny, C.}. Placing files and processes in distributed systems: A general method considering resources with limited capacity. Research Report, IBM Zurich Research Laboratory, Switzerland, 1982.
• 22: Lanning, L.J., and Leonard, M.S. File allocation in a distributed computer communication network. IEEE Trans. Comput. C-32, 3 (1983), 232-244.
• 23: Levin, K.D. Adaptive structuring of distributed databases. In Proceedings of National Computer Conference (1982), pp. 691-696.
• 24: Levin, K.D., and Morgan, H.L. A dynamic optimization model for computer systems. ph.d. dissertion, williams E.simon graduate distributed databases. Oper. Res. 26, 5 (Sept=Oct. 1978), 824-835.
• 25: Olivia Ruoh-Huey Liu Sheng, Models for dynamic file migration in distributed computer systems, 1986
• 26: Mary Elizabeth Loomis, Data base design: object distribution and resource-constrained task scheduling., 1975
• 27: Samy Mahmoud , J. S. Riordon, Optimal allocation of resources in distributed information networks, ACM Transactions on Database Systems (TODS), v.1 n.1, p.66-78, March 1976 [doi>10.1145/320434.320449]
• 28: Howard L. Morgan , K. Dan Levin, Optimal program and data locations in computer networks, Communications of the ACM, v.20 n.5, p.315-322, May 1977 [doi>10.1145/359581.359591]
• 29: Kowtha Murthy , John Kam , M. S. Krishnamoorthy, An approximation algorithm to the file allocation problem in computer networks, Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems, March 21-23, 1983, Atlanta, Georgia [doi>10.1145/588058.588087]
• 30: Paris, J., and Tichy, W.F. STORK: An experimental migrating file system for computer networks. IEEE lnfocom, 1983.
• 31: PC WEEK,conectivlty supplementat. 1988.
• 32: G. Popek , B. Walker , J. Chow , D. Edwards , C. Kline , G. Rudisin , G. Thiel, LOCUS a network transparent, high reliability distributed system, Proceedings of the eighth ACM symposium on Operating systems principles, p.169-177, December 14-16, 1981, Pacific Grove, California, United States
• 33: Juan Burrut Porcar, File migration in distributed computer systems, 1982
• 34: Ramamoorthy. C.V., amd Wah, B.W. data management in distributed data bases. In Proceedings of National Computer Conference {1979), pp. 667-680.
• 35: Ramamoorthy, C~V~, and Wah, B.W. The isomorphism of simple file allocation. IEEE Trans. Comput. C-32, 3 (Mar. 1983), 221-232.
• 36: Segall, A. Dynamic file assignment in a computer network. IEEE Trans. Automatic Control, AC-21, 2 (Apr. 1976}, 161-173.
• 37: Segall, A., and Sandell, Jr., N.R. Dynamic file assignment in a computer network--Part II: Decentralized control. IEEE Trans. Automatic Control, AC-24, 5 (Oct. 1979), 709-715.
• 38: Tichy, W., and zuwang ,R.Toward a distributed file system Proceedings of the 1984 USENIX Summer Conf., 0984), pp. 87-97.
• 39: Kishor S. Trivedi , Robert A. Wagner , Timothy M. Sigmon, Optimal Selection of CPU Speed, Device Capacities, and File Assignments, Journal of the ACM (JACM), v.27 n.3, p.457-473, July 1980 [doi>10.1145/322203.322208]
• 40: Wah, B.W. An efficient heuristic for file placement on distributed databases. In COMPSACC 80 {Oct~ 1980), 462-468.
• 41: Wah, B.W. File placement on distributed computer systems. IEEE Comput. 17, 1 (}an. 1984), 23-30.
• 42: Clement T. Yu , Man-Keung Siu , K. Lam , C. H. Chen, Adaptive file allocation in star computer network, IEEE Transactions on Software Engineering, v.11 n.9, p.959-965, Sept. 1985 [doi>10.1109/TSE.1985.232830]

INDEX TERMS

Primary Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.3 File Systems Management
          Subjects: Distributed file systems

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.4 Distributed Systems
          Subjects: Distributed databases

  D. Software
  D.4 OPERATING SYSTEMS
      D.4.3 File Systems Management
          Subjects: Access methods
      D.4.7 Organization and Design
          Subjects: Distributed systems

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.4 Systems
          Subjects: Transaction processing

General Terms:
Design, Performance