Lawrence W. Dowdy
- AMES77a AMES, J.E. "Dynamic ~de allocation in a distributed database system," Ph.D. Dissertation, Dep Computer Science, Duke Univ., Durham, N. C., 1977. Google Scholar
- AMES77b AMES, J. E., AND FOSTER, D.V. "Dynamic fde assignment in a star network," in Proc. Computer Networks Syrup. (Gaithersburg, Maryland, Dec. 1977).Google Scholar
- AROR71 ARORA, S. R., AND GALLO, A. "Optunal sizmg, loading, and reloading in a multi-level memory hmrarchy system," in Proc. AFIPS 1971 Spring Jt. Computer Conf., vol. 38, AFIPS Press, Arlington, Va., pp 337-344.Google Scholar
- AROR73 ARORA, S. R., AND GALLO, A. "Optimization of static loading and sizing of multilevel memory systems," J ACM 20, 2 (Apr 1973), 307-319. Google ScholarDigital Library
- BOOR75 BOORSTYN, R. R., AND MCGREGOR, P. V "Optimal load sharing in a computer network," m Int. Conf. Communwat~ons (June 1975), vol. 3.Google Scholar
- BUZE71 BuzEN, J.P. "Queueing network models of multiprogramming," Ph.D. Dissertation, Div. Engineering and Applied Physics, Harvard Univ., Cambridge, Mass., 1971.Google Scholar
- BUZE74a Bvzr~, J. P., AND CnEN, P P -S. "Optnnal load balancing in memory hierarchies," in Proc. IFIP, North-Holland Publ., Amsterdam, 1974.Google Scholar
- BUZE74b BuzEN, J P, AND GOLDBERG, P.S. "Gmdehnes 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.Google Scholar
- CASE72 CASEY, R.G. "Allocation of copies of a file m an information network," Proc AFIPS 1972 Sprig Jr. Computer Conf., vol. 40, AFIPS Press, Arlington, Va., pp. 617-625.Google Scholar
- CASE73 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.Google Scholar
- CHAN76 CHANDY, K. M., AND HEWES, J.E. "Fde allocation in distributed systems," in Proc. Int. Syrup on Computer Performance Modelmg, Measurement, and Evaluation (Cambridge, Mass, March 1976), pp. 10-13. Google Scholar
- CHAN78 CHACO, S. K., AND LIU, C.N. "Modeling and design of distributed information systems," in Advances ~n Information Systems Science, vol. 7, 1978, pp. 157-231.Google Scholar
- CHEN73a CHE~, P. P -S "Optimal f'de allocation in multilevel storage systems," in Proc. AFIPS 1973 Nat. Computer Conf., vol. 42, AFIPS Press, Arlington, Va., pp. 277-282.Google Scholar
- CHEN73b CHE~, 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).Google Scholar
- CHEN80 CHEW, P. P.-S., AND AKOKA, J. "Optimal design of distributed information systems IEEE Trans. Comput. C-29, 12 (Dec. 1980), 1068-1080.Google Scholar
- CHU73 CHU, W.W. "Optimal file allocation in a computer network," in Computer-Communicatwn Systems, N Abramson and F. F. Kuo, Eds., Prentice-Hall, Englewood Chffs, N. J., 1973, pp. 82-94.Google Scholar
- CHU76 CHV, 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, Arhngton, Va., pp. 577-587.Google Scholar
- CHU80 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.Google ScholarDigital Library
- COFF80 COFFMAN, E. G., JR., GELENBE, E., AND WOOD, R.C. "Optimal replication of parallelread, sequential-write systems," Performance Evaluatwn Rev. (Summer 1980), 209-216. Google ScholarDigital Library
- DOWD77 DOWDY, L. W. Optimal branching probabdities and their relationship to computer network file dtstrlbutwn, Ph.D Dissertation, Dep Computer Science, Duke Umv., Durham, N. C, 1977. Google Scholar
- DOWD80 DowDY, L. W., AND McGINNIS, R. "Fde placement using predictive queuing models," Tech. Rep. TR-924, Univ of Maryland, College Park, August, 1980.Google Scholar
- ESWA74 ESWARaN, K. P. "Placement of records in a file and file allocation m a computer network," m Proc. IFIPS Conference (Stockholm, Sweden, Aug. 1974), pp. 304-307.Google Scholar
- FISH78 FISHER, M L, AND HOCHBAUM, D S. "Data base location in computer networks," Declswn Sciences Working Paper 78-10-09, Dep. Declswn Science, Umv. of Pennsylvania, Phdadelphia, Oct 1978.Google Scholar
- FOST76 FostER, D. V., AND BROWNE, j C "Fde assignment in memory hierarchies," in Proc Modeling and Performance Evaluation of Computer Systems, Oct. 1976, Beilner and Gelenber, Eds., North-Holland Publ., Amsterdam, 1976, pp. 119-127. Google Scholar
- FOST81 FOSTER, D. V., DOWDY, L. W., AND AMr~S, J. E. "File assignment in a computer network," Comput. Networks 5 (Sept. 1981), 341-349.Google Scholar
- HADL63 HADLEY, G. Linear Programming. Addison-Wesley, Readmg, Mass., 1963.Google Scholar
- HUGH73 HUaHES, P. H., AND MOE, G. "A structural approach to computer performance analysis,'' m Proc AFIPS 1973 Spring Jt. Computer Conf., AFIPS Press, Arlington, Va, pp 109-120.Google Scholar
- JONE78 JONF. S, L. G., FOST~.R, D. V., AND KROLAK, P.D. "A goal programming formulatwn used m the file assignment problem," in Proc. R. J. Duffin Conf. (Pittsburgh, Pa., July 1978).Google Scholar
- JONE79a joNEs, L. G., AND FOSTER, D.V. "A heuristic solution to the file assignment problem," m Proc. Southeastcon. (Roanoke, Va., Apr. 1979).Google Scholar
- JONE79b JoNEs, L G., AND FOSTF. R, D.V. "Toward a multiple copy ~de assignment model for files in a computer system," Proc. 17th Annu Southeast Regwnal ACM Conf (Orlando, Fla., Apr 1979). Google Scholar
- KLEI76 KLEINROCK, L. Queuing Systems--Volume 2: Computer Applicatwns, Wiley, New York, 1976Google Scholar
- LAND74 LANDWEHR, C E. "Load sharing in computer networks: a queuing model," in Merit Computer Network Publication MCN-1174-TR-18, Umv. of Michigan, Ann Arbor, Nov. 1974.Google Scholar
- LEVI74 LEVIN, K.D. "Organizing distributed data bases in computer networks," Ph.D. chssertat~on, Dep. Decision Science, Umv. of Pennsylvania, Philadelphia, 1974. Google Scholar
- LEVI75 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.Google Scholar
- LOOM76 Loo~Is, M. S, AND POPEK, G.J. "A model for data base distribution," Trends and Apphcatwns: Computer Networks, 1976.Google Scholar
- MAHM76 MAHMOUD, $., AND RIORDON, J. S. "Optimal allocation of resources m distributed reformation networks," ACM Trans. Database Syst. 1, I (March 1976), 66-78 Google ScholarDigital Library
- MEND79 MENDELSON, H, PLISKIN, J. 8., AND YECHIALI, U. Optimal storage allocatwn for serial files. Comrnun. ACM 22, 2 (Feb. 1979), 124-130 Google Scholar
- MORG77 MORGAN, H. L AND LEVIN, K D. "Opt~nal program and data locations m computer networks," Commun. ACM 20, 5 (May 1977), 315-322. Google ScholarDigital Library
- PIEP75 PmPMEIF. R, W.F. "Opttmal balancing of I/O requests to disks," Commun. ACM 18, 9 (Sept. 1975), 524-527. Google Scholar
- PRIC74 PRICE, T. G. "Probabfiity models of multiprogrammed computer systems," Ph.D. Dissertation, Dep. Electrical Engineering, Stanford Umv, Stanford, Calif, 1974. Google Scholar
- PRIC78 PratE, P. L., AND SMITH, D W "Analysis and use of an integer programming model for optimally allocating fries in a multiple computing system," Rep. DTNSRDC 78/102, Dawd Taylor Naval Ship Research and Development Center, Bethesda, Md., Nov 1978Google Scholar
- RAMA70 RAMAMOORTHY, C V., AND CHANDY, K.M. "Optimtzation of memory hierarchies in multiprogrammed systems," J. ACM 17, 3 (July 1970), 426-445 Google ScholarDigital Library
- ROSE73 RosE, L. L., ANo GOTrERER, M. H. "A theory of dynamic file management in a multdevel store." Int. J Comput. Inf. Sc~ 2, 4 (Dec. 1973), 249-256.Google Scholar
- ROSE75a RosE, L. L., ANO GovrF.}tER, M.H. "An analysis of fde movement under dynamic file management strategaes," BIT 15, 3 (1975), 304-313.Google Scholar
- ROSE75b Ros~, L. L, AND GovrERER, M. H "File evaluation in auxiliary storage," Int. J Comput. Inf. Sci. 4, 3 (Sept 1975), 197-204.Google Scholar
- ROTH77 ROTHNIE, J. B, ANO GOOOMAN, N. A. "A survey of research and development in distributed database management," in Proc. Conf. Very Large Database Systems (Tokyo, Japan, Oct. 1977), pp. 48-62.Google Scholar
- SMIT81a SMI?H, A. J "Long-term file migration, development and evaluation of algorithms," Commun. ACM 24, 8 (Aug. 81), 521-532 Google Scholar
- SMIT81b SMI?H, A.J. "Algorithms and architectures for enhanced fde system use," in Experimental Computer Performance and Evaluatwn, D. Ferrari and M. Spadoni, Eds., North- Holland Publ., Amsterdam and New York, 1981, pp. 165-193.Google Scholar
- STRI77 SrR~?rF.R, E.P. File migration. Computer Science Rep. STAN-CS-77-594, Dep Computer Science, Stanford Univ., Stanford, Calif., Jan. 1977.Google Scholar
- SURI78 SURI, R. Resource management in large systems," Ph.D. Dissertation, Dep. Engineering, Harvard Univ., Cambridge, Mass., july 1978.Google Scholar
- TRIV78 TRIVEDI, K. S., AND KINICKI, R. E "A mathematical model for computer system configuration planning," m Proc int. Conf. Performance of Computer Installations (Italy, June 1978).Google Scholar
- TRIV79 TRIVEDI, K S, WAGNER, R. A., AND SIGMON, T.M. "Optimal selection of cpu speed, device capacities, and file assignments," J. ACM 27, 3 (July 1950), 457-473. Google Scholar
- TRIV82 TRIVEOI, K S., A~I) GF.m?, R.M. "Optunal design of storage hierarchies" (to appear in IEEE Trans. Computers).Google Scholar
- WHIT70 WHITNEY, V. K M "A study of optnnal file assignment and communication network configuratwn," Ph.D. Dtssertation, Dep. Electrical Engineering, Univ. of Michigan, Ann Arbor, Sept 1970.Google Scholar
Index Terms
- Comparative Models of the File Assignment Problem
Recommendations
A prediction-based dynamic file assignment strategy for parallel file systems
An analysis model of file assignment and access are generalized.A load prediction model in parallel file systems is proposed.A prediction-based dynamic file assignment strategy (PDFA) is proposed.We evaluate the effectiveness of the proposed algorithms. ...
A file assignment strategy independent of workload characteristic assumptions
The problem of statically assigning nonpartitioned files in a parallel I/O system has been extensively investigated. A basic workload characteristic assumption of most existing solutions to the problem is that there exists a strong inverse correlation ...
Comments