{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:59:42Z","timestamp":1767322782589,"version":"3.48.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032105066","type":"print"},{"value":"9783032105073","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-10507-3_13","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:55:59Z","timestamp":1767322559000},"page":"243-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Evaluating the\u00a0Impact of\u00a0Algorithmic Components on\u00a0Task Graph Scheduling"],"prefix":"10.1007","author":[{"given":"Jared","family":"Coleman","sequence":"first","affiliation":[]},{"given":"Ravi Vivek","family":"Agrawal","sequence":"additional","affiliation":[]},{"given":"Ebrahim","family":"Hirani","sequence":"additional","affiliation":[]},{"given":"Bhaskar","family":"Krishnamachari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-662-48350-3_11","volume-title":"Algorithms - ESA 2015","author":"A Bazzi","year":"2015","unstructured":"Bazzi, A., Norouzi-Fard, A.: Towards tight lower bounds for scheduling problems. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 118\u2013129. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_11"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Braun, T., et al.: A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. In: Proceedings. Eighth Heterogeneous Computing Workshop (HCW 1999), pp. 15\u201329 (1999)","DOI":"10.1109\/HCW.1999.765093"},{"issue":"6","key":"13_CR3","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1006\/jpdc.2000.1714","volume":"61","author":"TD Braun","year":"2001","unstructured":"Braun, T.D., et al.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J. Parallel Distributed Comput. 61(6), 810\u2013837 (2001)","journal-title":"J. Parallel Distributed Comput."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Coleman, J., Krishnamachari, B.: Comparing task graph scheduling algorithms: an adversarial approach (2024)","DOI":"10.1109\/IPDPS64566.2025.00014"},{"key":"13_CR5","unstructured":"Coleman, J., Krishnamachari, B., Adapala, S., Agrawal, R., Hirani, E.: Scheduling algorithms gathered. Github (2023)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.future.2023.04.031","volume":"147","author":"T Coleman","year":"2023","unstructured":"Coleman, T., Casanova, H., da Silva, R.F.: Automated generation of scientific workflow generators with WfChef. Future Gener. Comput. Syst. 147, 16\u201329 (2023)","journal-title":"Future Gener. Comput. Syst."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Cordeiro, D., Mouni\u00ea, G., Perarnau, S., Trystram, D., Vincent, J.M., Wagner, F.: Random graph generation for scheduling simulations. ICST (2010)","DOI":"10.4108\/ICST.SIMUTOOLS2010.8667"},{"key":"13_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Hagberg, A., Swart, P.J., Schult, D.A.: Exploring network structure, dynamics, and function using networkx (2008)","DOI":"10.25080\/TCWV9851"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Kwok, Y.K., Ahmad, I.: Benchmarking the task graph scheduling algorithms. In: Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, pp. 531\u2013537 (1998)","DOI":"10.1109\/IPPS.1998.669967"},{"issue":"7","key":"13_CR12","doi-asserted-by":"publisher","first-page":"3039","DOI":"10.1007\/s11227-018-2355-0","volume":"74","author":"AK Maurya","year":"2018","unstructured":"Maurya, A.K., Tripathi, A.K.: On benchmarking task scheduling algorithms for heterogeneous computing systems. J. Supercomput. 74(7), 3039\u20133070 (2018)","journal-title":"J. Supercomput."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"N\u2019Takp\u00e9, T., Suter, F.: Critical path and area based scheduling of parallel task graphs on heterogeneous platforms. In: 12th International Conference on Parallel and Distributed Systems, ICPADS 2006, Minneapolis, Minnesota, USA, 12\u201315 July 2006, pp. 3\u201310. IEEE Computer Society (2006)","DOI":"10.1109\/ICPADS.2006.32"},{"key":"13_CR14","unstructured":"anonymous while\u00a0under review: Parameterized Task Graph Scheduling Algorithm for Comparing Algorithmic Components - All Figures and Datasets (2024)"},{"key":"13_CR15","unstructured":"da\u00a0Silva, R.F.: Makeflow workflow execution instances. Github (2023)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"da\u00a0Silva, R.F., Mayani, R., Shi, Y., Kemanian, A.R., Rynge, M., Deelman, E.: Empowering agroecosystem modeling with HTC scientific workflows: the cycles model use case. In: Baru, C.K., et al. (eds.) 2019 IEEE International Conference on Big Data (IEEE BigData), Los Angeles, CA, USA, 9\u201312 December 2019, pp. 4545\u20134552. IEEE (2019)","DOI":"10.1109\/BigData47090.2019.9006107"},{"key":"13_CR17","unstructured":"da\u00a0Silva, R.F., Shah, H., Casanova, H.: Pegasus workflow execution instances. Github (2023)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Topcuoglu, H., Hariri, S., Wu, M.: Task scheduling algorithms for heterogeneous processors. In: 8th Heterogeneous Computing Workshop, HCW 1999, San Juan, Puerto Rico, 12 April 1999, pp. 3\u201314. IEEE Computer Society (1999)","DOI":"10.1109\/HCW.1999.765092"},{"issue":"8","key":"13_CR19","doi-asserted-by":"publisher","first-page":"1736","DOI":"10.1109\/TPDS.2018.2808959","volume":"29","author":"H Wang","year":"2018","unstructured":"Wang, H., Sinnen, O.: List-scheduling versus cluster-scheduling. IEEE Trans. Parallel Distrib. Syst. 29(8), 1736\u20131749 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10507-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:56:01Z","timestamp":1767322561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10507-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032105066","9783032105073"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10507-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JSSPP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Job Scheduling Strategies for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jsspp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jsspp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}