{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:43:06Z","timestamp":1787341386108,"version":"build-2736575974"},"reference-count":4,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1972,9]]},"abstract":"<jats:p>A number of recent studies have examined techniques for sequencing disk accesses to minimize or reduce seek times. The principal methods proposed have been called scanning policies. In this paper we formulate and analyze simple mathematical models of head motion in disk systems in which two different scanning policies are implemented. Expressions for response times are derived, and the properties they imply are discussed.<\/jats:p>","DOI":"10.1137\/0201018","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T05:53:01Z","timestamp":1109224381000},"page":"269-279","source":"Crossref","is-referenced-by-count":34,"title":["Analysis of Scanning Policies for Reducing Disk Seek Times"],"prefix":"10.1137","volume":"1","author":[{"given":"E. G.","family":"Coffman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L. A.","family":"Klimko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Barbara","family":"Ryan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1145\/321495.321502"},{"key":"R2","unstructured":"P. J. Denning,  Effects of scheduling on file memory operations,  Proc. AFIPS SJCC, Vol. 30, Thompson Books, Inc., Washington, D. C.,  1966,  9\u201321"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1145\/321541.321550"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"T. J. Teorey, T. B. Pinkerton,  A Comparative Analysis of Disk Scheduling Policies,  Proc. 3rd Symposium on Operations Systems Principals, Digital Systems Lab., Stanford University, Stanford, Calif.,  1971,  114\u2013121","DOI":"10.1145\/800212.806509"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0201018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:16:20Z","timestamp":1787339780000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0201018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,9]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1972,9]]}},"alternative-id":["10.1137\/0201018"],"URL":"https:\/\/doi.org\/10.1137\/0201018","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1972,9]]}}}