{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:04:16Z","timestamp":1761894256971},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,5,1]],"date-time":"2006-05-01T00:00:00Z","timestamp":1146441600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2006,5]]},"DOI":"10.1007\/s00453-005-1194-6","type":"journal-article","created":{"date-parts":[[2006,3,17]],"date-time":"2006-03-17T18:00:21Z","timestamp":1142618421000},"page":"137-158","source":"Crossref","is-referenced-by-count":6,"title":["Data migration on parallel disks: Algorithms and evaluation"],"prefix":"10.1007","volume":"45","author":[{"given":"Leana","family":"Golubchik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samir","family":"Khuller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoo-Ah","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Svetlana","family":"Shargorodskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yung-Chun (Justin)","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1194_CR1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-44688-5_12","volume-title":"Workshop on Algorithm Engineering","author":"E. Anderson","year":"2001","unstructured":"E. Anderson, J. Hall, J. Hartline, M. Hobbes, A. Karlin, J. Saia, R. Swaminathan, and J. Wilkes. An experimental study of data migration algorithms.Workshop on Algorithm Engineering, pp. 145\u2013158. LNCS 2141. Springer, New York, 2001."},{"issue":"3","key":"1194_CR2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/jgt.3190150309","volume":"15","author":"C. Berge","year":"1991","unstructured":"C. Berge and J. C. Fournier. A short proof for a generalization of Vizing\u2019s theorem.Journal of Graph Theory, 15(3):333\u2013336 (1991).","journal-title":"Journal of Graph Theory"},{"key":"1194_CR3","volume-title":"Graph Theory with Applications","author":"J. A. Bondy","year":"1977","unstructured":"J. A. Bondy and U. S. R. Murty.Graph Theory with Applications. Elsevier, New York, 1977."},{"key":"1194_CR4","unstructured":"A. L. Chervenak. Tertiary Storage: An Evaluation of New Applications. Ph.D. Thesis, UC Berkeley, 1994."},{"issue":"2\u20133","key":"1194_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1023\/A:1015776903524","volume":"17","author":"C.-F. Chou","year":"2002","unstructured":"C.-F. Chou, L. Golubchik, J. C. S. Lui, and I.-H. Chung. Design of scalable continuous media servers.Multimedia Tools and Applications, 17(2\u20133):181\u2013212, 2002.","journal-title":"Multimedia Tools and Applications"},{"issue":"1","key":"1194_CR6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0167-8191(97)00118-X","volume":"24","author":"S. Ghandeharizadeh","year":"1998","unstructured":"S. Ghandeharizadeh and R. R. Muntz. Design and implementation of scalable continuous media servers.Parallel Computing Journal, 24(1):91\u2013122, 1998.","journal-title":"Parallel Computing Journal"},{"key":"1194_CR7","unstructured":"L. Golubchik, S. Khanna, S. Khuller, R. Thurimella, and A. Zhu. Approximation algorithms for data placement on parallel disks.Proc. of ACM-SIAM SODA, pp. 223\u2013232, 2000."},{"key":"1194_CR8","unstructured":"J. Hall, J. Hartline, A. Karlin, J. Saia, and J. Wilkes. On algorithms for efficient data migration.Proc. of ACM-SIAM SODA, pp. 620\u2013629, 2001."},{"key":"1194_CR9","first-page":"265","volume-title":"Proc. of Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS)","author":"S. Kashyap","year":"2003","unstructured":"S. Kashyap and S. Khuller. Algorithms for non-uniform size data placement on parallel disks.Proc. of Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), pp. 265\u2013276. LNCS 2914. Springer, Berlin, 2003."},{"key":"1194_CR10","doi-asserted-by":"crossref","unstructured":"S. Khuller, Y. Kim, and Y-C. Wan. Algorithms for data migration with cloning.Proc. of 22nd ACM Symposium on Principles of Database Systems (PODS), pp. 27\u201336, 2003.","DOI":"10.1145\/773153.773156"},{"key":"1194_CR11","first-page":"238","volume-title":"Proc. of Workshop on Approximation Algorithms","author":"H. Shachnai","year":"2000","unstructured":"H. Shachnai and T. Tamir. Polynomial time approximation schemes for class-constrained packing problems.Proc. of Workshop on Approximation Algorithms, pp. 238\u2013249. LNCS 1913. Springer, Berlin, 2000."},{"key":"1194_CR12","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/s004530010057","volume":"29","author":"H. Shachnai","year":"2001","unstructured":"H. Shachnai and T. Tamir. On two class-constrained versions of the multiple knapsack problem.Algorithmica, 29:442\u2013467, 2001.","journal-title":"Algorithmica"},{"key":"1194_CR13","first-page":"165","volume-title":"Proc. of Workshop on Approximation Algorithms","author":"H. Shachnai","year":"2003","unstructured":"H. Shachnai and T. Tamir. Approximation schemes for generalized 2-dimensional vector packing with application to data placement.Proc. of Workshop on Approximation Algorithms, pp. 165\u2013177. LNCS 2764. Springer, Berlin, 2003."},{"key":"1194_CR14","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D. B. Shmoys","year":"1993","unstructured":"D. B. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problemMathematical Programming, 62:461\u2013474, 1993.","journal-title":"Mathematical Programming"},{"key":"1194_CR15","first-page":"25","volume":"3","author":"V. G. Vizing","year":"1964","unstructured":"V. G. Vizing. On an estimate of the chromatic class of a\u03c1-graph (Russian).Diskretnaya Analiz., 3:25\u201330, 1964.","journal-title":"Diskretnaya Analiz."},{"key":"1194_CR16","doi-asserted-by":"crossref","unstructured":"J. Wolf, H. Shachnai, and P. Yu. DASD dancing: a disk load balancing optimization scheme for video-on-demand computer systems.Proc. of ACM SIGMETRICS\/Performance Conference, pp. 157\u2013166, 1995.","DOI":"10.1145\/223587.223605"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-005-1194-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-005-1194-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-005-1194-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:44:58Z","timestamp":1559137498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-005-1194-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,5]]}},"alternative-id":["1194"],"URL":"https:\/\/doi.org\/10.1007\/s00453-005-1194-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5]]}}}