An analysis of file movement under Dynamic File Management strategies

This paper addresses the data file movement inherent in Dynamic File Management (DFM) strategies. The goal of this data movement is to enhance the throughput of a computer system with a many level store by keeping the most active data near the top of the store. This paper does not address the criteria for file movement; rather the manner of file movement. The two DFM move primitivesT andP are defined functionally. This is followed by a careful analysis of the hole selection strategies employed to find valid destinations for the two DFM move primitives. Some additional DFM enhancements are clarified for better understanding of the DFM strategies. It is shown that the DFM move primitives are sufficient to implement a DFM. Simulation results verify the utility of DFM strategies.