{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:06Z","timestamp":1775282286119,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0167-8191(02)00092-3","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T23:55:37Z","timestamp":1034639737000},"page":"705-723","source":"Crossref","is-referenced-by-count":6,"title":["Reconciling simplicity and realism in parallel disk models"],"prefix":"10.1016","volume":"28","author":[{"given":"P.","family":"Sanders","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(02)00092-3_BIB1","series-title":"6th European Symposium on Algorithms","first-page":"417","article-title":"Analyzing an infinite parallel job allocation process","author":"Adler","year":"1998"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0020-0190(00)00115-0","article-title":"Random duplicate storage for load balancing in multimedia servers","volume":"76","author":"Aerts","year":"2000","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB3","unstructured":"J. Aerts, J. Korst, W. Verhaegh, Complexity of retrieval problems. Tech. Rep. NL-MS-20.899, Philips Research Laboratories, 2000"},{"issue":"9","key":"10.1016\/S0167-8191(02)00092-3_BIB4","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","article-title":"The input\/output complexity of sorting and related problems","volume":"31","author":"Aggarwal","year":"1988","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB5","doi-asserted-by":"crossref","unstructured":"M. Andrews, M.A. Bender, L. Zhang, New algorithms for the disk scheduling problem, in: FOCS, 1996, pp. 550\u2013558","DOI":"10.1109\/SFCS.1996.548514"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB6","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB7","series-title":"12th ACM Symposium on Parallel Algorithms and Architectures","first-page":"119","article-title":"Efficient, distributed data placement strategies for storage area networks","author":"Brinkmann","year":"2000"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB8","unstructured":"D.P. Dubhashi, A. Panconesi, Concentration of measure for computer scientists. Draft Manuscript, February 1998, Available from <http:\/\/www.dsi.uniroma1.it\/\u223cale\/papers\/master.ps>"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB9","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01396702","article-title":"Global optimization using interval analysis\u2013the multidimensional case","volume":"34","author":"Hansen","year":"1980","journal-title":"Numerische Mathematik"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB11","doi-asserted-by":"crossref","unstructured":"J. Korst, Random duplicate assignment: An alternative to striping in video servers, in: ACM Multimedia, Seattle, 1997, pp. 219\u2013226","DOI":"10.1145\/266180.266372"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB12","series-title":"International Conference on Parallel Processing","first-page":"393","article-title":"Fat trees: Universal networks for hardware efficient supercomputing","author":"Leiserson","year":"1985"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB13","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","article-title":"Approximation algorithms for scheduling unrelated parallel machines","volume":"46","author":"Lenstra","year":"1990","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB14","series-title":"Probabilistic Methods for Algorithmic Discrete Mathematics","first-page":"195","article-title":"Concentration","author":"McDiarmid","year":"1998"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB15","unstructured":"M. Mitzenmacher, The Power of Two Choices in Randomized Load Balancing, Ph.D. thesis, UC Berkeley, 1996"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB16","series-title":"Handbook of Randomized Computing","article-title":"The power of two random choices: A survey of the techniques and results","author":"Mitzenmacher","year":"2000"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/jctb.1996.0036","article-title":"Sudden emergence of a giant k-core in random graph","volume":"67","author":"Pittel","year":"1996","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB18","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","article-title":"Probabilistic construction of deterministic algorithms: Approximating packing integer programs","volume":"37","author":"Raghavan","year":"1988","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB19","series-title":"12th ACM Symposium on Parallel Algorithms and Architectures","first-page":"98","article-title":"Asynchronous scheduling of redundant disk array","author":"Sanders","year":"2000"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB20","series-title":"12th ACM-SIAM Symposium on Discrete Algorithms, Washington, DC","first-page":"67","article-title":"Reconciling simplicity and realism in parallel disk models","author":"Sanders","year":"2001"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB21","series-title":"11th ACM-SIAM Symposium on Discrete Algorithms","first-page":"849","article-title":"Fast concurrent access to parallel disks","author":"Sanders","year":"2000"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB22","unstructured":"L.A.M. Schoenmakers, A new algorithm for the recognition of series parallel graphs, Technical Report CS-R9504, CWI\u2013\u2013Centrum voor Wiskunde en Informatica, January 31, 1995"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB23","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","article-title":"A simplified NP-complete satisfiability problem","volume":"8","author":"Tovey","year":"1984","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB24","series-title":"6th European Symposium on Algorithms","first-page":"1","article-title":"External memory algorithms","author":"Vitter","year":"1998"},{"issue":"2\u20133","key":"10.1016\/S0167-8191(02)00092-3_BIB25","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/BF01185207","article-title":"Algorithms for parallel memory I: Two level memories","volume":"12","author":"Vitter","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-8191(02)00092-3_BIB26","doi-asserted-by":"crossref","unstructured":"V\u00f6cking, B. How asymmetry helps load balancing, in: 40th FOCS, 1999, pp. 131\u2013140","DOI":"10.1109\/SFFCS.1999.814585"},{"issue":"1","key":"10.1016\/S0167-8191(02)00092-3_BIB27","first-page":"15","article-title":"Queueing system with selection of the shortest of two queues: An asymptotic approach","volume":"32","author":"Vvedenskaya","year":"1996","journal-title":"Problems of Information Transmission"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102000923?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102000923?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T09:41:08Z","timestamp":1580895668000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819102000923"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0167819102000923"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(02)00092-3","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}