article

Free access

Comparative Models of the File Assignment Problem

Authors:

Lawrence W. Dowdy,

Derrell V. FosterAuthors Info & Claims

ACM Computing Surveys (CSUR), Volume 14, Issue 2

Pages 287 - 313

https://doi.org/10.1145/356876.356883

Published: 01 June 1982 Publication History

PDF eReader

References

[1]

AMES, J.E. "Dynamic ~de allocation in a distributed database system," Ph.D. Dissertation, Dep Computer Science, Duke Univ., Durham, N. C., 1977.

Crossref

Google Scholar

[2]

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

[3]

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

[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.

Digital Library

Google Scholar

[5]

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

[6]

BuzEN, J.P. "Queueing network models of multiprogramming," Ph.D. Dissertation, Div. Engineering and Applied Physics, Harvard Univ., Cambridge, Mass., 1971.

Google Scholar

[7]

Bvzr~, J. P., AND CnEN, P P -S. "Optnnal load balancing in memory hierarchies," in Proc. IFIP, North-Holland Publ., Amsterdam, 1974.

Google Scholar

[8]

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

[9]

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

[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.

Google Scholar

[11]

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.

Crossref

Google Scholar

[12]

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

[13]

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

[14]

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

[15]

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

[16]

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

[17]

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

[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.

Digital Library

Google Scholar

[19]

COFFMAN, E. G., JR., GELENBE, E., AND WOOD, R.C. "Optimal replication of parallelread, sequential-write systems," Performance Evaluatwn Rev. (Summer 1980), 209-216.

Digital Library

Google Scholar

[20]

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.

Crossref

Google Scholar

[21]

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

[22]

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

[23]

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

[24]

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.

Crossref

Google Scholar

[25]

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

[26]

HADLEY, G. Linear Programming. Addison-Wesley, Readmg, Mass., 1963.

Google Scholar

[27]

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

[28]

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

[29]

joNEs, L. G., AND FOSTER, D.V. "A heuristic solution to the file assignment problem," m Proc. Southeastcon. (Roanoke, Va., Apr. 1979).

Google Scholar

[30]

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).

Crossref

Google Scholar

[31]

KLEINROCK, L. Queuing Systems--Volume 2: Computer Applicatwns, Wiley, New York, 1976

Google Scholar

[32]

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

[33]

LEVIN, K.D. "Organizing distributed data bases in computer networks," Ph.D. chssertat~on, Dep. Decision Science, Umv. of Pennsylvania, Philadelphia, 1974.

Crossref

Google Scholar

[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.

Google Scholar

[35]

Loo~Is, M. S, AND POPEK, G.J. "A model for data base distribution," Trends and Apphcatwns: Computer Networks, 1976.

Google Scholar

[36]

MAHMOUD, $., AND RIORDON, J. S. "Optimal allocation of resources m distributed reformation networks," ACM Trans. Database Syst. 1, I (March 1976), 66-78

Digital Library

Google Scholar

[37]

MENDELSON, H, PLISKIN, J. 8., AND YECHIALI, U. Optimal storage allocatwn for serial files. Comrnun. ACM 22, 2 (Feb. 1979), 124-130

Crossref

Google Scholar

[38]

MORGAN, H. L AND LEVIN, K D. "Opt~nal program and data locations m computer networks," Commun. ACM 20, 5 (May 1977), 315-322.

Digital Library

Google Scholar

[39]

PmPMEIF. R, W.F. "Opttmal balancing of I/O requests to disks," Commun. ACM 18, 9 (Sept. 1975), 524-527.

Crossref

Google Scholar

[40]

PRICE, T. G. "Probabfiity models of multiprogrammed computer systems," Ph.D. Dissertation, Dep. Electrical Engineering, Stanford Umv, Stanford, Calif, 1974.

Crossref

Google Scholar

[41]

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 1978

Google Scholar

[42]

RAMAMOORTHY, C V., AND CHANDY, K.M. "Optimtzation of memory hierarchies in multiprogrammed systems," J. ACM 17, 3 (July 1970), 426-445

Digital Library

Google Scholar

[43]

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

[44]

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

[45]

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

[46]

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

[47]

SMI?H, A. J "Long-term file migration, development and evaluation of algorithms," Commun. ACM 24, 8 (Aug. 81), 521-532

Crossref

Google Scholar

[48]

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

[49]

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

[50]

SURI, R. Resource management in large systems," Ph.D. Dissertation, Dep. Engineering, Harvard Univ., Cambridge, Mass., july 1978.

Google Scholar

[51]

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

[52]

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.

Crossref

Google Scholar

[53]

TRIVEOI, K S., A~I) GF.m?, R.M. "Optunal design of storage hierarchies" (to appear in IEEE Trans. Computers).

Google Scholar

[54]

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

Cited By

View all

Michos SDiamantoulakis PGeorgiadis LKaragiannidis G(2023)On the Computational Aspect of Coded Caching With Uncoded PrefetchingIEEE Transactions on Information Theory10.1109/TIT.2022.319803169:3(1486-1508)Online publication date: 1-Mar-2023
https://dl.acm.org/doi/10.1109/TIT.2022.3198031
Xiong XHan XLiu ZWang H(2023)Exhaustiveness Does Not Necessarily Mean Better: Selective Task Planning for Multi-robot Systems2023 IEEE International Conference on Robotics and Biomimetics (ROBIO)10.1109/ROBIO58561.2023.10354992(1-6)Online publication date: 4-Dec-2023
https://doi.org/10.1109/ROBIO58561.2023.10354992
Renz-Wieland AGemulla RKaoudi ZMarkl VIves ZBonifati AEl Abbadi A(2022)NuPS: A Parameter Server for Machine Learning with Non-Uniform Parameter AccessProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3517860(481-495)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3517860
Show More Cited By

Index Terms

Comparative Models of the File Assignment Problem
1. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        File systems management

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. ...
The zebra striped network file system
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

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM Computing Surveys Volume 14, Issue 2

June 1982

168 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/356876

Editor:
Adele Goldberg

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1982

Published in CSUR Volume 14, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

408
Total Citations
View Citations
1,934
Total Downloads

Downloads (Last 12 months)174
Downloads (Last 6 weeks)12

Reflects downloads up to 16 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Michos SDiamantoulakis PGeorgiadis LKaragiannidis G(2023)On the Computational Aspect of Coded Caching With Uncoded PrefetchingIEEE Transactions on Information Theory10.1109/TIT.2022.319803169:3(1486-1508)Online publication date: 1-Mar-2023
https://dl.acm.org/doi/10.1109/TIT.2022.3198031
Xiong XHan XLiu ZWang H(2023)Exhaustiveness Does Not Necessarily Mean Better: Selective Task Planning for Multi-robot Systems2023 IEEE International Conference on Robotics and Biomimetics (ROBIO)10.1109/ROBIO58561.2023.10354992(1-6)Online publication date: 4-Dec-2023
https://doi.org/10.1109/ROBIO58561.2023.10354992
Renz-Wieland AGemulla RKaoudi ZMarkl VIves ZBonifati AEl Abbadi A(2022)NuPS: A Parameter Server for Machine Learning with Non-Uniform Parameter AccessProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3517860(481-495)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3517860
(2022)BibliographyStorage Systems10.1016/B978-0-32-390796-5.00023-1(641-693)Online publication date: 2022
https://doi.org/10.1016/B978-0-32-390796-5.00023-1
Thomasian A(2022)Database parallelism, big data and analytics, deep learningStorage Systems10.1016/B978-0-32-390796-5.00017-6(385-491)Online publication date: 2022
https://doi.org/10.1016/B978-0-32-390796-5.00017-6
Nafea MYener A(2021)Coded Caching in the Presence of a Wire and a Cache Tapping Adversary of Type IIIEEE Journal on Selected Areas in Information Theory10.1109/JSAIT.2021.30546632:1(65-81)Online publication date: Mar-2021
https://doi.org/10.1109/JSAIT.2021.3054663
Dongjie ZHaiwen DYundong SZhaoshuo TNing C(2021)A data grouping model based on cache transaction for unstructured data storage systemsInternational Journal of Intelligent Systems10.1002/int.2272837:8(4488-4514)Online publication date: 3-Nov-2021
https://doi.org/10.1002/int.22728
Choudhary SJha C(2020)Task Allocation in Distributed Real Time Database Systems in IoT4th International Conference on Internet of Things and Connected Technologies (ICIoTCT), 201910.1007/978-3-030-39875-0_6(54-68)Online publication date: 15-Feb-2020
https://doi.org/10.1007/978-3-030-39875-0_6
Zewail AYener A(2019)Device-to-Device Secure Coded CachingIEEE Transactions on Information Forensics and Security10.1109/TIFS.2019.294088515(1513-1524)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1109/TIFS.2019.2940885
Yapar CWan KSchaefer RCaire G(2019)On the Optimality of D2D Coded Caching With Uncoded Cache Placement and One-Shot DeliveryIEEE Transactions on Communications10.1109/TCOMM.2019.294067167:12(8179-8192)Online publication date: Dec-2019
https://doi.org/10.1109/TCOMM.2019.2940671
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

A prediction-based dynamic file assignment strategy for parallel file systems

The zebra striped network file system

A file assignment strategy independent of workload characteristic assumptions

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations