{"id":"https://openalex.org/W2809066451","doi":"https://doi.org/10.1109/tii.2018.2848879","title":"A Comparison of Partitioning Strategies for Fixed Points Based Limited Preemptive Scheduling","display_name":"A Comparison of Partitioning Strategies for Fixed Points Based Limited Preemptive Scheduling","publication_year":2018,"publication_date":"2018-06-18","ids":{"openalex":"https://openalex.org/W2809066451","doi":"https://doi.org/10.1109/tii.2018.2848879","mag":"2809066451"},"language":"en","primary_location":{"id":"doi:10.1109/tii.2018.2848879","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tii.2018.2848879","pdf_url":null,"source":{"id":"https://openalex.org/S184777250","display_name":"IEEE Transactions on Industrial Informatics","issn_l":"1551-3203","issn":["1551-3203","1941-0050"],"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 Industrial Informatics","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/A5103145523","display_name":"Filip Markovi\u0107","orcid":"https://orcid.org/0000-0002-3210-3819"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Filip Markovic","raw_affiliation_strings":["Department of Innovation, Design and Engineering, M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-3210-3819","affiliations":[{"raw_affiliation_string":"Department of Innovation, Design and Engineering, M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035488847","display_name":"Jan Carlson","orcid":"https://orcid.org/0000-0002-8461-0230"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Jan Carlson","raw_affiliation_strings":["Department of Innovation, Design and Engineering, M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-8461-0230","affiliations":[{"raw_affiliation_string":"Department of Innovation, Design and Engineering, M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042061810","display_name":"Radu Dobrin","orcid":"https://orcid.org/0000-0002-3336-0091"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Radu Dobrin","raw_affiliation_strings":["Department of Innovation, Design and Engineering, M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Innovation, Design and Engineering, M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I82509713"],"apc_list":null,"apc_paid":null,"fwci":0.2306,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.4942487,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":"2","first_page":"1070","last_page":"1081"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998000264167786,"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.9998000264167786,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9824000000953674,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9751999974250793,"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/preemption","display_name":"Preemption","score":0.8066981434822083},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7849727869033813},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6942190527915955},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6667125225067139},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6061761379241943},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5433138608932495},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.49402981996536255},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4917431175708771},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.4154527485370636},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4104650318622589},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.40580490231513977},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2167404592037201},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11713847517967224},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.10606220364570618}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.8066981434822083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7849727869033813},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6942190527915955},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6667125225067139},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6061761379241943},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5433138608932495},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.49402981996536255},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4917431175708771},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.4154527485370636},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4104650318622589},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.40580490231513977},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2167404592037201},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11713847517967224},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.10606220364570618},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"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/tii.2018.2848879","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tii.2018.2848879","pdf_url":null,"source":{"id":"https://openalex.org/S184777250","display_name":"IEEE Transactions on Industrial Informatics","issn_l":"1551-3203","issn":["1551-3203","1941-0050"],"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 Industrial Informatics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.5799999833106995,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1507996685","https://openalex.org/W1595545560","https://openalex.org/W2050474377","https://openalex.org/W2065728140","https://openalex.org/W2088046398","https://openalex.org/W2095767651","https://openalex.org/W2096147951","https://openalex.org/W2118321561","https://openalex.org/W2136259863","https://openalex.org/W2138356622","https://openalex.org/W2139839994","https://openalex.org/W2140007886","https://openalex.org/W2141849939","https://openalex.org/W2148070634","https://openalex.org/W2161734639","https://openalex.org/W2166318031","https://openalex.org/W2166417881","https://openalex.org/W2585454154"],"related_works":["https://openalex.org/W1808297645","https://openalex.org/W2137597833","https://openalex.org/W1993569236","https://openalex.org/W2143547481","https://openalex.org/W2166318031","https://openalex.org/W1977723594","https://openalex.org/W2148070634","https://openalex.org/W2905579395","https://openalex.org/W2098093492","https://openalex.org/W2171372660","https://openalex.org/W3008082241","https://openalex.org/W1570857951","https://openalex.org/W2791800383","https://openalex.org/W1997975617","https://openalex.org/W2034545765","https://openalex.org/W2748998493","https://openalex.org/W2008890181","https://openalex.org/W2095540735","https://openalex.org/W3211182919","https://openalex.org/W2946163771"],"abstract_inverted_index":{"The":[0,219,263],"increasing":[1],"industrial":[2],"demand":[3],"for":[4,15,58,161,259],"handling":[5],"complex":[6,31],"functionalities":[7],"has":[8,84,94,112],"influenced":[9],"the":[10,21,27,35,49,55,62,101,107,137,151,172,175,187,190,198,229,238,241,246,256,268],"design":[11],"of":[12,29,54,174,189,281],"hardware":[13],"architectures":[14],"time":[16],"critical":[17],"embedded":[18],"systems,":[19],"during":[20],"past":[22],"decade.":[23],"Multicore":[24],"systems":[25,68,146],"facilitate":[26],"inclusion":[28],"many":[30],"functionalities,":[32],"while,":[33],"at":[34],"same":[36],"time,":[37],"inducing":[38],"cache":[39,63],"related":[40,64],"overheads,":[41],"as":[42,44,91,93],"well":[43,92],"adding":[45],"partitioning":[46,108,163,199,234,248,270],"complexity":[47],"to":[48,87,106,116,120,135,149,185,255],"overall":[50,152,257],"system":[51,153],"schedulability.":[52,154],"One":[53],"efficient":[56],"paradigms":[57],"controlling":[59],"and":[60,98,139,164,209,213,215,275],"reducing":[61],"costs":[65],"in":[66,100,124,147,228,279],"real-time":[67,145],"is":[69,169],"limited":[70],"preemptive":[71,274],"scheduling":[72,81,111,141,278],"(LPS),":[73],"with":[74,253],"its":[75],"particular":[76],"instance":[77],"fixed":[78],"preemption":[79,127,165],"points":[80],"(LP-FPPS),":[82],"which":[83,168],"been":[85,95,113],"shown":[86],"outperform":[88,272],"other":[89],"alternatives":[90],"supported":[96],"by":[97],"investigated":[99],"automotive":[102],"domain.":[103],"With":[104],"respect":[105,254],"constraints,":[109],"partitioned":[110,140,277],"widely":[114],"used":[115],"preruntime":[117],"allocate":[118],"tasks":[119],"specific":[121,260],"cores,":[122],"resulting":[123],"predictable":[125],"cache-related":[126],"delays":[128],"estimations.":[129],"In":[130],"this":[131],"paper,":[132],"we":[133,196],"propose":[134],"integrate":[136],"LP-FPPS":[138],"on":[142,171,192,202,222],"fixed-priority":[143],"multicore":[144],"order":[148],"increase":[150],"We":[155],"define":[156],"a":[157],"new":[158],"joint":[159],"approach":[160],"task":[162],"point":[166],"selection,":[167],"based":[170,201],"computation":[173],"maximum":[176],"blocking":[177],"tolerance":[178],"upon":[179],"each":[180,193],"allocation,":[181],"thus":[182],"being":[183],"able":[184],"quantify":[186],"schedulability":[188,258],"taskset":[191,217,261],"processor.":[194],"Furthermore,":[195],"investigate":[197],"strategies":[200,249,271],"different":[203],"heuristics,":[204],"i.e.,":[205],"first":[206],"fit":[207,211],"decreasing":[208],"worst":[210],"decreasing,":[212],"priority":[214],"density":[216],"orderings.":[218],"evaluation":[220,242],"performed":[221],"randomly":[223],"generated":[224],"tasksets":[225],"shows":[226],"that":[227,245,267],"general":[230],"case,":[231],"no":[232],"single":[233],"strategy":[235],"fully":[236,273],"dominates":[237],"others.":[239],"However,":[240],"results":[243,264],"reveal":[244,266],"certain":[247],"perform":[250],"significantly":[251],"better":[252],"characteristics.":[262],"also":[265],"proposed":[269],"nonpreemptive":[276],"terms":[280],"successful":[282],"partitioning.":[283]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}