2016/12/14 by Mark Sh. Levin, Levin, Mark Sh.
Computer Science · Engineering · Mathematics · #68T20 #90B50 #93A13 #93B51 #Advanced Data Storage Technologies #C.1.4 #Distributed #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #FOS: Mathematics #I.2.8 #J.6 #Optimization and Control (math.OC) #Optimization and Packing Problems #Parallel #acm:68T20 #acm:90B50 #acm:93A13 #acm:93B51 #and Cluster Computing (cs.DC) #cs.DC #math.OC #msc:68T20 #msc:90B50 #msc:93A13 #msc:93B51
paper · pdf · doi:10.48550/arxiv.1612.04519
10 pages, 9 figures, 9 tables
openalex publication_date 2016/12/14 · arxiv created 2016/12/18 · arxiv updated 2016/12/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.