{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:25:00Z","timestamp":1742937900028,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642551949"},{"type":"electronic","value":"9783642551956"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-55195-6_2","type":"book-chapter","created":{"date-parts":[[2014,5,7]],"date-time":"2014-05-07T14:55:32Z","timestamp":1399474532000},"page":"13-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling Moldable Tasks with Precedence Constraints and Arbitrary Speedup Functions on Multiprocessors"],"prefix":"10.1007","author":[{"given":"Sascha","family":"Hunold","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,8]]},"reference":[{"key":"2_CR1","series-title":"LNCS","first-page":"1","volume-title":"IPPS-WS 1997 and JSSPP 1997","author":"DG Feitelson","year":"1997","unstructured":"Feitelson, D.G., Rudolph, L., Schwiegelshohn, U., Sevcik, K.C., Wong, P.: Theory and practice in parallel job scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol. 1291, pp. 1\u201334. Springer, Heidelberg (1997)"},{"key":"2_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-310-5","volume-title":"Scheduling for Parallel Processing","author":"M Drozdowski","year":"2009","unstructured":"Drozdowski, M.: Scheduling for Parallel Processing. Springer, London (2009)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Tomov, S., Nath, R., Ltaief, H., Dongarra, J.: Dense linear algebra solvers for multicore with GPU accelerators. In: HIPS Workshop, pp. 1\u20138 (2010)","DOI":"10.1109\/IPDPSW.2010.5470941"},{"issue":"04","key":"2_CR4","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1142\/S0129054102001308","volume":"13","author":"R Lep\u00e8re","year":"2002","unstructured":"Lep\u00e8re, R., Trystram, D., Woeginger, G.: Approximation algorithms for scheduling malleable tasks under predence constraints. Int. J. Found. Comput. Sci. 13(04), 613\u2013627 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1145\/1159892.1159899","volume":"2","author":"K Jansen","year":"2006","unstructured":"Jansen, K., Zhang, H.: An approximation algorithm for scheduling malleable tasks under general precedence constraints. ACM Trans. Algorithms 2(3), 416\u2013434 (2006)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.jcss.2011.04.003","volume":"78","author":"K Jansen","year":"2012","unstructured":"Jansen, K., Zhang, H.: Scheduling malleable tasks with precedence constraints. J. Comput. Syst. Sci. 78(1), 245\u2013259 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/s10878-012-9498-3","volume":"27","author":"E G\u00fcnther","year":"2014","unstructured":"G\u00fcnther, E., K\u00f6nig, F.G., Megow, N.: Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width. J. Comb. Optim. 27(1), 164\u2013181 (2014)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"2_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2","volume":"9","author":"RA van de Geijn","year":"1997","unstructured":"van de Geijn, R.A., Watts, J.: SUMMA: scalable universal matrix multiplication algorithm. Concurr. Pract. Exp. 9(4), 255\u2013274 (1997)","journal-title":"Concurr. Pract. Exp."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"2_CR10","unstructured":"Leung, Y.J.T. (ed.): Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall\/CRC, Boca Raton, FL, USA (2004)"},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1287\/moor.23.4.909","volume":"23","author":"M Skutella","year":"1998","unstructured":"Skutella, M.: Approximation algorithms for the discrete time-cost tradeoff problem. Math. Oper. Res. 23(4), 909\u2013929 (1998)","journal-title":"Math. Oper. Res."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Radulescu, A., van Gemund, A.: A low-cost approach towards mixed task and data parallel scheduling. In: ICPP, pp .69\u201376 (2001)","DOI":"10.1109\/ICPP.2001.952048"},{"issue":"10","key":"2_CR13","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1016\/j.parco.2006.08.004","volume":"32","author":"S Bansal","year":"2006","unstructured":"Bansal, S., Kumar, P., Singh, K.: An improved two-step algorithm for task and data parallel scheduling in distributed memory machines. Parallel Comput. 32(10), 759\u2013774 (2006)","journal-title":"Parallel Comput."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Hunold, S.: Low-cost tuning of two-step algorithms for scheduling mixed-parallel applications onto homogeneous clusters. In: CCGrid, pp. 253\u2013262 (2010)","DOI":"10.1109\/CCGRID.2010.52"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Desprez, F., Suter, F.: A bi-criteria algorithm for scheduling parallel task graphs on clusters. In: CCGrid, pp. 243\u2013252 (2010)","DOI":"10.1109\/CCGRID.2010.43"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Hunold, S., Lepping, J.: Evolutionary scheduling of parallel tasks graphs onto homogeneous clusters. In: CLUSTER, pp. 344\u2013352 (2011)","DOI":"10.1109\/CLUSTER.2011.45"},{"key":"2_CR17","unstructured":"Suter, F.: DAGGEN: a synthetic task graph generator. https:\/\/github.com\/frs69wq\/daggen"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/944618.944621","volume":"7","author":"S Albers","year":"2002","unstructured":"Albers, S., Schr\u00f6der, B.: An experimental study of online scheduling algorithms. J. Exp. Algorithmics 7, 3 (2002)","journal-title":"J. Exp. Algorithmics"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55195-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T00:17:19Z","timestamp":1675988239000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-55195-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642551949","9783642551956"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55195-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 May 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}