Comparative Models of the File Assignment Problem

ACM Computing Surveys (CSUR)

Volumn 14, Issue 2, 1982, Pages 287-313

  Dowdy, Lawrence W ^a   Foster, Derrell V ^a  

^a VANDERBILT UNIVERSITY   (United States)

Author keywords

computer networks; File assignment; queuing network models

Indexed keywords

DISTRIBUTED FILE SYSTEMS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0020141865     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/356876.356883     Document Type: Article

References (54)

1. Ames, J.E. “Dynamm file allocation in a distributed database system”, Ph.D. Dissertation, Dep Computer Science, Duke Univ., Durham, N. C., 1977.
2. Ames, J.E., and Foster, D.V. “Dynamic assignment in a star network”, in Proc. Computer Networks Syrup. (Galthersburg, Maryland, Dec. 1977).
3. Arora, S.R., and Gallo, A. “Optimal sizmg, loading, and reloading in a multi-level memory hmrarchy system”, in Proc. AFIPS 1971 Spring Jr. Computer Conf., vol. 38, AFIPS Press, Arlington, Va., pp 337–344.
4. Arora, S.R., and Gallo, A. “Optimization of static loading and sizing of multilevel memory systems”, J ACM 20, 2 (Apr 1973), 307–319.
5. Boorstyn, R.R., and McGregor, P.V. “Optimal load sharing in a computer network”, Int. Conf. Communwatmns (June 1975), vol. 3.
6. Buzen J.P. “Queueing network models of multiprogramming”, Ph.D. Dissertation, Div. Engineering and Applied Physics, Harvard Univ., Cambridge, Mass., 1971.
7. Buzen, J.P., aNd Chen, P.P.-S. “Optimal load balancing in memory hierarchms”, in Proc. IFIP, North-Holland Publ., Amsterdam, 1974.
8. Buzen, J.P., and Goldberg, P.S. “Guidelines for the use of infinite source queuemg models in the analysis of computer system performance”, in Proc. AFIPS 1974 Nat Computer Conf., vol. 43, AFIPS Press, Arlington, Va., pp. 371–374.
9. Casey, R.G. “Allocation of copies of a file m an information network”, Proc AFIPS 1972 Spring Jt. Computer Conf., vol. 40, AFIPS Press, Arlington, Va., pp. 617–625.
10. Casey, R.G. “Design of tree networks for distributed data.” in Proc. AFIPS 1973 Nat. Computer Conf., vol 42, AFIPS Press, Arlington, Va., pp. 251–257.
11. Chandy, K.M., and Hewes, J.E. “File allocation in distributed systems”, in Proc. Int. Syrup on Computer Performance Modehng, Measurement, and Evaluation (Cambridge, Mass, March 1976), pp. 10–13.
12. Chang, S.K., and Liu, C.N. “Modeling and design of distributed information systems”, in Advances Informatmn Systems Scwnce, vol. 7, 1978, pp. 157–231.
13. Chen, P.P.-S. “Optimal file allocation in multilevel storage systems”, in Proc. AFIPS 1973 Nat. Computer Conf., vol. 42, AFIPS Press, Arlington, Va., pp. 277–282.
14. Chen, P.P.-S. “Optimal partition of input load parallel exponential servers”, in Proc. 5th Annu. Southeastern Syrup. on System Theory (Raleigh, North Carolina, March 1973).
15. Chen, P.P.-S., and Akoka, J. “Optimal design of distributed information systems” IEEE Trans. Comput. C-29, 12 (Dec. 1980), 1068–1080.
16. Chu, W.W. “Optimal file allocation in a computer network”, in Computer-Communication Systems, N Abramson and F. F. Kuo, Eds., Prentice-Hall, Englewood Cliffs, N.J., 1973, pp. 82–94.
17. Chu, W.W. “Performance of file directory systems for data bases in star and distributed networks”, in Proc. AFIPS 1976 Nat Computer Conf., vol. 45, AFIPS Press, Arlington, Va., pp. 577–587.
18. Chu, W.W., Holloway, L.J., Lan, M.T., and Efe, K. “Task allocation in distributed data processing”, Computer 13, 11 (Nov. 1980), 57–69.
19. Coffman, E.G., Gelenbe, E., and Wood, R.C. “Optimal replication of parallelread, sequential-write systems”, Performance Evaluatmn Rev. (Summer 1980), 209–216.
20. Dowdy, L.W. Optimal branching probabilities and their relationship to computer network file distribution, Ph.D Dissertation, Dep Computer Science, Duke Univ., Durham, N. C, 1977.
21. Dowdy, L.W., and McGinnis, R. “File placement using predictive quemng models”, Tech. Rep. TR-924, Univ of Maryland, College Park, August, 1980.
22. Eswaran, K.P. “Placement of records in a file and file allocation in a computer network”, in Proc. IFIPS Conference (Stockholm, Sweden, Aug. 1974), pp. 304–307.
23. Fisher, M.L., and Hochbaum, D.S. “Data base location in computer networks”, Decision Sciences Working Paper 78-10-09, Dep. Decision Science, Univ. of Pennsylvania, Philadelphia, Oct 1978.
24. Foster, D.V., and Browne, J.C. “File assignment in memory hierarchies”, in Proc Modehng and Performance Evaluation of Computer Systems, Oct. 1976, Beilner and Gelenber, Eds., North-Holland Publ., Amsterdam, 1976, pp. 119–127.
25. Foster, D.V., Dowdy, L.W., and Ames, J.E. “File assignment in a computer network”, Comput. Networks 5 (Sept. 1981), 341–349.
26. Hadley, G. Linear Programming. Addison-Wesley, Reading, Mass., 1963.
27. Hughes, P.H., and Moe, G. “A structural approach to computer performance analysin”, Proc AFIPS 1973 Spring Jt. Computer Conf., AFIPS Press, Arlington, Va, pp 109–120.
28. Jones, L.G., Foster, D.V., and Krolak, P.D. “A goal programming formulatmn used In the file assignment problem”, in Proc. R. J. Duffin Conf. (Pittsburgh, Pa., July 1978).
29. Jones, L.G., and Foster, D.V. “A heumstic solution to the file assignment problem”, Proc. Southeasteon. (Roanoke, Va., Apr. 1979).
30. Jones, L.G., and Foster, D.V. “Toward a multiple copy file assignment model for files in a computer system”, Proe. 17th Annu Southeast Regmnal A CM Conf (Orlando, Fla., Apr 1979).
31. Kleinrock, L. Queuing Systems-Volume 2: Computer Applicatmns, Wiley, New York, 1976
32. Landwehr, C.E. “Load sharing in computer networks: A queuing model”, in Merit Computer Network Publication MCN-1174-TR-18, Univ. of Michigan, Ann Arbor, Nov. 1974.
33. Levin, K.D. “Organizing distributed data bases in computer networks”, Ph.D. dissertation, Dep. Decision Scmnce, Umv. of Pennsylvania, Philadelphia, 1974.
34. Levin, K.D., and Morgan, H.L. “Optimizing distributed databases a framework for research”, in Proc. AFIPS 1975 Nat. Computer Conf., vol. 44, AFIPS Press, Arhngton, Va., pp 473–478.
35. Loomis, M.S., and Popek, G.J. “A model for data base distribution”, Trends and Apphcatmns: Computer Networks, 1976.
36. Mahmoud, S., and Riordon, J.S. “Optimal allocation of resources in dmtrlbuted reformation networks”, ACM Trans. Database Syst. 1, 1 (March 1976), 66–78
37. Mendelson, H., Pliskin, J.S., and Yechiali, U. Optimal storage allocation for serial files. Commun. ACM 22, 2 (Feb. 1979), 124–130
38. Morgan, H.L. and Levin, K.D. “Optnnal program and data locatmns m computer networks”, Commun. ACM 20, 5 (May 1977), 315–322.
39. Piepmeier, W.F. “Optimal balancing of I/O requests to disks”, Commun. ACM 18, 9 (Sept. 1975), 524–527.
40. Price, T.G. “Probability models of multiprogrammed computer systems”, Ph.D. Dissertation, Dep. Electrmal Engmeering, Stanford Umv, Stanford, Calif, 1974.
41. Price P.L., and Smith, D.W. “Analysm and use of an integer programming model for optimally allocating files in a multiple computing system”, Rep. DTNSRDC 78/102, Dawd Taylor Naval Ship Research and Development Center, Bethesda, Md., Nov 1978
42. Ramamoorthy, C.V., and Chandy, K.M. “OptimLzation of memory hierarchms in multiprogrammed systems”, J. ACM 17, 3 (July 1970), 426–445
43. Rose, L.L., and Gotterer, M.H. “A theory of dynamic file management in a multilevel store.” Int. J Comput. Inf. Sci 2, 4 (Dec. 1973), 249–256.
44. Rose, L.L., and Gotterer, M.H. “An analysis of file movement under dynamic file management strategms”, BIT 15, 3 (1975), 304–313.
45. Rose, L.L., and Gotterer, M.H. “File evaluation in auxiliary storage”, Int. J Comput. Inf. Sci. 4, 3 (Sept 1975), 197–204.
46. Rothnie, J.B., and Goodman, N.A. “A survey of research and development in dLstmbuted database management”, in Proc. Conf. Very Large Database Systems (Tokyo, Japan, Oct. 1977), pp. 48–62.
47. Smith, A.J. “Long-term file migration, development and evaluation of algorithms”, Commun. ACM 24, 8 (Aug. 81), 521–532
48. Smith, A.J. “Algorithms and architectures for enhanced file system use”, in Experimental Computer Performance and Evaluatmn, D. Ferrari and M. Spadoni, Eds., North-Holland Publ., Amsterdam and New York, 1981, pp. 165–193.
49. Stritter, E.P. File migration. Computer Scmnce Rep. STAN-77-594, Dep Computer Science, Stanford Univ., Stanford, Calif., Jan. 1977.
50. Suri, R. Resource management in large systems, Ph.D. Dissertation, Dep. Engmeering, Harvard Univ., Cambridge, Mass., July 1978.
51. Trivedi, K.S., and Kinicki, R.E. “A mathematical model for computer system configuration plannmg”, m Proc Int. Conf. Performance of Computer Installations (Italy, June 1978).
52. Trivedi, K.S., Wagner, R.A., and Siomon, W.M. “Optimal selection of cpu speed, device capacitms, and file assignments”, J. ACM 27, 3 (July 1980), 457–473.
53. Trivedi, K.S., and Geist, R.M. “OptLmal design of storage hierarchies” (to appear in IEEE Trans. Computers).
54. Whitney, V.K.M. “A study of optnnal file assignment and communication network configuration”, Ph.D. Dissertation, Dep. Electrical Engineering, Univ. of Michigan, Ann Arbor, Sept 1970.