Abstract
Redundant arrays of independent disks (RAID) remain the mass storage medium of choice for real-time processing and information storage and retrieval. This paper proposes new adaptive pre-fetching algorithms for RAID systems using “life-time function analysis of programs”. The life-time function approach allows us to derive an inequality which allows us to determine when pre-fetching can be effective. This inequality relates the changes in disk transfer times to the changes in inter-page fault times with the ratio of disk transfer time to page fault time. We then use this inequality to design and adaptive pre-fetching strategies, and to propose a practical implementation. Simulation experiments to evaluate the effectiveness of the proposed approach are carried out. The analytical approach based on a single process execution model is extended to a multiprogramming environment using a queuing network model, as well as to a simpler approach using a “parallel processing” approximation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
