Dynamic file allocation in disk arrays
Dynamic file allocation in disk arrays
复制标题
磁盘阵列中的动态文件分配
DOI：
--
复制
发表时间：
1991
期刊：
影响因子：
--
通讯作者：
P. Scheuermann
中科院分区：
文献类型：
--
作者：
G. Weikum;P. Zabback;P. Scheuermann
小型磁盘的大型阵列被认为是实现高性能1/0架构的一种有前途的方法。在本文中，我们处理的问题，在这样的磁盘阵列的数据放置。流行的方法是在多个磁盘上对大文件进行解集群，以便最大限度地减少对文件的访问时间并在磁盘上平衡1/0负载。数据放置问题需要确定磁盘的数量和文件分散在哪个磁盘上。与以前的工作不同，本文没有假设所有文件都同时分配，而是考虑动态文件创建，这使得放置问题变得更加困难，因为每个放置决策都必须考虑当前的分配状态以及磁盘和现有文件的访问频率。因此，文件创建可能涉及一个或多个磁盘上的部分重组。本文提出了启发式算法的动态创建的文件的位置。该算法在最大化磁盘阵列的1/0性能和最小化在部分重组中投入的工作之间提供了一个很好的折衷。本文提出了初步的性能测试结果的各种替代算法下的合成工作量。
Large arrays of small disks are being considered as a promising approach to high performance 1/0 architectures. In this paper we deal with the problem of data placement in such a disk array. The prevalent approach is to decluster large files across a number of disks so as to minimize the access time to a file and balance the 1/0 load across the disks. The data placement problem entails determining the number of disks and the set of disks across which a file is declustered. Unlike previous work, this paper does not assume that all files are allocated at the same time but rather considers dynamic file creations, This makes the placement problem considerably harder because each placement decision has to take into account the current allocation state and the access frequencies of the disks and the existing files. As a result, file creation may involve partial reorganization on one or more disks. The paper proposes heuristic algorithms for the placement of dynamically created files. The algorithms provide a good compromise between maximizing 1/0 performance of the disk array and minimizing the work invested in partial reorganizations. The paper presents preliminary performance results of various alternative algorithms under a synthetic workload.