{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:27:30Z","timestamp":1742912850001,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031217524"},{"type":"electronic","value":"9783031217531"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-21753-1_17","type":"book-chapter","created":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T10:02:32Z","timestamp":1668938552000},"page":"170-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Duplication Scheduling with\u00a0Bottom-Up Top-Down Recursive Neural Network"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5774-1550","authenticated-orcid":false,"given":"Vahab","family":"Samandi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2330-128X","authenticated-orcid":false,"given":"Peter","family":"Ti\u0148o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1139-5795","authenticated-orcid":false,"given":"Rami","family":"Bahsoon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,21]]},"reference":[{"key":"17_CR1","first-page":"593","volume":"314","author":"GB Berriman","year":"2004","unstructured":"Berriman, G.B., et al.: Montage: a grid enabled image mosaic service for the national virtual observatory. Astronom. Data Analysis Softw. Systs. 314, 593 (2004)","journal-title":"Astronom. Data Analysis Softw. Systs."},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Bottou, L.: From machine learning to machine reasoning. Technical report. arXiv. 1102.1808. pp. 394\u2013396 (2011). https:\/\/doi.org\/10.48550\/arXiv.1102.1808","DOI":"10.48550\/arXiv.1102.1808"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Bozdag, D., Ozguner, F., Ekici, E., Catalyurek, U.A.: task duplication based scheduling algorithm using partial schedules, In: International Conference on Parallel Processing, pp. 630\u2013637 (2005). https:\/\/doi.org\/10.1109\/ICPP.2005.15","DOI":"10.1109\/ICPP.2005.15"},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"Calheiros, R. N., Ranjan, R., Beloglazov, A., De Rose, C. A. F., Buyya, R., CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. Softw. Pract. Exper. Vol. 41, 1, pp. 23\u201350. (2011). https:\/\/doi.org\/10.1002\/spe.995","DOI":"10.1002\/spe.995"},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Darbha, S., Agrawal, D.P.: A fast and scalable scheduling algorithm for distributed memory systems. In: Proceedings Seventh IEEE Symposium on Parallel and Distributed Processing, pp. 60\u201363 (1995). https:\/\/doi.org\/10.1109\/SPDP.1995.530665","DOI":"10.1109\/SPDP.1995.530665"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Deelman, E.: The future of scientific workflows. Int. J. High Performance Comput. Appl. 32(1), 159\u2013175 (2018)","DOI":"10.1177\/1094342017704893"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Ferreira da Silva, R., Filgueira, R., Pietri, I., Jiang, M., Sakellariou, R., Deelman, E.: A Characterization of Work-flow Management Systems for Extreme-Scale Applications. Future Gen. Comput. Syst. 5, 228\u2013238 (2017)","DOI":"10.1016\/j.future.2017.02.026"},{"key":"17_CR8","unstructured":"Frasconi, P., Gori, M., Sperduti, A.: On the efficient classification of data structures by neural networks. In: Proceedings of the Fifteenth International Joint Conference on Artifical Intelligence - Volume 2, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp. 1066\u20131071 (1997)"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Ishfaq, A., Yu-Kwong, K.: On exploiting task duplication in parallel program schedulingIEEE . Trans. Parallel Distrib. Syst. 9(9), 872\u2013892 (1998). https:\/\/doi.org\/10.1109\/71.722221","DOI":"10.1109\/71.722221"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Juve, G., Chervenak, A., Deelman, E., Bharathi, S., Mehta, G., Vahi, K.: Characterizing and profiling scientific workflows. Future Gen. Comput. Syst. 29(3), 682\u2013692 (2013). https:\/\/doi.org\/10.1016\/j.future.2012.08.015","DOI":"10.1016\/j.future.2012.08.015"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Kruatrachue, B., Lewis, T.: Grain size determination for parallel processing. IEEE Softw. 5(1), 23\u201332 (1988). https:\/\/doi.org\/10.1109\/52.1991","DOI":"10.1109\/52.1991"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Li, G., Chen, D., Wang, D., Zhang, D.: Task clustering and scheduling to multiprocessors with duplication, In: Proceedings International Parallel and Distributed Processing Symposium, pp. 8 (2003). https:\/\/doi.org\/10.1109\/IPDPS.2003.1213079","DOI":"10.1109\/IPDPS.2003.1213079"},{"issue":"1\u20132","key":"17_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0004-3702(90)90005-K","volume":"46","author":"JB Pollack","year":"1990","unstructured":"Pollack, J.B.: Recursive distributed representations. Artif. Intell. 46(1\u20132), 77\u2013105 (1990). https:\/\/doi.org\/10.1016\/0004-3702(90)90005-K","journal-title":"Artif. Intell."},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/0743-7315(90)90014-G","volume":"10","author":"B Shirazi","year":"1990","unstructured":"Shirazi, B., Wang, M., Pathak, G.: Analysis and evaluation of heuristic methods for static task scheduling. J. Parallel Distrib. Comput. 10(3), 222\u2013232 (1990). https:\/\/doi.org\/10.1016\/0743-7315(90)90014-G","journal-title":"J. Parallel Distrib. Comput."},{"key":"17_CR15","unstructured":"Socher, R., Huang, E.H., Pennington, J., Ng, A.Y., Manning, C.D.: Dynamic pooling and unfolding recursive autoencoders for paraphrase detection, In: Proceedings of the 24th International Conference on Neural Information Processing Systems, Curran Associates Inc., Red Hook, NY, USA, pp. 801\u2013809 (2011)"},{"key":"17_CR16","unstructured":"Socher, R., Perelygin, A., Wu, J., Chuang, J., Manning, C. D., Ng, A., Potts, C.: Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank, In: Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics, Seattle, Washington, USA, pp. 1631\u20131642 (2013)"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Sperduti, A., Starita, A.: Supervised neural networks for the classification of structures. IEEE Trans. Neural Netw. 8(3), 714\u2013735 (1997). https:\/\/doi.org\/10.1109\/72.572108","DOI":"10.1109\/72.572108"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Yao, F., Pu, C., Zhang, Z.: Task Duplication-Based Scheduling Algorithm for Budget-Constrained Workflows in Cloud Computing. IEEE Access 9, 37262\u201337272 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3063456","DOI":"10.1109\/ACCESS.2021.3063456"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Yeh-Ching C., Ranka, S.: Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors, In: Proceedings of the ACM\/IEEE Conference on Supercomputing, pp. 512\u2013521 (1992). https:\/\/doi.org\/10.1109\/SUPERC.1992.236653","DOI":"10.1109\/SUPERC.1992.236653"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21753-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:13:40Z","timestamp":1710332020000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21753-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031217524","9783031217531"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21753-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDEAL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Data Engineering and Automated Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Manchester","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ideal2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ideal-conf.com\/","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":"79","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":"52","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":"66% - 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":"2.9","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":"2.1","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}