{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:11:43Z","timestamp":1725455503720},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620488"},{"type":"electronic","value":"9783540496335"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0009512","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:32:17Z","timestamp":1129818737000},"page":"356-365","source":"Crossref","is-referenced-by-count":2,"title":["Competitive analysis of on-line disk scheduling"],"prefix":"10.1007","author":[{"given":"Tzuoo-Hawn","family":"Yeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Ming","family":"Kuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Laung","family":"Lei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,11]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/BF01994839","volume":"32","author":"T. Chen","year":"1992","unstructured":"T. Chen, W. Yang, and R. Lee. Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and n-step SCAN. BIT, 32:546\u2013558, 1992.","journal-title":"BIT"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1137\/0220008","volume":"20","author":"M. Chrobak","year":"1991","unstructured":"M. Chrobak and L. Larmore. An optimal on-line algorithm for k-servers on trees. SIAM Journal on Computing, 20:144\u2013148, 1991.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"37_CR3","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/0211005","volume":"11","author":"E. Coffman Jr.","year":"1982","unstructured":"E. Coffman, Jr. and M. Hofri. On the expected performance of scanning disks. SIAM Journal on Computing, 11(1):60\u201370, February 1982.","journal-title":"SIAM Journal on Computing"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"A. Fiat, D. Foster, H. Karloff, Y. Rabani, Y. Ravid, and N. E. Young. Competitive paging algorithms. Journal of Algorithms, 12:685\u2013699, 1991.","journal-title":"Journal of Algorithms"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/S0022-0000(05)80060-1","volume":"48","author":"A. Fiat","year":"1994","unstructured":"A. Fiat, Y. Rabani, and Y. Ravid. Competitive k-server algorithms. J. Computer and System Sciences, 48:410\u2013428, 1994.","journal-title":"J. Computer and System Sciences"},{"issue":"1","key":"37_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7351.8929","volume":"5","author":"R. Geist","year":"1987","unstructured":"R. Geist and S. Daniel. A continuum of disk scheduling algorithms. ACM Transactions on Computer Systems, 5(1):77\u201392, February 1987.","journal-title":"ACM Transactions on Computer Systems"},{"issue":"11","key":"37_CR7","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1145\/359024.359034","volume":"23","author":"M. Hofri","year":"1980","unstructured":"M. Hofri. Disk scheduling: FCFS vs. SSTF revisited. Comm. of the ACM, 23(11):645\u2013653, November 1980.","journal-title":"Comm. of the ACM"},{"unstructured":"M. Seltze, P. Chen, and J. Ousterhout. Disk scheduling revisited. In USENIX Technique Conference, 1990.","key":"37_CR8"},{"unstructured":"A. Silberschatz, J. Peterson, and P. Galvin. Operating System Concepts. Addison Wesley, third edition, 1991.","key":"37_CR9"},{"issue":"2","key":"37_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Comm. of the ACM, 28(2):202\u2013208, February 1985.","journal-title":"Comm. of the ACM"},{"issue":"3","key":"37_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/361268.361278","volume":"15","author":"T. Teorey","year":"1972","unstructured":"T. Teorey and T. Pinkerton. A comparative analysis of disk scheduling policies. Comm. of the ACM, 15(3):177\u2013184, March 1972.","journal-title":"Comm. of the ACM"},{"issue":"1","key":"37_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/359970.359977","volume":"19","author":"N. Wilhelm","year":"1976","unstructured":"N. Wilhelm. An anomaly in disk scheduling: a comparison of FCFS and SSTF seek scheduling using an empirical model for disk accesses. Comm. of the ACM, 19(1):13\u201317, January 1976.","journal-title":"Comm. of the ACM"},{"doi-asserted-by":"crossref","unstructured":"T. Yeh, C. Kuo, C. Lei, and H. Yen. Competitive analysis of on-line disk scheduling. Technical report, Dept. of Electircal Engineering, National Taiwan University, 1995.","key":"37_CR13","DOI":"10.1007\/BFb0009512"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0009512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T11:12:58Z","timestamp":1586517178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0009512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620488","9783540496335"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0009512","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}