An algorithm for storage device selection and file assignment

DOI10.1016/0377-2217(92)90362-DMaRDI QIDQ1194722zbMATH OpenOpenAlexFDO

Authors Bernard T. Han, George Diehr

Publication date 6 October 1992

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(92)90362-d

zbMATH Keywords

device selectionfile assignmenthybrid storage systeminteger programmingoptimizationstorage systems

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Dynamic programming (90C39) Applications of mathematical programming (90C90)

Cites work

• A branch and bound algorithm for the generalized assignment problem
• A practical guide to the design of differential files for recovery of on-line databases
• Discrete-variable extremum problems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Optimal Policies for Data Base Reorganization
• Optimal reorganization of distributed space disk files

Cited in

(2)

• Multiple-type, two-dimensional bin packing problems: Applications and algorithms
• An archiving model for a hierarchical information storage environment

This page was built for publication: An algorithm for storage device selection and file assignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1194722)