{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:20:03Z","timestamp":1742397603301},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1007\/bf01994839","type":"journal-article","created":{"date-parts":[[2005,8,11]],"date-time":"2005-08-11T03:32:06Z","timestamp":1123731126000},"page":"546-558","source":"Crossref","is-referenced-by-count":19,"title":["Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, andN-StepSCAN"],"prefix":"10.1007","volume":"32","author":[{"given":"Tung-Shou","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Pang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. C. T.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"BF01994839_CR1","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/3341.3349","volume":"28","author":"J. L. Bentley","year":"1985","unstructured":"J. L. Bentley and C. C. McGeoch,Amortized analyses of self-organizing sequential heuristics, Comm. ACM 28, No. 4 (1985), pp. 404\u2013411.","journal-title":"Comm. ACM"},{"key":"BF01994839_CR2","unstructured":"T. S. Chen, W. P. Yang and R. C. T. Lee,Amortized analyses of disk scheduling algorithms: SSTF and SCAN, Proc. of National Computer Symposium, Taiwan, R.O.C., (1989), pp. 831\u2013836."},{"key":"BF01994839_CR3","first-page":"1277","volume-title":"Proc. of International Conference on Information and Systems","author":"T. S. Chen","year":"1991","unstructured":"T. S. Chen and W. P. Yang,Amortized analysis for a continuum of disk scheduling V(R), Proc. of International Conference on Information and Systems, AMSE, Hangzhou, China, (1991), pp. 1277\u20131280."},{"key":"BF01994839_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1137\/0201018","volume":"1","author":"E. G. Coffman","year":"1972","unstructured":"E. G. Coffman, L. A. Klimko and B. Ryan,Analysis of scanning policies for reducing disc seek times, SIAM Journal on Computing, 1, (1972), pp. 269\u2013279.","journal-title":"SIAM Journal on Computing"},{"key":"BF01994839_CR5","volume-title":"Operating Systems","author":"H. M. Deitel","year":"1990","unstructured":"H. M. Deitel,Operating Systems (Second Edition), Addison-Wesley Publishing Co. Reading Mass., (1990).","edition":"Second Edition"},{"key":"BF01994839_CR6","first-page":"9","volume-title":"Effects of scheduling on file memory operations","author":"P. J. Denning","year":"1967","unstructured":"P. J. Denning,Effects of scheduling on file memory operations, Proc. AFIPS, Montvale, N.J., (1967), pp. 9\u201321."},{"key":"BF01994839_CR7","doi-asserted-by":"crossref","unstructured":"M. L. Fredman, R. Sedgewick, D. D. Sleator and R. E. Tarjan,The pairing heap: a new form of self-adjusting heap, Algorithmica No. 1 (1986), pp. 111\u2013129.","DOI":"10.1007\/BF01840439"},{"issue":"4","key":"BF01994839_CR8","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1145\/321541.321550","volume":"16","author":"H. Frank","year":"1969","unstructured":"H. Frank,Analysis and optimization of disk storage devices for time sharing systems, J. ACM 16, No. 4 (1969), pp. 602\u2013620.","journal-title":"J. ACM"},{"issue":"1","key":"BF01994839_CR9","doi-asserted-by":"crossref","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 Trans. Computer Syst. 5, No. 1 (1987), pp. 77\u201392.","journal-title":"ACM Trans. Computer Syst."},{"key":"BF01994839_CR10","doi-asserted-by":"crossref","unstructured":"E. F. Grove,The harmonic online k-server algorithm is competitive, In Proc. 23rd ACM Symposium on Theory of Computing, (1991), pp. 260\u2013266.","DOI":"10.1145\/103418.103448"},{"issue":"11","key":"BF01994839_CR11","doi-asserted-by":"crossref","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. ACM 23, No. 11 (1980), pp. 645\u2013653.","journal-title":"Comm. ACM"},{"key":"BF01994839_CR12","unstructured":"R. C. T. Lee, R. C. Chang and S. S. Tseng,Introduction to the Design and Analysis of Algorithms, Prentice Hall, (1989)."},{"key":"BF01994839_CR13","doi-asserted-by":"crossref","unstructured":"M. Manasse, L. A. McGeoch and D. D. Sleator,Competitive algorithms for on-line problems, In Proc. 20th Annual ACM Symposium on Theory of Computing, (1988), pp. 322\u2013333.","DOI":"10.1145\/62212.62243"},{"key":"BF01994839_CR14","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M. Manasse","year":"1990","unstructured":"M. Manasse, L. A. McGeoch and D. D. Sleator,Competitive algorithms for server problems, Journal of Algorithms, 11 (1990), pp. 208\u2013230.","journal-title":"Journal of Algorithms"},{"key":"BF01994839_CR15","volume-title":"Algorithms from P to NP, Volume I: Design and Efficiency","author":"B. M. E. Moret","year":"1991","unstructured":"B. M. E. Moret and H. D. Shapior,Algorithms from P to NP, Volume I: Design and Efficiency, The Benjamin\/Cummings Publishing Company, Inc. Redwood City, CA 94065 (1991)."},{"key":"BF01994839_CR16","unstructured":"P. W. Purdom, Jr. and C. A. Brown,The Analysis of Algorithms, CBS College Publishing, (1985)."},{"key":"BF01994839_CR17","first-page":"263","volume-title":"Operating System Concepts","author":"A. Silberschatz","year":"1988","unstructured":"A. Silberschatz and J. L. Peterson,Operating System Concepts, Addison-Wesley Publishing, Reading Mass., (1988), pp. 263."},{"issue":"3","key":"BF01994839_CR18","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. D. Sleator","year":"1985","unstructured":"D. D. Sleator and R. E. Tarjan,Self-adjusting binary search trees, J. Assoc. Comput. Mach. 32, No. 3 (1985), pp. 652\u2013686.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"BF01994839_CR19","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/0215004","volume":"15","author":"D. D. Sleator","year":"1986","unstructured":"D. D. Sleator and R. E. Tarjan,Self-adjusting heaps, SIAM J. Comput. 15, No. 1 (1986), pp. 52\u201369.","journal-title":"SIAM J. Comput."},{"key":"BF01994839_CR20","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data structure and network algorithms","author":"R. E. Tarjan","year":"1983","unstructured":"R. E. Tarjan,Data structure and network algorithms, Society for Industrial and Applied Mathematics, Philadelphia, Pa., (1983)."},{"issue":"2","key":"BF01994839_CR21","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan,Amortized computational complexity, SIAM J. Alg. Disc. Math. 6, No. 2 (1985), 306\u2013318.","journal-title":"SIAM J. Alg. Disc. Math."},{"issue":"3","key":"BF01994839_CR22","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/361268.361278","volume":"15","author":"T. J. Teorey","year":"1972","unstructured":"T. J. Teorey and T. B. Pinkerton,A comparative analysis of disk scheduling policies, Comm. ACM 15, No. 3 (1972), pp. 177\u2013194.","journal-title":"Comm. ACM"},{"issue":"1","key":"BF01994839_CR23","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/359970.359977","volume":"19","author":"N. C. Wilhelm","year":"1976","unstructured":"N. C. Wilhelm,An anomaly in disk scheduling: a comparison of FCFS and SSTF seek scheduling using an empirical model for disk accesses, Comm. ACM 19, No. 1 (1976), 13\u201317.","journal-title":"Comm. ACM"},{"key":"BF01994839_CR24","series-title":"Technical Report","volume-title":"The study of amortized complexity on disk system","author":"W. P. Yang","year":"1989","unstructured":"W. P. Yang and T. S. Chen,The study of amortized complexity on disk system, Technical Report, NSC79-0408-E009-01, National Chiao Tung University, Hsinchu, Taiwan, R.O.C., (1989)."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01994839.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01994839\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01994839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T21:56:31Z","timestamp":1557784591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01994839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["BF01994839"],"URL":"https:\/\/doi.org\/10.1007\/bf01994839","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}