Abstract

There has been considerable research concerning the use of arrays of disks in solving I/O bottleneck problems, where high availability of data is achieved through some form of data redundancy, e.g. mirroring. This paper investigates the degree to which a dynamic load balancing disk scheduling algorithm in conjunction with chained declustering, an alternative to the classical mirroring scheme, can respond robustly to variations in workload and disk failures. Specifically, it defines and investigates the behavior of two dynamic scheduling algorithms under various workload distributions and disk failure. It demonstrates that using a simple dynamic scheduling algorithm can greatly improved the average response time compared with static load balancing. >

Full Text
Paper version not known

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 call

Disclaimer: 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.