作者: Richard F. Lary , David W. Thiel , James M. Reuter
DOI:
关键词: Block (data storage) 、 Distributed computing 、 Computer science 、 Computational science 、 Movement (music) 、 Table (database) 、 Virtual storage 、 Hierarchy (mathematics) 、 Normal case
摘要: The present invention provides a virtual storage system that generally stores uses larger segmentations, but divides large segments into smaller sub-segments during data movement operations. method and having this hierarchy of segment sizes, namely for the normal case, while breaking single disk blocks movement. mapping has except those undergoing For segments, it would be desirable to have smallest size possible, namely, block. In way, administration costs are low, latencies caused by avoided.