{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T01:56:20Z","timestamp":1761962180671,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207795"},{"type":"electronic","value":"9783540246183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24618-3_8","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T11:31:03Z","timestamp":1283686263000},"page":"82-101","source":"Crossref","is-referenced-by-count":5,"title":["Algorithms for Scalable Storage Servers"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sanders","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Aerts, J., Korst, J., Verhaegh, W.: Complexity of Retrieval Problems. Technical Report NL-MS-20.899, Philips Research Laboratories (2000)"},{"key":"8_CR2","volume-title":"Network Flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, R.L., Orlin, J.B.: Network Flows. Prentice Hall, Englewood Cliffs (1993)"},{"key":"8_CR3","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation Schemes for Scheduling. In: SODA, pp. 493\u2013500 (1997)"},{"key":"8_CR4","series-title":"Computer Architecture News","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/264107.264132","volume-title":"Proceedings of the 24th Annual International Symposium on Computer Architecture (ISCA 1997)","author":"G.A. Alvarez","year":"1997","unstructured":"Alvarez, G.A., Burkhard, W.A., Cristian, F.: Tolerating Multiple Failures in RAID Architectures with Optimal Storage and Uniform Declustering. In: Proceedings of the 24th Annual International Symposium on Computer Architecture (ISCA 1997), June 2\u20134. Computer Architecture News, vol.\u00a025(2), pp. 62\u201372. ACM Press, New York (1997)"},{"key":"8_CR5","first-page":"550","volume-title":"37th Annual Symposium on Foundations of Computer Science","author":"M. Andrews","year":"1996","unstructured":"Andrews, M., Bender, M.A., Zhang, L.: New Algorithms for the Disk Scheduling Problem. In: IEEE (ed.) 37th Annual Symposium on Foundations of Computer Science, pp. 550\u2013559. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced Allocations. In: 26th ACM Symposium on the Theory of Computing, pp. 593\u2013602 (1994)","DOI":"10.1145\/195058.195412"},{"issue":"4","key":"8_CR7","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/S0167-8191(97)00015-X","volume":"23","author":"R.D. Barve","year":"1997","unstructured":"Barve, R.D., Grove, E.F., Vitter, J.S.: Simple Randomized Mergesort on Parallel Disks. Parallel Computing\u00a023(4), 601\u2013631 (1997)","journal-title":"Parallel Computing"},{"key":"8_CR8","unstructured":"Berenbrink, P., Brinkmann, A., Scheideler, C.: Design of the PRESTO Multimedia Storage Network. In: International Workshop on Communication and Data Management in Large Networks, Paderborn Germany, October 5, pp. 2\u201312 (1999)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Czumaj, A., Steger, A., V\u00f6cking, B.: Balanced Allocations: The Heavily Loaded Case. In: 32th Annual ACM Symposium on Theory of Computing, pp. 745\u2013754 (2000)","DOI":"10.1145\/335305.335411"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Blaum, M., Brady, J., Bruck, J., Menon, J.: EVENODD: An Optimal Scheme for Tolerating Double Disk Failures in RAID Architectures. In: Proceedings of the 21st Annual International Symposium on Computer Architecture, pp. 245\u2013254 (1994)","DOI":"10.1109\/ISCA.1994.288145"},{"key":"8_CR11","unstructured":"Cain, J., Sanders, P., Wormald, N.: A Random Multigraph Process for Linear Time RDA Disk Scheduling (2003) (Manuscript in preparation)"},{"key":"8_CR12","first-page":"36","volume-title":"13th ACM Symposium on Principles of Database Systems","author":"L.T. Chen","year":"1994","unstructured":"Chen, L.T., Rotem, D.: Optimal Response Time Retrieval of Replicated Data (Extended abstract). In: 13th ACM Symposium on Principles of Database Systems, vol.\u00a013, pp. 36\u201344. ACM Press, New York (1994)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Colarelli, D., Grunwald, D.: Massive Arrays of Idle Disks for Storage Archives. In: SC 2002 Conference CD, IEEE\/ACM SIGARCH, Baltimore, MD (November 2002)","DOI":"10.1109\/SC.2002.10058"},{"issue":"11","key":"8_CR14","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/363269.363610","volume":"12","author":"R.B. Dial","year":"1969","unstructured":"Dial, R.B.: Algorithm 360: Shortest-Path Forest with Topological Ordering. Communications of the ACM\u00a012(11), 632\u2013633 (1969)","journal-title":"Communications of the ACM"},{"key":"8_CR15","unstructured":"Gibson, G.A., Hellerstein, L., Karp, R.M., Katz, R.H., Patterson, D.A.: Coding Techniques for Handling Failures in Large Disk Arrays, CSD-88-477. Technical report, U. C. Berkley (1988)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-44676-1_5","volume-title":"Algorithms - ESA 2001","author":"D.A. Hutchinson","year":"2001","unstructured":"Hutchinson, D.A., Sanders, P., Vitter, J.S.: Duality between Prefetching and Queued Writing with Parallel Disks. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 62\u201373. Springer, Heidelberg (2001)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0029564","volume-title":"Online Algorithms","author":"S. Irani","year":"1998","unstructured":"Irani, S.: Competetive Analysis of Paging. In: Fiat, A. (ed.) Dagstuhl Seminar 1996. LNCS, vol.\u00a01442, pp. 52\u201373. Springer, Heidelberg (1998)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Luby, M., Meyer auf der Heide, F.: Efficient PRAM Simulation on a Distributed Memory Machine. In: 24th ACM Symp. on Theory of Computing, May 1992, pp. 318\u2013326 (1992)","DOI":"10.1145\/129712.129743"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Korst, J.: Random Duplicate Assignment: An Alternative to Striping in Video Servers. In: ACM Multimedia, Seattle, pp. 219\u2013226 (1997)","DOI":"10.1145\/266180.266372"},{"key":"8_CR20","volume-title":"Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1988","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: Theory of Error-Correcting Codes. North-Holland, Amsterdam (1988)"},{"key":"8_CR21","volume-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., N\u00e4her, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms for Memory Hierarchies","year":"2003","unstructured":"Meyer, U., Sanders, P., Sibeyn, J. (eds.): Algorithms for Memory Hierarchies. LNCS, vol.\u00a02625. Springer, Heidelberg (2003)"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/S0167-8191(97)00008-2","volume":"23","author":"E.L. Miller","year":"1997","unstructured":"Miller, E.L., Katz, R.H.: RAMA: An Easy-to-Use, High-Performance Parallel File System. Parallel Computing\u00a023, 419\u2013446 (1997)","journal-title":"Parallel Computing"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1002\/(SICI)1098-111X(199812)13:12<1137::AID-INT4>3.0.CO;2-M","volume":"13","author":"R. Muntz","year":"1998","unstructured":"Muntz, R., Santos, J.R., Berson, S.: A Parallel Disk Storage System for Real-Time Multimedia Applications. International Journal of Intelligent Systems\u00a013, 1137\u20131174 (1998)","journal-title":"International Journal of Intelligent Systems"},{"issue":"1","key":"8_CR25","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M. Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. Journal of Cryptology: the Journal of the International Association for Cryptologic Research\u00a012(1), 29\u201366 (1999)","journal-title":"Journal of Cryptology: the Journal of the International Association for Cryptologic Research"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"O\u2019Neil, E., O\u2019Neil, P., Weikum, G.: An Optimality Proof of the LRU-K Page Replacement Algorithm. JACM: Journal of the ACM\u00a046 (1999)","DOI":"10.1145\/300515.300518"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Patterson, D., Gibson, G., Katz, R.: A Case for Redundant Arrays of Inexpensive Disks (RAID). In: Proceedings of ACM SIGMOD 1988, pp. 109\u2013116 (1988)","DOI":"10.1145\/50202.50214"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jctb.1996.0036","volume":"67","author":"B. Pittel","year":"1996","unstructured":"Pittel, B., Spencer, J., Wormald, N.: Sudden Emergence of a Giant k-Core in Random Graph. J. Combinatorial Theory, Series B\u00a067, 111\u2013151 (1996)","journal-title":"J. Combinatorial Theory, Series B"},{"issue":"2","key":"8_CR29","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"M.O. Rabin","year":"1989","unstructured":"Rabin, M.O.: Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance. Journal of the ACM\u00a036(2), 335\u2013348 (1989)","journal-title":"Journal of the ACM"},{"issue":"3","key":"8_CR30","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/2.268881","volume":"27","author":"C. Ruemmler","year":"1994","unstructured":"Ruemmler, C., Wilkes, J.: An Introduction to Disk Drive Modeling. IEEE Computer\u00a027(3), 17\u201328 (1994)","journal-title":"IEEE Computer"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Salem, K., Garcia-Molina, H.: Disk Striping. In: Proceedings of Data Engineering 1986 (1986)","DOI":"10.1109\/ICDE.1986.7266238"},{"issue":"5","key":"8_CR32","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/S0167-8191(02)00092-3","volume":"28","author":"P. Sanders","year":"2002","unstructured":"Sanders, P.: Reconciling Simplicity and Realism in Parallel Disk Models. Parallel Computing\u00a028(5), 705\u2013723 (2002); Short version in 12th SODA, pp. 67\u201376 (2001)","journal-title":"Parallel Computing"},{"issue":"9","key":"8_CR33","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1109\/TC.2003.1228512","volume":"52","author":"P. Sanders","year":"2003","unstructured":"Sanders, P.: Asynchronous Scheduling of Redundant Disk Arrays. IEEE Transactions on Computers\u00a052(9), 1170\u20131184 (2003); Short version in 12th ACM Symposium on Parallel Algorithms and Architectures, pp. 89\u201398 (2000)","journal-title":"IEEE Transactions on Computers"},{"key":"8_CR34","first-page":"21","volume":"1","author":"P. Sanders","year":"2003","unstructured":"Sanders, P., Egner, S., Korst, J.: Fast Concurrent Access to Parallel Disks. Algorithmica\u00a01, 21\u201355 (2003), Short version in 11th SODA, pp. 849\u2013858 (2000)","journal-title":"Algorithmica"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Santos, J.R., Muntz, R.R., Ribeiro-Neto, B.: Comparing Random Data Allocation and Data Striping in Multimedia Servers. In: ACM SIGMETRICS, pp. 44\u201355 (2000)","DOI":"10.1145\/339331.339352"},{"issue":"1","key":"8_CR36","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/s007780050053","volume":"7","author":"P. Scheuermann","year":"1998","unstructured":"Scheuermann, P., Weikum, G., Zabback, P.: Data Partitioning and Load Balancing in Parallel Disk Systems. VLDB Journal: Very Large Data Bases\u00a07(1), 48\u201366 (1998)","journal-title":"VLDB Journal: Very Large Data Bases"},{"key":"8_CR37","unstructured":"Schoenmakers, L.A.M.: A New Algorithm for the Recognition of Series Parallel Graphs. Technical Report CS-R9504, CWI \u2013 Centrum voor Wiskunde en Informatica, January 31 (1995)"},{"issue":"6","key":"8_CR38","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1145\/362248.362257","volume":"16","author":"H.S. Stone","year":"1973","unstructured":"Stone, H.S., Fuller, S.F.: On the Near-Optimality of the Shortest-Access-Time- First Drum Scheduling Discipline. Communications of the ACM\u00a016(6), 352\u2013353 (1973), Also published in\/as: Technical Note No.12, DSL","journal-title":"Communications of the ACM"},{"key":"8_CR39","doi-asserted-by":"crossref","unstructured":"Tetzlaff, W., Flynn, R.: Block Allocation in Video Servers for Availability and Throughput. In: Proceedings Multimedia Computing and Networking (1996)","DOI":"10.1117\/12.235884"},{"key":"8_CR40","doi-asserted-by":"crossref","unstructured":"Tewari, R., Mukherjee, R., Dias, D.M., Vin, H.M.: Design and Performance Tradeoffs in Clustered Video Servers. In: Proceedings of the International Conference on Multimedia Computing and Systems, pp. 144\u2013150 (1996)","DOI":"10.1109\/MMCS.1996.534966"},{"issue":"2","key":"8_CR41","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J.S. Vitter","year":"2001","unstructured":"Vitter, J.S.: External Memory Algorithms and Data Structures: Dealing with Massive Data. ACM Computing Surveys\u00a033(2), 209\u2013271 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"2\/3","key":"8_CR42","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01185207","volume":"12","author":"J.S. Vitter","year":"1994","unstructured":"Vitter, J.S., Shriver, E.A.M.: Algorithms for Parallel Memory, I: Two Level Memories. Algorithmica\u00a012(2\/3), 110\u2013147 (1994)","journal-title":"Algorithmica"},{"key":"8_CR43","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"G.J. Woeginger","year":"2000","unstructured":"Woeginger, G.J.: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (fptas). INFORMS Journal on Computing\u00a012, 57\u201375 (2000)","journal-title":"INFORMS Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2004: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24618-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T15:26:50Z","timestamp":1740497210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24618-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540207795","9783540246183"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24618-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}