Data allocation on disks with solution reconfiguration (problems, heuristics)

TL;DR

This paper explores data allocation in two-layer storage systems with dynamic task dependencies, proposing heuristic-based reconfiguration models to optimize data placement and reduce restructuring costs.

Contribution

It introduces one-stage and multistage reconfiguration models for data allocation, applying simplified heuristics to address dynamic storage and task dependencies.

Findings

Heuristic methods effectively solve data reallocation problems.

Reconfiguration models improve storage efficiency.

Numerical examples demonstrate practical applicability.

Abstract

The paper addresses problem of data allocation in two-layer computer storage while taking into account dynamic digraph(s) over computing tasks. The basic version of data file allocation on parallel hard magnetic disks is considered as special bin packing model. Two problems of the allocation solution reconfiguration (restructuring) are suggested: (i) one-stage restructuring model, (ii) multistage restructuring models. Solving schemes are based on simplified heuristics. Numerical examples illustrate problems and solving schemes.