{"id":"https://openalex.org/W2979360663","doi":"https://doi.org/10.1109/rtcsa.2019.8864591","title":"Partitioned Scheduling for Dependency Graphs in Multiprocessor Real-Time Systems","display_name":"Partitioned Scheduling for Dependency Graphs in Multiprocessor Real-Time Systems","publication_year":2019,"publication_date":"2019-08-01","ids":{"openalex":"https://openalex.org/W2979360663","doi":"https://doi.org/10.1109/rtcsa.2019.8864591","mag":"2979360663"},"language":"en","primary_location":{"id":"doi:10.1109/rtcsa.2019.8864591","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtcsa.2019.8864591","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 25th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085465875","display_name":"Junjie Shi","orcid":"https://orcid.org/0000-0002-9879-1394"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Junjie Shi","raw_affiliation_strings":["TU Dortmund University, Germany"],"affiliations":[{"raw_affiliation_string":"TU Dortmund University, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081007355","display_name":"Niklas Ueter","orcid":"https://orcid.org/0000-0002-6722-4805"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Niklas Ueter","raw_affiliation_strings":["TU Dortmund University, Germany"],"affiliations":[{"raw_affiliation_string":"TU Dortmund University, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004024181","display_name":"Georg von der Br\u00fcggen","orcid":"https://orcid.org/0000-0002-8137-3612"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Georg von der Bruggen","raw_affiliation_strings":["TU Dortmund University, Germany"],"affiliations":[{"raw_affiliation_string":"TU Dortmund University, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000417436","display_name":"Jian-Jia Chen","orcid":"https://orcid.org/0000-0001-8114-9760"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jian-Jia Chen","raw_affiliation_strings":["TU Dortmund University, Germany"],"affiliations":[{"raw_affiliation_string":"TU Dortmund University, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5085465875"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":0.9631,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74197756,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.874474048614502},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7441936731338501},{"id":"https://openalex.org/keywords/semaphore","display_name":"Semaphore","score":0.6892494559288025},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.6766019463539124},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6365795135498047},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.636475145816803},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6017208695411682},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.551287829875946},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5495811104774475},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4947328269481659},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.47068458795547485},{"id":"https://openalex.org/keywords/gang-scheduling","display_name":"Gang scheduling","score":0.4404796063899994},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.4334027171134949},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.38075268268585205},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.15253615379333496},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09379631280899048},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.0768546462059021}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.874474048614502},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7441936731338501},{"id":"https://openalex.org/C95203288","wikidata":"https://www.wikidata.org/wiki/Q221682","display_name":"Semaphore","level":2,"score":0.6892494559288025},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6766019463539124},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6365795135498047},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.636475145816803},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6017208695411682},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.551287829875946},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5495811104774475},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4947328269481659},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.47068458795547485},{"id":"https://openalex.org/C201515029","wikidata":"https://www.wikidata.org/wiki/Q5520966","display_name":"Gang scheduling","level":5,"score":0.4404796063899994},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.4334027171134949},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.38075268268585205},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.15253615379333496},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09379631280899048},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0768546462059021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rtcsa.2019.8864591","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtcsa.2019.8864591","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 25th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W81942118","https://openalex.org/W1507996685","https://openalex.org/W1559423447","https://openalex.org/W1578961151","https://openalex.org/W1606775714","https://openalex.org/W1905332030","https://openalex.org/W1980687605","https://openalex.org/W2019391999","https://openalex.org/W2026489998","https://openalex.org/W2038141711","https://openalex.org/W2056702206","https://openalex.org/W2081746076","https://openalex.org/W2086012697","https://openalex.org/W2100980563","https://openalex.org/W2104680817","https://openalex.org/W2143006785","https://openalex.org/W2163085705","https://openalex.org/W2164164245","https://openalex.org/W2168231008","https://openalex.org/W2170643076","https://openalex.org/W2467474306","https://openalex.org/W2518040571","https://openalex.org/W2539277544","https://openalex.org/W2567964750","https://openalex.org/W2568034954","https://openalex.org/W2732844046","https://openalex.org/W2757415581","https://openalex.org/W2767582137","https://openalex.org/W2767595070","https://openalex.org/W2786289431","https://openalex.org/W2792504804","https://openalex.org/W2919418351","https://openalex.org/W2964252584","https://openalex.org/W3044911583","https://openalex.org/W6633528148","https://openalex.org/W6636262081","https://openalex.org/W6740786657","https://openalex.org/W6780752570"],"related_works":["https://openalex.org/W2545511463","https://openalex.org/W2956094179","https://openalex.org/W2106332846","https://openalex.org/W2245286458","https://openalex.org/W1545991362","https://openalex.org/W2468395309","https://openalex.org/W27741389","https://openalex.org/W3082963403","https://openalex.org/W2167842822","https://openalex.org/W2081283714"],"abstract_inverted_index":{"Effectively":[0],"handling":[1],"precedence":[2,37],"constraints":[3],"and":[4,50,104,126],"resource":[5,55],"synchronization":[6,56],"is":[7,26,97],"a":[8,32,80,89,137],"challenging":[9,85],"problem":[10],"in":[11,40],"the":[12,46,69,74,101,105,109,121,142],"era":[13],"of":[14,83,92,108,123],"multiprocessor":[15,51,144],"systems":[16],"even":[17],"with":[18,36],"massively":[19],"parallel":[20],"computation":[21],"power.":[22],"One":[23],"common":[24],"approach":[25],"to":[27,31,65,68,117,141],"apply":[28],"list":[29,75],"scheduling":[30,53,86,146],"given":[33],"task":[34,48,90],"graph":[35],"constraints.":[38],"However,":[39],"some":[41],"application":[42],"scenarios,":[43],"such":[44],"as":[45],"OpenMP":[47],"model":[49],"partitioned":[52,145],"for":[54],"using":[57],"binary":[58],"semaphores,":[59],"several":[60],"operations":[61],"can":[62],"be":[63,66],"forced":[64],"tied":[67],"same":[70,102],"processor,":[71],"which":[72],"invalidates":[73],"scheduling.":[76],"This":[77],"paper":[78],"studies":[79],"special":[81],"case":[82],"this":[84],"problem,":[87],"where":[88],"comprised":[91],"(at":[93],"most)":[94],"three":[95],"subtasks":[96,107],"executed":[98],"sequentially":[99],"on":[100],"processor":[103],"second":[106],"tasks":[110],"may":[111],"have":[112],"sequential":[113],"dependencies,":[114],"e.g.,":[115],"due":[116],"synchronization.":[118],"We":[119],"demonstrate":[120],"limits":[122],"existing":[124,143],"algorithms":[125],"provide":[127],"effective":[128],"heuristics":[129],"considering":[130],"preemptive":[131],"execution.":[132],"The":[133],"evaluation":[134],"results":[135],"show":[136],"significant":[138],"improvement,":[139],"compared":[140],"strategies.":[147]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}