{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:19Z","timestamp":1740099619693,"version":"3.37.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030337483"},{"type":"electronic","value":"9783030337490"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-33749-0_22","type":"book-chapter","created":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T06:02:39Z","timestamp":1572069759000},"page":"262-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Task Graphs Scheduling Based on the Internal Structure"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6867-9414","authenticated-orcid":false,"given":"Apolinar","family":"Velarde Mart\u00ednez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,27]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1016\/j.jpdc.2013.08.007","volume":"73","author":"L Briceno","year":"2013","unstructured":"Briceno, L., et al.: Robust static resource allocation of DAGs in a heterogeneous multicore system. Parallel Distrib. Comput. 73, 1705\u20131717 (2013). \n                      https:\/\/doi.org\/10.1016\/j.jpdc.2013.08.007","journal-title":"Parallel Distrib. Comput."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Qamhieh, M., Fauberteau, F., George, L., Midonnet, S.: Global EDF scheduling of directed acyclic graphs on multiprocessor systems. In: Proceedings of the 21st International Conference on Real-Time NET Study and Systems, Sophia Antipolis, France, pp. 287\u2013296 (2013)","DOI":"10.1145\/2516821.2516836"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.future.2009.11.005","volume":"26","author":"F Xhafa","year":"2010","unstructured":"Xhafa, F., Abraham, A.: Computational models and heuristic methods for grid scheduling problems. Future Gener. Comput. Syst. 26, 608\u2013621 (2010). \n                      https:\/\/doi.org\/10.1016\/j.future.2009.11.005","journal-title":"Future Gener. Comput. Syst."},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"1673","DOI":"10.1016\/j.jpdc.2013.07.019","volume":"73","author":"W Zheng","year":"2013","unstructured":"Zheng, W., Sakellariou, R.: Stochastic DAG scheduling using a Monte Carlo approach. J. Parallel Distrib. Comput. 73, 1673\u20131689 (2013). \n                      https:\/\/doi.org\/10.1016\/j.jpdc.2013.07.019","journal-title":"J. Parallel Distrib. Comput."},{"key":"22_CR5","doi-asserted-by":"publisher","unstructured":"Takp\u00e9, T.N., 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, United States, July 2006 (2006). \n                      https:\/\/doi.org\/10.1109\/ICPADS.2006.32","DOI":"10.1109\/ICPADS.2006.32"},{"key":"22_CR6","doi-asserted-by":"publisher","unstructured":"Rahman, M., Venugopal, S., Buyya, R.: A dynamic critical path algorithm for scheduling scientific workflow applications on global grids. In: Third IEEE International Conference on e-Science and Grid Computing (e-Science 2007), Minneapolis, United States, 10\u201313 December (2007). \n                      https:\/\/doi.org\/10.1109\/E-SCIENCE.2007.3","DOI":"10.1109\/E-SCIENCE.2007.3"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"2322","DOI":"10.1016\/j.cor.2013.03.015","volume":"40","author":"A Badawi","year":"2013","unstructured":"Badawi, A., Shatnawi, A.: Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization. Comput. Oper. Res. 40, 2322\u20132328 (2013). \n                      https:\/\/doi.org\/10.1016\/j.cor.2013.03.015","journal-title":"Comput. Oper. Res."},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.parco.2012.01.001","volume":"38","author":"MA Khan","year":"2012","unstructured":"Khan, M.A.: Scheduling for heterogeneous systems using constrained critical paths. Parallel Comput. 38, 175\u2013193 (2012). \n                      https:\/\/doi.org\/10.1016\/j.parco.2012.01.001","journal-title":"Parallel Comput."},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.eswa.2016.05.014","volume":"60","author":"M Akbari","year":"2016","unstructured":"Akbari, M., Rashidi, H.: A multi-objectives scheduling algorithm based on cuckoo optimization for task allocation problem at compile time in heterogeneous systems. Expert Syst. Appl. 60, 234\u2013248 (2016). \n                      https:\/\/doi.org\/10.1016\/j.eswa.2016.05.014","journal-title":"Expert Syst. Appl."},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.jocs.2016.09.008","volume":"26","author":"S Yu","year":"2018","unstructured":"Yu, S., Li, K., Xu, Y.: A DAG task scheduling scheme on heterogeneous cluster systems using discrete IWO algorithm. J. Comput. Sci. 26, 307\u2013317 (2018). \n                      https:\/\/doi.org\/10.1016\/j.jocs.2016.09.008","journal-title":"J. Comput. Sci."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/978-3-030-01174-1_61","volume":"1","author":"A Velarde","year":"2018","unstructured":"Velarde, A.: Random generation of directed acyclic graphs for planning and allocation tasks in heterogeneous distributed computing systems. J. Comput. Sci. 1, 793\u2013802 (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-01174-1_61","journal-title":"J. Comput. Sci."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/S0950-5849(02)00025-3","volume":"44","author":"DH Chang","year":"2002","unstructured":"Chang, D.H., Son, J.H., Kim, M.H.: Critical path identification in the context of a workflow. Inf. Softw. Technol. 44, 405\u2013417 (2002). \n                      https:\/\/doi.org\/10.1016\/S0950-5849(02)00025-3","journal-title":"Inf. Softw. Technol."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ins.2014.02.122","volume":"270","author":"Y Xu","year":"2014","unstructured":"Xu, Y., Li, K., Hu, J., Li, K.: A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues. Inf. Sci. 270, 255\u2013287 (2014). \n                      https:\/\/doi.org\/10.1016\/j.ins.2014.02.122","journal-title":"Inf. Sci."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1016\/j.dam.2005.05.023","volume":"154","author":"S Nikolov","year":"2006","unstructured":"Nikolov, S., Tarassov, A.: Graph layering by promotion of nodes. Discrete Appl. Math. 154, 848\u2013860 (2006). \n                      https:\/\/doi.org\/10.1016\/j.dam.2005.05.023","journal-title":"Discrete Appl. Math."},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45848-4_2","volume-title":"Graph Drawing","author":"P Healy","year":"2002","unstructured":"Healy, P., Nikolov, N.S.: How to layer a directed acyclic graph. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 16\u201330. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-45848-4_2"},{"key":"22_CR16","unstructured":"Brownlee, J.: How to Layer a Directed Acyclic Graph (2011)"},{"key":"22_CR17","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/978-3-030-01174-1_61","volume-title":"Intelligent Computing","author":"A Velarde Martinez","year":"2019","unstructured":"Velarde Martinez, A.: Random generation of directed acyclic graphs for planning and allocation tasks in heterogeneous distributed computing systems. In: Arai, K., Kapoor, S., Bhatia, R. (eds.) SAI 2018. AISC, vol. 858, pp. 793\u2013802. Springer, Cham (2019). \n                      https:\/\/doi.org\/10.1007\/978-3-030-01174-1_61"}],"container-title":["Lecture Notes in Computer Science","Advances in Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33749-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T06:19:43Z","timestamp":1572070783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33749-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030337483","9783030337490"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33749-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"27 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xalapa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"micai2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.micai.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}