{"id":"https://openalex.org/W1937323241","doi":"https://doi.org/10.1109/etfa.2015.7301519","title":"Complexity of scheduling real-time tasks subjected to cache-related preemption delays","display_name":"Complexity of scheduling real-time tasks subjected to cache-related preemption delays","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W1937323241","doi":"https://doi.org/10.1109/etfa.2015.7301519","mag":"1937323241"},"language":"en","primary_location":{"id":"doi:10.1109/etfa.2015.7301519","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2015.7301519","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA)","raw_type":"proceedings-article"},"type":"preprint","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/A5015789515","display_name":"Guillaume Phavorin","orcid":"https://orcid.org/0000-0002-1276-9023"},"institutions":[{"id":"https://openalex.org/I171246369","display_name":"\u00c9cole Nationale Sup\u00e9rieure de M\u00e9canique et d'A\u00e9rotechnique","ror":"https://ror.org/04jx68594","country_code":"FR","type":"facility","lineage":["https://openalex.org/I171246369"]},{"id":"https://openalex.org/I4210116740","display_name":"Laboratoire d'Informatique et d'Automatique pour les Syst\u00e8mes","ror":"https://ror.org/02b5vq778","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I4210113334","https://openalex.org/I4210116740","https://openalex.org/I4210139971"]},{"id":"https://openalex.org/I32881790","display_name":"Universit\u00e9 de Poitiers","ror":"https://ror.org/04xhy8q59","country_code":"FR","type":"education","lineage":["https://openalex.org/I32881790"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Guillaume Phavorin","raw_affiliation_strings":["LIAS/Universite de Poitiers, Poitiers, France","SETR - Syst\u00e8mes Embarqu\u00e9s Temps R\u00e9el (Laboratoire LIAS - ENSIP B\u00e2timent B25 - 2 rue Pierre Brousse TSA 41105 86073 Poitiers Cedex 9 France Laboratoire LIAS - ISAE-ENSMA T\u00e9l\u00e9port 2 - 1 avenue Cl\u00e9ment Ader BP 40109 86961 Chasseneuil France  - France)","LIAS [Poitiers] - Laboratoire d'informatique et d'automatique pour les syst\u00e8mes [EA 6315] (LISI-ENSMA T\u00e9l\u00e9port 2 \u2013 1 avenue Cl\u00e9ment Ader \u2013 BP 40109 \u2013 86961 Futuroscope Chasseneuil cedex \u2013 france - France)"],"affiliations":[{"raw_affiliation_string":"LIAS/Universite de Poitiers, Poitiers, France","institution_ids":["https://openalex.org/I32881790"]},{"raw_affiliation_string":"SETR - Syst\u00e8mes Embarqu\u00e9s Temps R\u00e9el (Laboratoire LIAS - ENSIP B\u00e2timent B25 - 2 rue Pierre Brousse TSA 41105 86073 Poitiers Cedex 9 France Laboratoire LIAS - ISAE-ENSMA T\u00e9l\u00e9port 2 - 1 avenue Cl\u00e9ment Ader BP 40109 86961 Chasseneuil France  - France)","institution_ids":["https://openalex.org/I171246369"]},{"raw_affiliation_string":"LIAS [Poitiers] - Laboratoire d'informatique et d'automatique pour les syst\u00e8mes [EA 6315] (LISI-ENSMA T\u00e9l\u00e9port 2 \u2013 1 avenue Cl\u00e9ment Ader \u2013 BP 40109 \u2013 86961 Futuroscope Chasseneuil cedex \u2013 france - France)","institution_ids":["https://openalex.org/I4210116740","https://openalex.org/I171246369"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107303839","display_name":"Pascal Richard","orcid":"https://orcid.org/0009-0003-3916-9241"},"institutions":[{"id":"https://openalex.org/I32881790","display_name":"Universit\u00e9 de Poitiers","ror":"https://ror.org/04xhy8q59","country_code":"FR","type":"education","lineage":["https://openalex.org/I32881790"]},{"id":"https://openalex.org/I171246369","display_name":"\u00c9cole Nationale Sup\u00e9rieure de M\u00e9canique et d'A\u00e9rotechnique","ror":"https://ror.org/04jx68594","country_code":"FR","type":"facility","lineage":["https://openalex.org/I171246369"]},{"id":"https://openalex.org/I4210116740","display_name":"Laboratoire d'Informatique et d'Automatique pour les Syst\u00e8mes","ror":"https://ror.org/02b5vq778","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I4210113334","https://openalex.org/I4210116740","https://openalex.org/I4210139971"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Pascal Richard","raw_affiliation_strings":["LIAS/Universite de Poitiers, Poitiers, France","LIAS [Poitiers] - Laboratoire d'informatique et d'automatique pour les syst\u00e8mes [EA 6315] (LISI-ENSMA T\u00e9l\u00e9port 2 \u2013 1 avenue Cl\u00e9ment Ader \u2013 BP 40109 \u2013 86961 Futuroscope Chasseneuil cedex \u2013 france - France)","SETR - Syst\u00e8mes Embarqu\u00e9s Temps R\u00e9el (Laboratoire LIAS - ENSIP B\u00e2timent B25 - 2 rue Pierre Brousse TSA 41105 86073 Poitiers Cedex 9 France Laboratoire LIAS - ISAE-ENSMA T\u00e9l\u00e9port 2 - 1 avenue Cl\u00e9ment Ader BP 40109 86961 Chasseneuil France  - France)"],"affiliations":[{"raw_affiliation_string":"LIAS/Universite de Poitiers, Poitiers, France","institution_ids":["https://openalex.org/I32881790"]},{"raw_affiliation_string":"LIAS [Poitiers] - Laboratoire d'informatique et d'automatique pour les syst\u00e8mes [EA 6315] (LISI-ENSMA T\u00e9l\u00e9port 2 \u2013 1 avenue Cl\u00e9ment Ader \u2013 BP 40109 \u2013 86961 Futuroscope Chasseneuil cedex \u2013 france - France)","institution_ids":["https://openalex.org/I4210116740","https://openalex.org/I171246369"]},{"raw_affiliation_string":"SETR - Syst\u00e8mes Embarqu\u00e9s Temps R\u00e9el (Laboratoire LIAS - ENSIP B\u00e2timent B25 - 2 rue Pierre Brousse TSA 41105 86073 Poitiers Cedex 9 France Laboratoire LIAS - ISAE-ENSMA T\u00e9l\u00e9port 2 - 1 avenue Cl\u00e9ment Ader BP 40109 86961 Chasseneuil France  - France)","institution_ids":["https://openalex.org/I171246369"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045794846","display_name":"Claire Ma\u00efza","orcid":"https://orcid.org/0000-0002-5977-6685"},"institutions":[{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]},{"id":"https://openalex.org/I4210156361","display_name":"Verimag","ror":"https://ror.org/05afmzm11","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210156361","https://openalex.org/I4210159245","https://openalex.org/I899635006"]},{"id":"https://openalex.org/I106785703","display_name":"Institut polytechnique de Grenoble","ror":"https://ror.org/05sbt2524","country_code":"FR","type":"education","lineage":["https://openalex.org/I106785703","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Claire Maiza","raw_affiliation_strings":["Grenoble INP, Verimag Grenoble, France","VERIMAG - IMAG - VERIMAG (Verimag\r\nB\u00e2timent IMAG\r\nUniversit\u00e9 Grenoble Alpes\r\n700, avenue centrale\r\n38401 Saint Martin d\u2019H\u00e8res\r\nFrance  - France)"],"affiliations":[{"raw_affiliation_string":"Grenoble INP, Verimag Grenoble, France","institution_ids":["https://openalex.org/I4210156361","https://openalex.org/I106785703"]},{"raw_affiliation_string":"VERIMAG - IMAG - VERIMAG (Verimag\r\nB\u00e2timent IMAG\r\nUniversit\u00e9 Grenoble Alpes\r\n700, avenue centrale\r\n38401 Saint Martin d\u2019H\u00e8res\r\nFrance  - France)","institution_ids":["https://openalex.org/I4210156361","https://openalex.org/I899635006"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015789515"],"corresponding_institution_ids":["https://openalex.org/I171246369","https://openalex.org/I32881790","https://openalex.org/I4210116740"],"apc_list":null,"apc_paid":null,"fwci":0.9937,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75620846,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9997000098228455,"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.9997000098228455,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9857000112533569,"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.9603000283241272,"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.8103618621826172},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.801384449005127},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6821314096450806},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.57790207862854},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5569126605987549},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5531399250030518},{"id":"https://openalex.org/keywords/uniprocessor-system","display_name":"Uniprocessor system","score":0.542286217212677},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.529147207736969},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5185302495956421},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4983999729156494},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.477832555770874},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.4709870517253876},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.46464869379997253},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4469171166419983},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.41528066992759705},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1586901843547821},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1425735056400299},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11800774931907654},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09616753458976746},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.07105123996734619},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.07001277804374695}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8103618621826172},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.801384449005127},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6821314096450806},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.57790207862854},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5569126605987549},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5531399250030518},{"id":"https://openalex.org/C79189994","wikidata":"https://www.wikidata.org/wiki/Q3488021","display_name":"Uniprocessor system","level":3,"score":0.542286217212677},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.529147207736969},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5185302495956421},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4983999729156494},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.477832555770874},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.4709870517253876},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.46464869379997253},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4469171166419983},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.41528066992759705},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1586901843547821},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1425735056400299},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11800774931907654},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09616753458976746},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.07105123996734619},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.07001277804374695}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/etfa.2015.7301519","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2015.7301519","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-04195581v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04195581","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"20th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2015), Sep 2015, Luxembourg, Luxembourg. ⟨10.1109/ETFA.2015.7301519⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1484951628","https://openalex.org/W1555915743","https://openalex.org/W1584428153","https://openalex.org/W1910647367","https://openalex.org/W1975442866","https://openalex.org/W2010260400","https://openalex.org/W2011039300","https://openalex.org/W2011874983","https://openalex.org/W2040062446","https://openalex.org/W2040176884","https://openalex.org/W2075889702","https://openalex.org/W2076285066","https://openalex.org/W2088173694","https://openalex.org/W2096147951","https://openalex.org/W2096153753","https://openalex.org/W2104879235","https://openalex.org/W2124797444","https://openalex.org/W2130181800","https://openalex.org/W2136910062","https://openalex.org/W2139566576","https://openalex.org/W2140007886","https://openalex.org/W2161734639","https://openalex.org/W2166417881","https://openalex.org/W2171342002","https://openalex.org/W2401610261","https://openalex.org/W2496007067","https://openalex.org/W3140720277","https://openalex.org/W3149604617","https://openalex.org/W4301520192","https://openalex.org/W6634706866","https://openalex.org/W6674076665"],"related_works":["https://openalex.org/W2171342002","https://openalex.org/W4300092030","https://openalex.org/W2017977262","https://openalex.org/W2172075652","https://openalex.org/W2135522804","https://openalex.org/W2169142010","https://openalex.org/W1545991362","https://openalex.org/W2605049164","https://openalex.org/W2545511463","https://openalex.org/W4381889969"],"abstract_inverted_index":{"We":[0,94,119,176],"consider":[1],"the":[2,26,48,77,103,110,149,163,167,180],"computational":[3,78],"complexity":[4,49,79],"problems":[5,100,107,147],"of":[6,38,50,80,113,169],"scheduling":[7,52,82,99,117,140,146,152,159,189],"hard":[8],"real-time":[9,63,139],"tasks":[10],"subjected":[11],"to":[12,28,36,84,108,137],"cache-related":[13,90,98,116,154],"preemption":[14,33,55,91,155],"delays":[15,34,156],"upon":[16],"uniprocessor":[17],"platforms.":[18],"Several":[19],"schedulability":[20],"analyses":[21],"have":[22],"been":[23],"proposed":[24],"in":[25,135],"literature":[27],"explicitly":[29],"take":[30],"into":[31],"account":[32],"due":[35],"loss":[37],"cache":[39,164],"affinity.":[40],"But,":[41],"these":[42],"previous":[43],"results":[44,123,128],"do":[45],"not":[46],"study":[47],"taking":[51,81],"decisions":[53,83],"under":[54],"delay":[56,92],"constraints":[57],"and":[58,157,166],"only":[59],"focus":[60,75],"on":[61,76],"classical":[62],"schedulers":[64],"(e.g.,":[65],"Rate":[66],"Monotonic,":[67],"Earliest":[68],"Deadline":[69],"First).":[70],"In":[71],"this":[72],"paper,":[73],"we":[74],"meet":[85],"task":[86],"deadlines":[87],"while":[88],"minimizing":[89],"effects.":[93],"design":[95],"two":[96,143],"basic":[97,144],"that":[101,130,183],"are":[102,148],"most":[104],"simple":[105],"NP-hard":[106,145],"cover":[109],"largest":[111],"set":[112],"intractable":[114],"real-world":[115],"problems.":[118,141],"establish":[120],"several":[121],"NP-hardness":[122],"for":[124,173,179],"preemptive":[125],"systems.":[126],"These":[127,142],"prove":[129,178],"tighter":[131],"timing":[132],"analysis":[133],"leads":[134],"practice":[136],"harder":[138],"following:":[150],"(i)":[151],"with":[153,160],"(ii)":[158],"information":[161],"about":[162],"state":[165],"sequence":[168],"requested":[170],"memory":[171],"blocks":[172],"every":[174],"task.":[175],"also":[177],"first":[181],"problem":[182],"neither":[184],"fixed-task":[185],"nor":[186],"fixed-job":[187],"priority-based":[188],"algorithms":[190],"can":[191],"be":[192],"optimal.":[193]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-11T14:59:36.786465","created_date":"2025-10-10T00:00:00"}