{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:10:19Z","timestamp":1725707419090},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642348617"},{"type":"electronic","value":"9783642348624"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34862-4_6","type":"book-chapter","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T09:00:11Z","timestamp":1353920411000},"page":"82-92","source":"Crossref","is-referenced-by-count":1,"title":["Shortest-Elapsed-Time-First on a Multiprocessor"],"prefix":"10.1007","author":[{"given":"Neal","family":"Barcelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungjin","family":"Im","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Moseley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM\u00a047(4), 617\u2013643 (2000)","journal-title":"J. ACM"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R. Motwani","year":"1994","unstructured":"Motwani, R., Phillips, S., Torng, E.: Non-clairvoyant scheduling. Theor. Comput. Sci.\u00a0130(1), 17\u201347 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/1998037.1998058","volume":"42","author":"S. Im","year":"2011","unstructured":"Im, S., Moseley, B., Pruhs, K.: A tutorial on amortized local competitiveness in online scheduling. SIGACT News\u00a042(2), 83\u201397 (2011)","journal-title":"SIGACT News"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Chadha, J.S., Garg, N., Kumar, A., Muralidhara, V.N.: A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 679\u2013684 (2009)","DOI":"10.1145\/1536414.1536506"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S., Goel, A., et al.: Multi-processor scheduling to minimize flow time with resource augmentation. In: Proc. 36th Symp. Theory of Computing (STOC), pp. 363\u2013372. ACM (2004)","DOI":"10.1145\/1007352.1007411"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Edmonds, J., Pruhs, K.: Scalably scheduling processes with arbitrary speedup curves. In: SODA, pp. 685\u2013692 (2009)","DOI":"10.1137\/1.9781611973068.75"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Bansal, N., Dhamdhere, K.: Minimizing weighted flow time. ACM Trans. Algorithms 3(4) (November 2007)","DOI":"10.1145\/1290672.1290676"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00453-010-9420-2","volume":"61","author":"H.L. Chan","year":"2011","unstructured":"Chan, H.L., Edmonds, J., Lam, T.W., Lee, L.K., Marchetti-Spaccamela, A., Pruhs, K.: Nonclairvoyant speed scaling for flow and energy. Algorithmica\u00a061(3), 507\u2013517 (2011)","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/s00224-011-9349-0","volume":"49","author":"H.L. Chan","year":"2011","unstructured":"Chan, H.L., Edmonds, J., Pruhs, K.: Speed scaling of processes with arbitrary speedup curves on a multiprocessor. Theory Comput. Syst.\u00a049(4), 817\u2013833 (2011)","journal-title":"Theory Comput. Syst."},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-642-14165-2_28","volume-title":"Automata, Languages and Programming","author":"N. Bansal","year":"2010","unstructured":"Bansal, N., Krishnaswamy, R., Nagarajan, V.: Better Scalable Algorithms for Broadcast Scheduling. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part I. LNCS, vol.\u00a06198, pp. 324\u2013335. Springer, Heidelberg (2010)"},{"key":"6_CR11","unstructured":"Merrit, R.: Cpu designers debate multi-core future. EE Times (February 2010)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Gupta, A., Im, S., Krishnaswamy, R., Moseley, B., Pruhs, K.: Scheduling heterogeneous processors isn\u2019t as easy as you think. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 1242\u20131253. SIAM (2012)","DOI":"10.1137\/1.9781611973099.98"}],"container-title":["Lecture Notes in Computer Science","Design and Analysis of Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34862-4_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:06:50Z","timestamp":1620133610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34862-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642348617","9783642348624"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34862-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}