{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:46:42Z","timestamp":1742978802125,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030150921"},{"type":"electronic","value":"9783030150938"}],"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-15093-8_23","type":"book-chapter","created":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T13:07:46Z","timestamp":1552568866000},"page":"323-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["GA-Based Mapping and Scheduling of HSDF Graphs on Multiprocessor Platforms"],"prefix":"10.1007","author":[{"given":"Hao","family":"Wu","sequence":"first","affiliation":[]},{"given":"Nenggan","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zonghua","family":"Gu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,15]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Liu, W., Yuan, M., He, X., Gu, Z.: Efficient SAT-based mapping and scheduling of homogeneous synchronous dataflow graphs for throughput optimization. In: Real-Time Systems Symposium (RTSS), pp. 492\u2013504 (2008)","DOI":"10.1109\/RTSS.2008.49"},{"issue":"3","key":"23_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/LES.2009.2039851","volume":"1","author":"W Liu","year":"2009","unstructured":"Liu, W., Gu, Z., Xu, J.: Efficient software synthesis for dynamic single appearance scheduling of synchronous dataflow. IEEE Embed. Syst. Lett. 1(3), 69\u201372 (2009)","journal-title":"IEEE Embed. Syst. Lett."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Liu, W., Gu, Z., Xu, J., et al.: An efficient technique for analysis of minimal buffer requirements of synchronous dataflow graphs with model checking. In: IEEE\/ACM International Conference on Hardware\/Software Codesign and System Synthesis (CODES-ISSS), pp. 61\u201370 (2009)","DOI":"10.1145\/1629435.1629445"},{"issue":"8","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1382","DOI":"10.1109\/TPDS.2010.204","volume":"22","author":"W Liu","year":"2011","unstructured":"Liu, W., Gu, Z., Xu, J., et al.: Satisfiability modulo graph theory for task mapping and scheduling on multiprocessor systems. IEEE Trans. Parallel Distrib. Syst. 22(8), 1382\u20131389 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Liu, W., Gu, Z., Ye, Y.: Efficient SAT-based application mapping and scheduling on multiprocessor systems for throughput maximization. In: Compilers, Architecture and Synthesis for Embedded Systems (CASES), pp. 127\u2013136 (2015)","DOI":"10.1109\/CASES.2015.7324553"},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/12.73588","volume":"40","author":"KK Parhi","year":"1991","unstructured":"Parhi, K.K., Messerschmitt, D.G.: Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding. IEEE Trans. Comput. 40(2), 178\u2013195 (1991)","journal-title":"IEEE Trans. Comput."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Satish, N., Ravindran, K., Keutzer, K.: A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multiprocessors. In: DATE 2007, pp. 57\u201362 (2007)","DOI":"10.1109\/DATE.2007.364567"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Metzner, A., Herde, C.: RTSAT\u2013an optimal and efficient approach to the task allocation problem in distributed architectures. In: RTSS 2006, pp. 147\u2013158 (2006)","DOI":"10.1109\/RTSS.2006.44"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Stuijk, S., Geilen, M., Basten, T.: Exploring tradeoffs in buffer requirements and throughput constraints for synchronous dataflow graphs. In: DAC 2006, pp. 899\u2013904 (2006)","DOI":"10.1109\/DAC.2006.229409"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Stuijk, S., Basten, T., Geilen, M., Corporaal, H.: Multiprocessor resource allocation for throughput-constrained synchronous dataflow graphs. In: DAC 2007, pp. 777\u2013782 (2007)","DOI":"10.1109\/DAC.2007.375269"},{"key":"23_CR11","unstructured":"Dasdan, A., Gupta, R.K.: Faster maximum and minimum mean cycle algorithms for system-performance analysis. IEEE Trans. CAD Integr. Circ. Syst. 17(10), 889\u2013899 (1998)"},{"key":"23_CR12","unstructured":"Stuijk, S., Geilen, M., Basten, T.: SDF3: SDF for free. In: ACSD 2006, pp. 276\u2013278 (2006)"},{"key":"23_CR13","unstructured":"Sorensson, N., Een, N.: Minisat v1. 13-a sat solver with conflict-clause minimization. In: SAT 2005, pp. 1\u20132 (2005)"}],"container-title":["Lecture Notes in Computer Science","Green, Pervasive, and Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15093-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:36:55Z","timestamp":1558341415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15093-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030150921","9783030150938"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15093-8_23","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":"15 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Green, Pervasive, and Cloud Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gpc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - 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"}},{"value":"2.50","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.51","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}