{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:25:29Z","timestamp":1742934329502,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030882235"},{"type":"electronic","value":"9783030882242"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88224-2_8","type":"book-chapter","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T18:38:17Z","timestamp":1633459097000},"page":"149-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Performance-Cost Optimization of Moldable Scientific Workflows"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7775-8106","authenticated-orcid":false,"given":"Marta","family":"Jaros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0087-8804","authenticated-orcid":false,"given":"Jiri","family":"Jaros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,6]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"The shift from processor power consumption to performance variations: fundamental implications at scale. Comput. Sci. - Res. Dev. 31(4), 197\u2013205 (2016)","DOI":"10.1007\/s00450-016-0327-2"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Amdahl, G.M.: Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of the April 1820 1967 Spring Joint Computer Conference, vol. 23, no. 4, pp. 483\u2013485 (1967)","DOI":"10.1145\/1465482.1465560"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bharathi, S., Chervenak, A., Deelman, E., Mehta, G., Su, M.-H., Vahi, K.: Characterization of scientific workflows. In: 2008 Third Workshop on Workflows in Support of Large-Scale Science, pp. 1\u201310. IEEE, November 2008","DOI":"10.1109\/WORKS.2008.4723958"},{"issue":"9","key":"8_CR4","doi-asserted-by":"publisher","first-page":"2689","DOI":"10.1109\/TPDS.2017.2675891","volume":"28","author":"R Bleuse","year":"2017","unstructured":"Bleuse, R., Hunold, S., Kedad-Sidhoum, S., Monna, F., Mounie, G., Trystram, D.: Scheduling independent moldable tasks on multi-cores with GPUs. IEEE Trans. Parallel Distrib. Syst. 28(9), 2689\u20132702 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1142\/S0218195904001354","volume":"14","author":"R Breukelaar","year":"2004","unstructured":"Breukelaar, R., Demaine, E.D., Hohenberger, S., Hoogeboom, H.J., Kosters, W.A., Liben-Nowell, D.: Tetris is hard, even to approximate. Int. J. Comput. Geomet. Appl. 14, 41\u201368 (2004)","journal-title":"Int. J. Comput. Geomet. Appl."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1017\/S0962492900002427","volume":"3","author":"TF Chan","year":"1994","unstructured":"Chan, T.F., Mathew, T.P.: Domain decomposition algorithms. Acta Numer. 3, 61\u2013143 (1994)","journal-title":"Acta Numer."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.future.2017.01.011","volume":"75","author":"AM Chirkin","year":"2017","unstructured":"Chirkin, A.M., et al.: Execution time estimation for workflow scheduling. Future Gener. Comput. Syst. 75, 376\u2013387 (2017)","journal-title":"Future Gener. Comput. Syst."},{"key":"8_CR8","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-48584-1","volume-title":"Evolutionary Scheduling","author":"C Cotta","year":"2007","unstructured":"Cotta, C., Fern\u00e1ndez, A.J.: Evolutionary Scheduling. Studies in Computational Intelligence, vol. 49. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-48584-1"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/11605300_8","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"P-F Dutot","year":"2005","unstructured":"Dutot, P.-F., Netto, M.A.S., Goldman, A., Kon, F.: Scheduling moldable BSP tasks. In: Feitelson, D., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2005. LNCS (LNAI and LNB), vol. 3834, pp. 157\u2013172. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11605300_8"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0022284","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"DG Feitelson","year":"1996","unstructured":"Feitelson, D.G., Rudolph, L.: Toward convergence in job schedulers for parallel supercomputers. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1996. LNCS (LNAI and LNB), vol. 1162, pp. 1\u201326. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0022284"},{"key":"8_CR11","unstructured":"Gad, A.F.: Geneticalgorithmpython: Building genetic algorithm in python (2021). https:\/\/github.com\/ahmedfgad\/GeneticAlgorithmPython\/tree\/05a069abf43146e7f8eb37f37c539523bf62ac9a"},{"issue":"14","key":"8_CR12","doi-asserted-by":"publisher","first-page":"2895","DOI":"10.1080\/0020754050056417","volume":"43","author":"SR Hejazi","year":"2005","unstructured":"Hejazi, S.R., Saghafian, S.: Flowshop-scheduling problems with makespan criterion: a review. Int. J. Prod. Res. 43(14), 2895\u20132929 (2005)","journal-title":"Int. J. Prod. Res."},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-60153-8_34","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"RL Henderson","year":"1995","unstructured":"Henderson, R.L.: Job scheduling under the portable batch system. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1995. LNCS (LNAI and LNB), vol. 949, pp. 279\u2013294. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60153-8_34"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/121973.121975","volume":"18","author":"MD Hill","year":"1990","unstructured":"Hill, M.D.: What is scalability? ACM SIGARCH Comput. Archit. News 18(4), 18\u201321 (1990)","journal-title":"ACM SIGARCH Comput. Archit. News"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/10968987_1","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"M Hovestadt","year":"2003","unstructured":"Hovestadt, M., Kao, O., Keller, A., Streit, A.: Scheduling in HPC resource management systems: queuing vs. planning. In: Feitelson, D., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS (LNAI and LNB), vol. 2862, pp. 1\u201320. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/10968987_1"},{"key":"8_CR16","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-40861-8_7","volume-title":"Future Information Technology","author":"K-C Huang","year":"2014","unstructured":"Huang, K.-C., Huang, T.-C., Tsai, M.-J., Chang, H.-Y.: Moldable job scheduling for HPC as a service. In: Park, J., Stojmenovic, I., Choi, M., Xhafa, F. (eds.) Future Information Technology. Lecture Notes in Electrical Engineering, vol. 276, pp. 43\u201348. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-40861-8_7"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Izadkhah, H.: Learning based genetic algorithm for task graph scheduling. Appl. Comput. Intell. Soft Comput. 2019, 15 (2019). Article ID 6543957. https:\/\/doi.org\/10.1155\/2019\/6543957","DOI":"10.1155\/2019\/6543957"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Jansen, K., Land, F.: Scheduling monotone moldable jobs in linear time. In: 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 172\u2013181. IEEE, May 2018","DOI":"10.1109\/IPDPS.2018.00027"},{"issue":"2","key":"8_CR19","first-page":"109434201558102","volume":"30","author":"J Jaros","year":"2015","unstructured":"Jaros, J., Rendell, A.P., Treeby, B.E.: Full-wave nonlinear ultrasound simulation on distributed clusters with applications in high-intensity focused ultrasound. Int. J. High Perform. Comput. Appl. 30(2), 1094342015581024- (2015)","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-030-67077-1_7","volume-title":"High Performance Computing in Science and Engineering","author":"M Jaros","year":"2021","unstructured":"Jaros, M., Sasak, T., Treeby, B.E., Jaros, J.: Estimation of execution parameters for k-wave simulations. In: Kozubek, T., Arbenz, P., Jaro\u0161, J., \u0158\u00edha, L., \u0160\u00edstek, J., Tich\u00fd, P. (eds.) HPCSE 2019. LNCS, vol. 12456, pp. 116\u2013134. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67077-1_7"},{"key":"8_CR21","unstructured":"Klusacek, D., Podolnikova, G., Toth, S.: Complex job scheduling simulations with Alea 4. In: Tan, G. (ed.) Proceedings of the 9th EAI International Conference on Simulation Tools and Techniques, Belgium, pp. 124\u2013129. ICST (2016)"},{"issue":"6","key":"8_CR22","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10009-016-0428-z","volume":"18","author":"A-L Lamprecht","year":"2016","unstructured":"Lamprecht, A.-L., Turner, K.J.: Scientific workflows. Int. J. Softw. Tools Technol. Transf. 18(6), 575\u2013580 (2016)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"6","key":"8_CR23","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"AW Mu\u2019alem","year":"2001","unstructured":"Mu\u2019alem, A.W., Feitelson, D.G.: Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE Trans. Parallel Distrib. Syst. 12(6), 529\u2013543 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.jpdc.2009.09.009","volume":"70","author":"FA Omara","year":"2010","unstructured":"Omara, F.A., Arafa, M.M.: Genetic algorithms for task scheduling problem. J. Parallel Distrib. Comput. 70(1), 13\u201322 (2010)","journal-title":"J. Parallel Distrib. Comput."},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Robert, Y., et al.: Task Graph Scheduling. Encyclopedia of Parallel Computing, pp. 2013\u20132025 (2011)","DOI":"10.1007\/978-0-387-09766-4_42"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Srinivasan, S., Krishnamoorthy, S., Sadayappan, P.: A robust scheduling technology for moldable scheduling of parallel jobs. In: Proceedings IEEE International Conference on Cluster Computing CLUSTR-03, pp. 92\u201399. IEEE (2003)","DOI":"10.1109\/CLUSTR.2003.1253304"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-36180-4_4","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"S Srinivasan","year":"2002","unstructured":"Srinivasan, S., Kettimuthu, R., Subramani, V., Sadayappan, P.: Selective reservation strategies for backfill job scheduling. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS (LNAI and LNB), vol. 2537, pp. 55\u201371. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36180-4_4"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/978-3-662-43505-2_46","volume-title":"Springer Handbook of Computational Intelligence","author":"D Sudholt","year":"2015","unstructured":"Sudholt, D.: Parallel evolutionary algorithms. In: Kacprzyk, J., Pedrycz, W. (eds.) Springer Handbook of Computational Intelligence, pp. 929\u2013959. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-43505-2_46"},{"issue":"6","key":"8_CR29","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s10951-018-0556-2","volume":"21","author":"D Ye","year":"2018","unstructured":"Ye, D., Chen, D.Z., Zhang, G.: Online scheduling of moldable parallel tasks. J. Sched. 21(6), 647\u2013654 (2018)","journal-title":"J. Sched."},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/10968987_3","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"AB Yoo","year":"2003","unstructured":"Yoo, A.B., Jette, M.A., Grondona, M.: SLURM: simple linux utility for resource management. In: Feitelson, D., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS (LNAI and LNB), vol. 2862, pp. 44\u201360. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/10968987_3"}],"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-030-88224-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T04:10:28Z","timestamp":1673410228000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88224-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030882235","9783030882242"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88224-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 October 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jsspp2021","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"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}