{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:20:08Z","timestamp":1759134008056},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,8,21]],"date-time":"2008-08-21T00:00:00Z","timestamp":1219276800000},"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":[[2010,6]]},"DOI":"10.1007\/s00453-008-9214-y","type":"journal-article","created":{"date-parts":[[2008,8,20]],"date-time":"2008-08-20T16:10:43Z","timestamp":1219248643000},"page":"349-380","source":"Crossref","is-referenced-by-count":11,"title":["Algorithms for Data Migration"],"prefix":"10.1007","volume":"57","author":[{"given":"E.","family":"Anderson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Hall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Hartline","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Hobbes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Karlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Saia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Swaminathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Wilkes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,21]]},"reference":[{"key":"9214_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, E., Hall, J., Hartline, J., Hobbes, M., Karlin, A., Saia, J., Swaminithan, R., Wilkes, J.: An experimental study of data migration algorithms. In: Proceedings of the Workshop on Algorithm Engineering (WAE), pp.\u00a0145\u2013158 (2001)","DOI":"10.1007\/3-540-44688-5_12"},{"key":"9214_CR2","unstructured":"Anderson, E., Hobbs, M., Keeton, K., Spence, S., Uysal, M., Veitch, A.: Hippodrome: running circles around storage administration. In: Proceedings of the USENIX Conference on File and Storage Technologies (FAST), pp.\u00a0175\u2013188 (2002)"},{"key":"9214_CR3","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Golding, R., Merchant, A., Schreier, L., Shriver, E., Spasojevic, M., Wilkes, J.: Using attribute-managed storage to achieve QoS. In: Proceedings of the International Workshop on Quality of Service (IWQoS), pp.\u00a0199\u2013202. Columbia University, New York, June 1997","DOI":"10.1007\/978-0-387-35170-4_23"},{"issue":"3","key":"9214_CR4","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1137\/0214054","volume":"14","author":"E. Coffman","year":"1985","unstructured":"Coffman, E., Garey, M., Johnson, D., Lapaugh, A.: Scheduling file transfers. SIAM J. Comput. 14(3), 744\u2013780 (1985)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9214_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/75577.75583","volume":"33","author":"B. Gavish","year":"1990","unstructured":"Gavish, B., Sheng, O.: Dynamic file migration in distributed computer systems. Commun. ACM 33(2), 177\u2013189 (1990)","journal-title":"Commun. ACM"},{"key":"9214_CR6","unstructured":"Golubchik, I., Khuller, S., Khanna, S., Thurimella, R., Zhu, A.: Approximation algorithms for data placement on parallel disks. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0223\u2013232 (2000)"},{"issue":"1","key":"9214_CR7","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00453-005-1194-6","volume":"45","author":"L. Golubchik","year":"2006","unstructured":"Golubchik, L., Khuller, S., Kim, Y., Shargorodskaya, S., Wan, Y.: Data migration on parallel disks. Algorithmica 45(1), 137\u2013158 (2006)","journal-title":"Algorithmica"},{"issue":"2","key":"9214_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1006\/jpdc.1998.1483","volume":"54","author":"M. Grammatikakis","year":"1998","unstructured":"Grammatikakis, M., Hsu, D., Kraetzl, M., Sibeyn, J.: Packet routing in fixed-connection networks: A\u00a0survey. J.\u00a0Parallel Distrib. Process. 54(2), 77\u2013132 (1998)","journal-title":"J.\u00a0Parallel Distrib. Process."},{"key":"9214_CR9","unstructured":"Hall, J., Hartline, J., Karlin, A., Saia, J., Wilkes, J.: On algorithms for efficient data migration. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0620\u2013629 (2001)"},{"key":"9214_CR10","doi-asserted-by":"crossref","unstructured":"Kashyap, S., Khuller, S., Wan, Y., Golubehik, L.: Fast reconfiguration of data placement in parallel disks. In: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), pp.\u00a095\u2013107 (2006)","DOI":"10.1137\/1.9781611972863.10"},{"issue":"2","key":"9214_CR11","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/S009753970342585X","volume":"33","author":"S. Khuller","year":"2004","unstructured":"Khuller, S., Kim, Y., Wan, Y.: Algorithms for data migration with cloning. SIAM J. Comput. 33(2), 448\u2013461 (2004)","journal-title":"SIAM J. Comput."},{"key":"9214_CR12","doi-asserted-by":"crossref","unstructured":"Khuller, S., Kim, Y., Malekian, A.: Improved algorithms for data migration. In: Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp.\u00a0164\u2013175 (2006)","DOI":"10.1007\/11830924_17"},{"key":"9214_CR13","unstructured":"Kim, Y.: Data migration to minimize the average completion time. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a097\u201398 (2003)"},{"issue":"1","key":"9214_CR14","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.jalgor.2004.07.009","volume":"55","author":"Y. Kim","year":"2005","unstructured":"Kim, Y.: Data migration to minimize the average completion time. J.\u00a0Algorithms 55(1), 42\u201357 (2005)","journal-title":"J.\u00a0Algorithms"},{"issue":"2","key":"9214_CR15","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/0377-2217(96)00131-2","volume":"94","author":"M. Kubale","year":"1996","unstructured":"Kubale, M.: Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors. Eur. J. Oper. Res. 94(2), 242\u2013251 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9214_CR16","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.: An $o(\\sqrt{|V|}|e|)$ algorithm for finding a maximum matching in general graphs. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS), pp.\u00a017\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"issue":"3","key":"9214_CR17","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/0403035","volume":"3","author":"T. Nishizeki","year":"1990","unstructured":"Nishizeki, T., Kashiwagi, K.: On the 1.1 edge-coloring of multigraphs. SIAM J. Discrete Math. 3(3), 391\u2013410 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"9214_CR18","doi-asserted-by":"crossref","unstructured":"Sanders, P., Solis-Oba, R.: How helpers hasten h-relations. In: Proceedings of the European Symposium on Algorithms (ESA), pp.\u00a0392\u2013402 (2000)","DOI":"10.1007\/3-540-45253-2_36"},{"key":"9214_CR19","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1002\/sapm1949281148","volume":"28","author":"C. Shannon","year":"1949","unstructured":"Shannon, C.: A theorem on colouring lines of a network. J. Math. Phys. 28, 148\u2013151 (1949)","journal-title":"J. Math. Phys."},{"key":"9214_CR20","unstructured":"Transaction Processing Performance Council. TPC Benchmark\u00a0D (Decision Support) Standard Specification Revision\u00a02.1. Transaction Processing Performance Council (1996)"},{"key":"9214_CR21","first-page":"23","volume":"3","author":"V. Vizing","year":"1964","unstructured":"Vizing, V.: On an estimate of the chromatic class of a p-graph. Discrete Anal. 3, 23\u201330 (1964) (in Russian)","journal-title":"Discrete Anal."},{"key":"9214_CR22","doi-asserted-by":"crossref","unstructured":"Wolf, J.: The placement optimization problem: a practical solution to the disk file assignment problem. In: Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp.\u00a01\u201310 (1989)","DOI":"10.1145\/75108.75373"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9214-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9214-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9214-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:02Z","timestamp":1559137502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9214-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,21]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9214"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9214-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,21]]}}}