{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:59:18Z","timestamp":1743001158663,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811600098"},{"type":"electronic","value":"9789811600104"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-981-16-0010-4_35","type":"book-chapter","created":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:19:49Z","timestamp":1612829989000},"page":"405-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["SPORTS: A Semi-partitioned Real-Time Scheduler for Heterogeneous Multicore Platforms"],"prefix":"10.1007","author":[{"given":"Yanshul","family":"Sharma","sequence":"first","affiliation":[]},{"given":"Zinea","family":"Das","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Moulik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,7]]},"reference":[{"key":"35_CR1","unstructured":"Baruah, S.: Feasibility analysis of preemptive real-time systems upon heterogeneous multiprocessor platforms. In: IEEE RTSS, pp. 37\u201346 (2004)"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Baruah, S.K., Bonifaci, V., Bruni, R., Marchetti-Spaccamela, A.: ILP-based approaches to partitioning recurrent workloads upon heterogeneous multiprocessors. In: ECRTS, pp. 215\u2013225 (2016)","DOI":"10.1109\/ECRTS.2016.10"},{"key":"35_CR3","unstructured":"Bastoni, A., Brandenburg, B.B., Anderson, J.H.: Cache-related preemption and migration delays: empirical approximation and impact on schedulability. In: OSPERT (2010)"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Bertout, A., Goossens, J., Grolleau, E., Poczekajlo, X.: Template schedule construction for global real-time scheduling on unrelated multiprocessor platforms. In: DATE, pp. 216\u2013221 (2020)","DOI":"10.23919\/DATE48585.2020.9116409"},{"issue":"2","key":"35_CR5","first-page":"1","volume":"39","author":"N Binkert","year":"2011","unstructured":"Binkert, N., et al.: The gem5 simulator. ACM SIGARCH 39(2), 1\u20137 (2011)","journal-title":"ACM SIGARCH"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Bygde, S., Ermedahl, A., Lisper, B.: An efficient algorithm for parametric WCET calculation. In: IEEE RTCSA, pp. 13\u201321, August 2009","DOI":"10.1109\/RTCSA.2009.9"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, B., Baruah, S.: A lookup-table driven approach to partitioned scheduling. In: IEEE RTAS, pp. 257\u2013265 (2011)","DOI":"10.1109\/RTAS.2011.32"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Chwa, H.S., Seo, J., Lee, J., Shin, I.: Optimal real-time scheduling on two-type heterogeneous multicore platforms. In: IEEE RTSS, pp. 119\u2013129, December 2015","DOI":"10.1109\/RTSS.2015.19"},{"issue":"5","key":"35_CR9","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s11241-011-9130-0","volume":"47","author":"S Funk","year":"2011","unstructured":"Funk, S., Levin, G., Sadowski, C., Pye, I., Brandt, S.: DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling. Real-Time Syst. 47(5), 389\u2013429 (2011). https:\/\/doi.org\/10.1007\/s11241-011-9130-0","journal-title":"Real-Time Syst."},{"key":"35_CR10","unstructured":"Gustafsson, J., Betts, A., Ermedahl, A., Lisper, B.: The M\u00e4lardalen WCET benchmarks - past, present and future. In: Lisper, B. (ed.) WCET, pp. 137\u2013147. OCG, Brussels, Belgium, July 2010"},{"key":"35_CR11","doi-asserted-by":"publisher","unstructured":"Moulik, S., Sarkar, A., Kapoor, H.K.: DPFair scheduling with slowdown and suspension. In: 2018 31st International Conference on VLSI Design and 2018 17th International Conference on Embedded Systems (VLSID), pp. 43\u201348 (2018). https:\/\/doi.org\/10.1109\/VLSID.2018.35","DOI":"10.1109\/VLSID.2018.35"},{"key":"35_CR12","doi-asserted-by":"publisher","unstructured":"Moulik, S., Chaudhary, R., Das, Z.: HEARS: a heterogeneous energy-aware real-time scheduler. Microprocess. Microsyst. 72, 102939 (2020). https:\/\/doi.org\/10.1016\/j.micpro.2019.102939, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0141933119302017","DOI":"10.1016\/j.micpro.2019.102939"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Moulik, S., Devaraj, R., Sarkar, A.: COST: a cluster-oriented scheduling technique for heterogeneous multi-cores. In: IEEE SMC, pp. 1951\u20131957. IEEE (2018)","DOI":"10.1109\/SMC.2018.00337"},{"key":"35_CR14","doi-asserted-by":"publisher","unstructured":"Moulik, S., Sarkar, A., Kapoor, H.K.: Energy aware frame based fair scheduling. Sustain. Comput. Inf. Syst. 18, 66\u201377 (2018). https:\/\/doi.org\/10.1016\/j.suscom.2018.03.003, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S2210537917300549","DOI":"10.1016\/j.suscom.2018.03.003"},{"key":"35_CR15","doi-asserted-by":"publisher","unstructured":"Moulik, S., Sarkar, A., Kapoor, H.K.: Tarts: a temperature-aware real-time deadline-partitioned fair scheduler. J. Syst. Archit., 101847 (2020). https:\/\/doi.org\/10.1016\/j.sysarc.2020.101847, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1383762120301351","DOI":"10.1016\/j.sysarc.2020.101847"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s11241-013-9191-3","volume":"50","author":"G Raravi","year":"2014","unstructured":"Raravi, G., Andersson, B., N\u00e9lis, V., Bletsas, K.: Task assignment algorithms for two-type heterogeneous multiprocessors. Real-Time Syst. 50, 87\u2013141 (2014). https:\/\/doi.org\/10.1007\/s11241-013-9191-3","journal-title":"Real-Time Syst."},{"key":"35_CR17","unstructured":"University, P.: Princeton application repository for shared-memory computers (PARSEC). http:\/\/parsec.cs.princeton.edu"}],"container-title":["Communications in Computer and Information Science","Parallel Architectures, Algorithms and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-0010-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T14:41:34Z","timestamp":1617288094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-16-0010-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811600098","9789811600104"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-0010-4_35","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Parallel Architectures, Algorithms and Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"paap2020","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 (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"37","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":"49% - 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","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":"6","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)"}}]}}