{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:17Z","timestamp":1725664157847},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_272","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:10:52Z","timestamp":1330243852000},"page":"406-415","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Page migration algorithms using work functions"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence L.","family":"Larmore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Reingold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffery","family":"Westbrook","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Bartal and A. Fiat. Competitive distributed file allocation. Proc. of 25th Symposium on Theory of Computation, 1993, pages 164\u2013173.","DOI":"10.1145\/167088.167142"},{"key":"44_CR2","unstructured":"P. Berman, H. J. Karloff, and G. Tardos. A competitive three-server algorithm. In Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, pages 280\u2013290, 1990."},{"key":"44_CR3","first-page":"184","volume-title":"Proceedings, Spring Compcon 1989","author":"D. Black","year":"1989","unstructured":"D. Black, A. Gupta, and W. Weber. Competitive management of distributed shared memory. In Proceedings, Spring Compcon 1989, pages 184\u2013190. IEEE Computer Society, San Francisco, CA., 1989."},{"key":"44_CR4","unstructured":"D. L. Black and D. D. Sleator. Competitive algorithms for replication and migration problems. Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University, 1989."},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/0404017","volume":"4","author":"M. Chrobak","year":"1991","unstructured":"M. Chrobak, H. Karloff, T. Payne, and S. Vishwanathan. New results on server problems. SIAM Journal on Discrete Mathematics, 4: 172\u2013181, 1991. Also in Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, pages 291\u2013300, 1990.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"44_CR6","unstructured":"M. Chrobak and L. L. Larmore, Generosity helps, or an 11-competitive algorithm for three servers. In Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, pages 196\u2013202, 1992."},{"key":"44_CR7","first-page":"11","volume":"7","author":"M. Chrobak","year":"1992","unstructured":"M. Chrobak and L. L. Larmore, The server problem and on-line games, In Proceedings of the DIMACS Workshop on On-Line Algorithms, American Mathematical Society, vol. 7, pages 11\u201364, 1992.","journal-title":"Proceedings of the DIMACS Workshop on On-Line Algorithms, American Mathematical Society"},{"key":"44_CR8","unstructured":"W. Crowther, J. Goodhue, E. Starr, R. Thomas, W. Milliken, and T. Blackadar. Performance measurements on a 128-node butterfly parallel processor. In Proc. International Conf. on Parallel Processing, IEEE Computer Society, pages 531\u2013540, 1985."},{"issue":"2","key":"44_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/356876.356883","volume":"14","author":"L. W. Dowdy","year":"1982","unstructured":"L. W. Dowdy and D. V. Foster. Comparative models of the file assignment problem. ACM Computing Surveys, 14(2):287\u2013313, 1982.","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"44_CR10","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"Amos Fiat, Richard Karp, Michael Luby, Lyle McGeoch, Daniel D. Sleator, and Neil Young. On competitive algorithms for paging problems. Journal of Algorithms, 12(4):685\u2013699, 1991.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"44_CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A. Karlin","year":"1988","unstructured":"A. Karlin, M. Manasse, L. Rudolph, and D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79\u2013119, 1988.","journal-title":"Algorithmica"},{"key":"44_CR12","unstructured":"A. R. Karlin, M. S. Manasse, L. A. McGeoch, and S. Owicki. Competitive randomized algorithms for non-uniform problems. In Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, pages 301\u2013309, 1990."},{"key":"44_CR13","doi-asserted-by":"publisher","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. Sleator. Competitive algorithms for on-line problems. Journal of Algorithms, 11: 208\u2013230, 1990. Also in Proc. 20th ACM Symposium on Theory of Computing, pages 322\u2013333, 1988.","journal-title":"Journal of Algorithms"},{"key":"44_CR14","unstructured":"G. Pfister et. al. The IBM research parallel processor prototype: Introduction and architecture. In Proc. International Conf. on Parallel Processing, IEEE Computer Society, pages 764\u2013771, 1985."},{"key":"44_CR15","unstructured":"P. Raghavan and M. Snir. Memory versus randomization in on-line algorithms. Research Report RC 15622 (No. 69444), IBM T. J. Watson Research Center, 1990. Also in Proc. 16th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science vol. 372, Springer-Verlag, pages 687\u2013703, 1989."},{"issue":"8","key":"44_CR16","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1109\/12.30869","volume":"38","author":"C. Scheurich","year":"1989","unstructured":"C. Scheurich and M. Dubois. Dynamic page migration in multiprocessors with distributed global memory. IEEE Transactions on Computers, 38(8):1154\u20131163, August 1989.","journal-title":"IEEE Transactions on Computers"},{"key":"44_CR17","first-page":"135","volume":"7","author":"J. Westbrook","year":"1992","unstructured":"J. Westbrook. Randomized algorithms for multiprocessor page migration. In Proceedings of the DIMACS Workshop on On-Line Algorithms, American Mathematical Society, vol. 7, pages 135\u2013150, 1992.","journal-title":"Proceedings of the DIMACS Workshop on On-Line Algorithms, American Mathematical Society"},{"key":"44_CR18","doi-asserted-by":"crossref","unstructured":"A. Wilson. Hierarchical cache\/bus architecture for shared memory multiprocessors. In Proc. 14th International Symp. on Computer Architecture, pages 244\u2013252. ACM SIGARCH\/IEEE Computer Society, 1987.","DOI":"10.1145\/30350.30378"},{"key":"44_CR19","unstructured":"O. Wolfson. A distributed algorithm for adaptive replication data. Technical Report CUCS-057-90, Department of Computer Science, Columbia University, 1990."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:21:13Z","timestamp":1578518473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_272"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_272","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}