{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:16:37Z","timestamp":1761894997596},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,25]],"date-time":"2009-11-25T00:00:00Z","timestamp":1259107200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s10951-009-0145-5","type":"journal-article","created":{"date-parts":[[2009,11,24]],"date-time":"2009-11-24T21:57:33Z","timestamp":1259099853000},"page":"105-116","source":"Crossref","is-referenced-by-count":11,"title":["Improved multi-processor scheduling for\u00a0flow time and\u00a0energy"],"prefix":"10.1007","volume":"15","author":[{"given":"Tak-Wah","family":"Lam","sequence":"first","affiliation":[]},{"given":"Lap-Kei","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Isaac K. K.","family":"To","sequence":"additional","affiliation":[]},{"given":"Prudence W. H.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,25]]},"reference":[{"issue":"4","key":"145_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/1290672.1290686","volume":"3","author":"S. Albers","year":"2007","unstructured":"Albers, S., & Fujiwara, H. (2007). Energy-efficient algorithms for flow time minimization. ACM Transactions on Algorithm, 3(4), 49.","journal-title":"ACM Transactions on Algorithm"},{"key":"145_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., Muller, F., & Schmelzer, S. (2007). Speed scaling on parallel processors. In Proceedings of symposium on parallelism in algorithms and architectures (pp.\u00a0289\u2013298).","DOI":"10.1145\/1248377.1248424"},{"issue":"3","key":"145_CR3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s00453-006-0193-6","volume":"47","author":"N. Avrahami","year":"2007","unstructured":"Avrahami, N., & Azar, Y. (2007). Minimizing total flow time and total completion time with immediate dispatching. Algorithmica, 47(3), 253\u2013268.","journal-title":"Algorithmica"},{"issue":"5","key":"145_CR4","doi-asserted-by":"crossref","first-page":"1370","DOI":"10.1137\/S009753970037446X","volume":"31","author":"B. Awerbuch","year":"2002","unstructured":"Awerbuch, B., Azar, Y., Leonardi, S., & Regev, O. (2002). Minimizing the flow time without migration. SIAM Journal on Computing, 31(5), 1370\u20131382.","journal-title":"SIAM Journal on Computing"},{"key":"145_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chan, H. L., Lam, T. W., & Lee, L. K. (2008). Scheduling for speed bounded processors. In Proceedings of international colloquium on automata, languages and programming (pp.\u00a0409\u2013420).","DOI":"10.1007\/978-3-540-70575-8_34"},{"issue":"1","key":"145_CR6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1206035.1206038","volume":"54","author":"N. Bansal","year":"2007","unstructured":"Bansal, N., Kimbrel, T., & Pruhs, K. (2007a). Speed scaling to manage energy and temperature. Journal of the ACM, 54(1), 3.","journal-title":"Journal of the ACM"},{"key":"145_CR7","unstructured":"Bansal, N., Pruhs, K., & Stein, C. (2007b). Speed scaling for weighted flow time. In Proceedings of ACM-SIAM symposium on discrete algorithms (pp.\u00a0805\u2013813)."},{"issue":"6","key":"145_CR8","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/40.888701","volume":"20","author":"D. M. Brooks","year":"2000","unstructured":"Brooks, D. M., Bose, P., Schuster, S. E., Jacobson, H., Kudva, P. N., Buyuktosunoglu, A., Wellman, J. D., Zyuban, V., Gupta, M., & Cook, P. W. (2000). Power-aware microarchitecture: design and modeling challenges for next-generation microprocessors. IEEE Micro, 20(6), 26\u201344.","journal-title":"IEEE Micro"},{"issue":"5","key":"145_CR9","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s10951-009-0123-y","volume":"12","author":"D. P. Bunde","year":"2009","unstructured":"Bunde, D. P. (2009). Power-aware scheduling for makespan and flow. Journal of Scheduling, 12(5), 489\u2013500.","journal-title":"Journal of Scheduling"},{"key":"145_CR10","unstructured":"Chan, H. L., Chan, W. T., Lam, T. W., Lee, L. K., Mak, K. S., & Wong, P. W. H. (2007). Energy efficient online deadline scheduling. In Proceedings of ACM-SIAM symposium on discrete algorithms (pp.\u00a0795\u2013804)."},{"issue":"3","key":"145_CR11","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1137\/S0097539703435765","volume":"34","author":"H. L. Chan","year":"2005","unstructured":"Chan, H. L., Lam, T. W., & To, K. K. (2005). Nonmigratory online deadline scheduling on multiprocessors. SIAM Journal on Computing, 34(3), 669\u2013682.","journal-title":"SIAM Journal on Computing"},{"key":"145_CR12","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Goel, A., Khanna, S., & Kumar, A. (2004). Multi-processor scheduling to minimize flow time with \u03b5 resource augmentation. In Proceedings of ACM symposium on theory of computing (pp.\u00a0363\u2013372).","DOI":"10.1145\/1007352.1007411"},{"key":"145_CR13","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S., & Zhu, A. (2001). Algorithms for minimizing weighted flow time. In Proceedings of ACM symposium on theory of computing (pp.\u00a084\u201393).","DOI":"10.1145\/380752.380778"},{"key":"145_CR14","unstructured":"Grunwald, D., Levis, P., Farkas, K. I., Morrey, C. B., & Neufeld, M. (2000). Policies for dynamic clock scheduling. In Proceedings of symposium on operating systems design and implementation (pp.\u00a073\u201386)."},{"issue":"2","key":"145_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1067309.1067324","volume":"32","author":"S. Irani","year":"2005","unstructured":"Irani, S., & Pruhs, K. (2005). Algorithmic problems in power management. SIGACT News, 32(2), 63\u201376.","journal-title":"SIGACT News"},{"issue":"4","key":"145_CR16","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/1290672.1290678","volume":"3","author":"S. Irani","year":"2007","unstructured":"Irani, S., Shukla, S., & Gupta, R. K. (2007). Algorithms for power savings. ACM Transactions on Algorithm, 3(4), 41.","journal-title":"ACM Transactions on Algorithm"},{"key":"145_CR17","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jagm.2000.1128","volume":"38","author":"B. Kalyanasundaram","year":"2001","unstructured":"Kalyanasundaram, B., & Pruhs, K. (2001). Eliminating migration in multi-processor scheduling. Journal of Algorithms, 38, 2\u201324.","journal-title":"Journal of Algorithms"},{"issue":"11","key":"145_CR18","doi-asserted-by":"crossref","first-page":"1527","DOI":"10.1109\/TPDS.2008.115","volume":"19","author":"T. W. Lam","year":"2008","unstructured":"Lam, T. W., Lee, L. K., To, I. K. K., & Wong, P. W. H. (2008a). Non-migratory multi-processor scheduling for response time and energy. IEEE Transactions on Parallel and Distributed Systems, 19(11), 1527\u20131539.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"145_CR19","doi-asserted-by":"crossref","unstructured":"Lam, T. W., Lee, L. K., To, I. K. K., & Wong, P. W. H. (2008b). Speed scaling functions for flow time scheduling based on active job count. In Proceedings of European symposium on algorithms (pp.\u00a0647\u2013659).","DOI":"10.1007\/978-3-540-87744-8_54"},{"issue":"6","key":"145_CR20","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.jcss.2006.10.018","volume":"73","author":"S. Leonardi","year":"2007","unstructured":"Leonardi, S., & Raz, D. (2007). Approximating total flow time on parallel machines. Journal of Computer and System Sciences, 73(6), 875\u2013891.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"145_CR21","first-page":"1","volume":"5","author":"J. McCullough","year":"2008","unstructured":"McCullough, J., & Torng, E. (2008). SRPT optimally utilizes faster machines to minimize flow time. ACM Transactions on Algorithms, 5(1), 1.","journal-title":"ACM Transactions on Algorithms"},{"issue":"4","key":"145_CR22","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/2.917539","volume":"34","author":"T. Mudge","year":"2001","unstructured":"Mudge, T. (2001). Power: a first-class architectural design constraint. Computer, 34(4), 52\u201358.","journal-title":"Computer"},{"issue":"2","key":"145_CR23","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s00453-001-0068-9","volume":"32","author":"C. A. Phillips","year":"2002","unstructured":"Phillips, C. A., Stein, C., Torng, E., & Wein, J. (2002). Optimal time-critical scheduling via resource augmentation. Algorithmica, 32(2), 163\u2013200.","journal-title":"Algorithmica"},{"key":"145_CR24","doi-asserted-by":"crossref","unstructured":"Pillai, P., & Shin, K. G. (2001). Real-time dynamic voltage scaling for low-power embedded operating systems. In Proceedings of ACM symposium on operating systems principles (pp.\u00a089\u2013102).","DOI":"10.1145\/502059.502044"},{"key":"145_CR25","first-page":"15-1","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"K. Pruhs","year":"2004","unstructured":"Pruhs, K., Sgall, J., & Torng, E. (2004). Online scheduling. In J. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (pp. 15-1\u201315-4). Boca Raton: CRC Press."},{"issue":"1","key":"145_CR26","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s00224-007-9070-1","volume":"43","author":"K. Pruhs","year":"2008","unstructured":"Pruhs, K., van Stee, R., & Uthaisombut, P. (2008a). Speed scaling of tasks with precedence constraints. Theory of Computing Systems, 43(1), 67\u201380.","journal-title":"Theory of Computing Systems"},{"issue":"3","key":"145_CR27","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/1367064.1367078","volume":"4","author":"K. Pruhs","year":"2008","unstructured":"Pruhs, K., Uthaisombut, P., & Woeginger, G. (2008b). Getting the best response for your erg. ACM Transactions on Algorithms, 4(3), 38.","journal-title":"ACM Transactions on Algorithms"},{"key":"145_CR28","unstructured":"Weiser, M., Welch, B., Demers, A., & Shenker, S. (1994). Scheduling for reduced CPU energy. In Proceedings of symposium on operating systems design and implementation (pp.\u00a013\u201323)."},{"key":"145_CR29","doi-asserted-by":"crossref","unstructured":"Yao, F., Demers, A., & Shenker, S. (1995). A scheduling model for reduced CPU energy. In Proceedings of symposium on foundations of computer science (pp.\u00a0374\u2013382).","DOI":"10.1109\/SFCS.1995.492493"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0145-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0145-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0145-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:43Z","timestamp":1559468383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0145-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,25]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["145"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0145-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,25]]}}}