{"id":"https://openalex.org/W2768955321","doi":"https://doi.org/10.1109/tpds.2017.2777449","title":"Scheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms","display_name":"Scheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms","publication_year":2017,"publication_date":"2017-11-24","ids":{"openalex":"https://openalex.org/W2768955321","doi":"https://doi.org/10.1109/tpds.2017.2777449","mag":"2768955321"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2017.2777449","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2017.2777449","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-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/A5057249018","display_name":"Risat Mahmud Pathan","orcid":"https://orcid.org/0000-0002-9902-7558"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Risat Pathan","raw_affiliation_strings":["Department of Computer Science and Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037393563","display_name":"Petros Voudouris","orcid":"https://orcid.org/0000-0002-6664-2028"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Petros Voudouris","raw_affiliation_strings":["Department of Computer Science and Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103284108","display_name":"Per Stenstr\u00f6m","orcid":"https://orcid.org/0000-0002-4280-3843"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Per Stenstrom","raw_affiliation_strings":["Department of Computer Science and Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057249018"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":3.6051,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.94689844,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"29","issue":"4","first_page":"915","last_page":"928"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9995999932289124,"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.9995999932289124,"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.9976999759674072,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9937000274658203,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8613592386245728},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.8178969621658325},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7024641036987305},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.5742082595825195},{"id":"https://openalex.org/keywords/worst-case-execution-time","display_name":"Worst-case execution time","score":0.5412189364433289},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.531121015548706},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5233206748962402},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5142988562583923},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.4655704200267792},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.46245431900024414},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.4493010938167572},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4452713429927826},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4452539086341858},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.23666885495185852},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.1523348093032837},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14592313766479492},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.12592530250549316},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.07627928256988525},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.06715255975723267}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8613592386245728},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.8178969621658325},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7024641036987305},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.5742082595825195},{"id":"https://openalex.org/C200130814","wikidata":"https://www.wikidata.org/wiki/Q362858","display_name":"Worst-case execution time","level":3,"score":0.5412189364433289},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.531121015548706},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5233206748962402},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5142988562583923},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.4655704200267792},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.46245431900024414},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.4493010938167572},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4452713429927826},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4452539086341858},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.23666885495185852},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.1523348093032837},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14592313766479492},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.12592530250549316},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.07627928256988525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06715255975723267},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tpds.2017.2777449","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2017.2777449","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},{"id":"pmh:oai:research.chalmers.se:501421","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/501421","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W127806875","https://openalex.org/W1625622590","https://openalex.org/W1977289603","https://openalex.org/W1982587869","https://openalex.org/W2016559894","https://openalex.org/W2044949390","https://openalex.org/W2081746076","https://openalex.org/W2092826427","https://openalex.org/W2093752441","https://openalex.org/W2095126271","https://openalex.org/W2104680817","https://openalex.org/W2116581888","https://openalex.org/W2124888010","https://openalex.org/W2137702271","https://openalex.org/W2137784941","https://openalex.org/W2141440050","https://openalex.org/W2149294210","https://openalex.org/W2150871235","https://openalex.org/W2154907168","https://openalex.org/W2156316099","https://openalex.org/W2170091282","https://openalex.org/W2277451201","https://openalex.org/W2568058857","https://openalex.org/W3145128584","https://openalex.org/W4210727445","https://openalex.org/W6605240591"],"related_works":["https://openalex.org/W2337195301","https://openalex.org/W4308087753","https://openalex.org/W2731107721","https://openalex.org/W2997221951","https://openalex.org/W1540780822","https://openalex.org/W2048711644","https://openalex.org/W2118368532","https://openalex.org/W43050934","https://openalex.org/W2132215926","https://openalex.org/W1986789817"],"abstract_inverted_index":{"We":[0,141,171],"consider":[1],"the":[2,46,65,107,163,189],"scheduling":[3,97,193],"of":[4,14,33,48,62,67,83],"a":[5,12,20,26,31,89,102,112,128,138,143],"real-time":[6],"application":[7],"that":[8,84,161,173],"is":[9,25,87,100,155,159,177],"modeled":[10],"as":[11],"collection":[13],"parallel":[15,196],"and":[16,43,80,111],"recurrent":[17,134],"tasks":[18,136,164],"on":[19,137],"multicore":[21,139],"platform.":[22,140],"Each":[23,56,77],"task":[24,57,79,86,110,198],"directed-acyclic":[27],"graph":[28],"(DAG)":[29],"having":[30],"set":[32],"subtasks":[34,51],"(i.e.,":[35,40],"nodes)":[36],"with":[37],"precedence":[38],"constraints":[39],"directed":[41],"edges)":[42],"must":[44],"complete":[45],"execution":[47],"all":[49,162],"its":[50,116],"by":[52,72],"some":[53,73],"specified":[54],"deadline.":[55],"generates":[58],"potentially":[59],"infinite":[60],"number":[61],"instances":[63,69],"where":[64],"releases":[66],"consecutive":[68],"are":[70],"separated":[71],"minimum":[74],"inter-arrival":[75],"time.":[76],"DAG":[78,85,135,197],"each":[81],"subtask":[82,118],"assigned":[88],"fixed":[90],"priority.":[91],"A":[92],"two-level":[93,129,149],"preemptive":[94],"global":[95],"fixed-priority":[96],"(GFP)":[98],"policy":[99],"proposed:":[101],"task-level":[103],"scheduler":[104,131],"first":[105],"determines":[106],"highest-priority":[108,117],"ready":[109],"subtask-level":[113],"schedulerthen":[114],"selects":[115],"for":[119,146],"execution.":[120],"To":[121],"our":[122,147,174],"knowledge,":[123],"no":[124],"earlier":[125],"work":[126],"considers":[127],"GFP":[130,150],"to":[132],"schedule":[133],"derive":[142],"schedulability":[144],"test":[145,154,176,191],"proposed":[148,175],"scheduler.":[151],"If":[152],"this":[153],"satisfied,":[156],"then":[157],"it":[158],"guaranteed":[160],"will":[165],"meet":[166],"their":[167],"deadlines":[168],"under":[169],"GFP.":[170],"show":[172],"not":[178],"only":[179],"theoretically":[180],"better":[181,187],"but":[182],"also":[183],"empirically":[184],"performs":[185],"much":[186],"than":[188],"state-of-the-art":[190],"in":[192],"randomly":[194],"generated":[195],"sets.":[199]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}