Abstract
AbstractWe address the problem of I/O scheduling of read-once reference strings in a multiple-disk parallel I/O system. We present a novel on-line algorithm, Red-Black Prefetching (RBP), for parallel I/O scheduling. In order to perform accurate prefetching RBP uses L-block lookahead. The performance of RBP is analyzed in the standard parallel disk model with D independent disks and a shared I/O buffer of size M. We show that the number of parallel I/Os performed by RBP is within a factot \(\Theta(\max \{\sqrt{MD/L}, D^{1/3}\})\) of the number of I/Os done by the optimal off-line algorithm. This ratio is within a canstant factor of the best possible when L is L=O(MD 1/3).KeywordsSchedule AlgorithmCompetitive RatioSingle DiskParallel DiskReference StringThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
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.
