{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:54Z","timestamp":1725559014040},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_35","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T13:27:29Z","timestamp":1279027649000},"page":"408-419","source":"Crossref","is-referenced-by-count":0,"title":["Online Scheduling of Splittable Tasks in Peer-to-Peer Networks"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1137\/S0097539797324874","volume":"29","author":"S. Albers","year":"1999","unstructured":"Albers, S.: Better bounds for online scheduling. SIAM Journal on Computing\u00a029, 459\u2013473 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(94)00026-3","volume":"50","author":"Y. Bartal","year":"1994","unstructured":"Bartal, Y., Karloff, H., Rabani, Y.: A better lower bound for on-line scheduling. Information Processing Letters\u00a050, 113\u2013116 (1994)","journal-title":"Information Processing Letters"},{"issue":"1","key":"35_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y. Cho","year":"1980","unstructured":"Cho, Y., Sahni, S.: Bounds for List Schedules on Uniform Processors. SIAM Journal on Computing\u00a09(1), 91\u2013103 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(94)90152-X","volume":"130","author":"A. Feldmann","year":"1994","unstructured":"Feldmann, A., Sgall, J., Teng, S.-H.: Dynamic scheduling on parallel machines. Theoretical Computer Science\u00a0130, 49\u201372 (1994)","journal-title":"Theoretical Computer Science"},{"key":"35_CR5","unstructured":"Fiat, A., Saia Censorship, J.: Censorship resistant Peer-to-Peer content addressable networks. In: Proceedings of the 13th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA 2002), pp. 94\u2013103 (2002)"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","volume":"3","author":"R. Fleischer","year":"2000","unstructured":"Fleischer, R., Wahl, M.: Online scheduling revisited. Journal of Scheduling\u00a03, 343\u2013353 (2000)","journal-title":"Journal of Scheduling"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/0222026","volume":"22","author":"G. Galambos","year":"1993","unstructured":"Galambos, G., Woeginger, G.J.: An on-line scheduling heuristic with better worst case ratio than Graham\u2019s list scheduling. SIAM Journal on Computing\u00a022, 349\u2013355 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"35_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/0206013","volume":"6","author":"T.F. Gonzalez","year":"1977","unstructured":"Gonzalez, T.F., Ibarra, O.H., Sahni, S.: Bounds for LPT Schedules on Uniform Processors. SIAM Journal on Computing\u00a06(1), 155\u2013166 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR9","unstructured":"Gormley, T., Reingold, N., Torng, E., Westbrook, J.: Generating adversaries for request-answer games. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 564\u2013565 (2000)"},{"key":"35_CR10","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"key":"35_CR11","unstructured":"Rudin III., J.F.: Improved bounds for the on-line scheduling problem. PhD thesis,The University of Texas at Dallas (May 2001)"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1006\/jagm.1996.0019","volume":"20","author":"D.R. Karger","year":"1996","unstructured":"Karger, D.R., Phillips, S.J., Torng, E.: A better algorithm for an ancient scheduling problem. Journal of Algorithms\u00a020, 400\u2013430 (1996)","journal-title":"Journal of Algorithms"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-540-45138-9_44","volume-title":"Mathematical Foundations of Computer Science 2003","author":"P. Krysta","year":"2003","unstructured":"Krysta, P., Sanders, P., V\u00f6cking, B.: Scheduling and traffic allocation for tasks with bounded splittability. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 500\u2013510. Springer, Heidelberg (2003)"},{"issue":"2","key":"35_CR14","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1137\/S0097539799527969","volume":"27","author":"R. Li","year":"1998","unstructured":"Li, R., Shi, L.: An on-line algorithm for some uniform processor scheduling. SIAM Journal on Computing\u00a027(2), 414\u2013422 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR15","unstructured":"Liu, J.W.S., Liu, C.L.: Bounds on scheduling algorithms for heterogeneous computing systems. In: Rosenfeld, J.L. (ed.) Proceedings of IFIP Congress 1974, Information Processing, vol.\u00a074, pp. 349\u2013353 (1974)"},{"issue":"6","key":"35_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0020-0190(01)00241-1","volume":"81","author":"E. Naroska","year":"2002","unstructured":"Naroska, E., Schwiegelshohn, U.: On an on-line scheduling problem for parallel jobs. Information Processing Letters\u00a081(6), 297\u2013304 (2002)","journal-title":"Information Processing Letters"},{"issue":"1","key":"35_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0020-0190(97)00093-8","volume":"63","author":"J. Sgall","year":"1997","unstructured":"Sgall, J.: A Lower Bound for Randomized On-Line Multiprocessor Scheduling. Inf. Process. Lett.\u00a063(1), 51\u201355 (1997)","journal-title":"Inf. Process. Lett."},{"key":"35_CR18","unstructured":"Sgall, J.: On-Line scheduling on parallel machines. PhD thesis, Carnegie-Mellon University, Pittsburgh, PA, USA (1994)"},{"issue":"4","key":"35_CR19","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/s00453-001-0098-3","volume":"32","author":"H. Shachnai","year":"2002","unstructured":"Shachnai, H., Tamir, T.: Multiprocessor scheduling with machine allotment and parallelism constraints. Algorithmica\u00a032(4), 651\u2013678 (2002)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T07:58:14Z","timestamp":1553068694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}