Disk scheduling at compile time | Zendy

Hansen Per Brinch | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Disk scheduling at compile time

Author(s) -

Hansen Per Brinch

Publication year - 1976

Publication title -

software: practice and experience

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.437

H-Index - 70

eISSN - 1097-024X

pISSN - 0038-0644

DOI - 10.1002/spe.4380060205

Subject(s) - computer science , scheduling (production processes) , compiler , simple (philosophy) , parallel computing , operating system , mathematical optimization , mathematics , philosophy , epistemology

This paper describes a simple algorithm* for allocating program files on a disk with a moving head. The algorithm tries to place a file on consecutive pages (but will scatter them somewhat if necessary). It then rearranges these pages to minimize the rotational delay during a sequential scan of the file. This method combines the best features of consecutive and non‐consecutive allocation: fast sequential access and fast allocation. It is used in the Solo operating system to reduce program loading time by a factor of 3.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research