{"id":"https://openalex.org/W2041182573","doi":"https://doi.org/10.1145/1113830.1113838","title":"Shortest-path algorithms for real-time scheduling of FIFO tasks with minimal energy use","display_name":"Shortest-path algorithms for real-time scheduling of FIFO tasks with minimal energy use","publication_year":2005,"publication_date":"2005-11-01","ids":{"openalex":"https://openalex.org/W2041182573","doi":"https://doi.org/10.1145/1113830.1113838","mag":"2041182573"},"language":"en","primary_location":{"id":"doi:10.1145/1113830.1113838","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1113830.1113838","pdf_url":null,"source":{"id":"https://openalex.org/S136160450","display_name":"ACM Transactions on Embedded Computing Systems","issn_l":"1539-9087","issn":["1539-9087","1558-3465"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Embedded Computing 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/A5073088518","display_name":"Bruno Gaujal","orcid":"https://orcid.org/0000-0001-9081-8401"},"institutions":[{"id":"https://openalex.org/I4210101348","display_name":"Centre Inria de l'Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/00n8d6z93","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210101348"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Bruno Gaujal","raw_affiliation_strings":["INRIA---Trio Team, Montbonnot, France"],"affiliations":[{"raw_affiliation_string":"INRIA---Trio Team, Montbonnot, France","institution_ids":["https://openalex.org/I4210101348","https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068542032","display_name":"Nicolas Navet","orcid":"https://orcid.org/0000-0002-6417-358X"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nicolas Navet","raw_affiliation_strings":["INRIA---Trio Team, Vandoeuvre-l\u00e8s-Nancy, France"],"affiliations":[{"raw_affiliation_string":"INRIA---Trio Team, Vandoeuvre-l\u00e8s-Nancy, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018759064","display_name":"Cormac Walsh","orcid":"https://orcid.org/0000-0002-6785-9763"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Cormac Walsh","raw_affiliation_strings":["INRIA---Maxplus Team, Le Chesnay Cedex, France"],"affiliations":[{"raw_affiliation_string":"INRIA---Maxplus Team, Le Chesnay Cedex, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073088518"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210101348"],"apc_list":null,"apc_paid":null,"fwci":1.8047,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.85406037,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"4","issue":"4","first_page":"907","last_page":"933"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998999834060669,"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.9998999834060669,"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.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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9988999962806702,"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.8488830327987671},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6239301562309265},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.606284499168396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5838411450386047},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5605221390724182},{"id":"https://openalex.org/keywords/fifo","display_name":"FIFO (computing and electronics)","score":0.5420632362365723},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5240695476531982},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4617021679878235},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4137412905693054},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.36094120144844055},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3386732339859009},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12744450569152832},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1078590452671051},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09215754270553589}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8488830327987671},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6239301562309265},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.606284499168396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5838411450386047},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5605221390724182},{"id":"https://openalex.org/C2777145635","wikidata":"https://www.wikidata.org/wiki/Q515636","display_name":"FIFO (computing and electronics)","level":2,"score":0.5420632362365723},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5240695476531982},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4617021679878235},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4137412905693054},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36094120144844055},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3386732339859009},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12744450569152832},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1078590452671051},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09215754270553589},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1113830.1113838","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1113830.1113838","pdf_url":null,"source":{"id":"https://openalex.org/S136160450","display_name":"ACM Transactions on Embedded Computing Systems","issn_l":"1539-9087","issn":["1539-9087","1558-3465"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Embedded Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:HAL:inria-00099957v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00099957","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":"ACM Transactions on Embedded Computing Systems (TECS), 2005, 4 (4), ⟨10.1145/1113830.1113838⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.6200000047683716,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1576380096","https://openalex.org/W1741568234","https://openalex.org/W1771629184","https://openalex.org/W2001861238","https://openalex.org/W2005456951","https://openalex.org/W2006244123","https://openalex.org/W2011024076","https://openalex.org/W2074405340","https://openalex.org/W2088337139","https://openalex.org/W2099961254","https://openalex.org/W2108387401","https://openalex.org/W2137343096","https://openalex.org/W2154047722","https://openalex.org/W2484338577","https://openalex.org/W3044911583","https://openalex.org/W4255357539"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"We":[0,69],"present":[1],"an":[2,48,72],"algorithm":[3,37,53,73,91],"for":[4],"scheduling":[5],"a":[6,31,66,84],"set":[7],"of":[8,54,87,100,122],"nonrecurrent":[9],"tasks":[10,27,123,157],"(or":[11],"jobs)":[12],"with":[13,76,96],"FIFO":[14],"real-time":[15],"constraints":[16],"so":[17],"as":[18,65],"to":[19,74,145,155,159],"minimize":[20],"the":[21,26,51,63,77,80,93,97,107,120,125,147],"total":[22],"energy":[23],"consumed":[24],"when":[25,106],"are":[28,117,129,143],"performed":[29],"on":[30],"dynamically":[32],"variable":[33],"voltage":[34],"processor.":[35],"Our":[36],"runs":[38],"in":[39,44,119],"linear":[40,118],"time":[41],"and":[42,127,131,158],"thus,":[43],"this":[45],"case,":[46],"is":[47,104],"improvement":[49],"over":[50],"classical":[52],"Yao":[55],"et":[56],"al.":[57],"It":[58],"was":[59],"inspired":[60],"by":[61],"considering":[62],"problem":[64],"shortest-path":[67],"problem.":[68],"also":[70],"propose":[71],"deal":[75],"case":[78],"where":[79],"processor":[81],"has":[82],"only":[83],"limited":[85],"number":[86,99,121],"clock":[88],"frequencies.":[89],"This":[90],"gives":[92],"optimum":[94],"schedule":[95],"minimum":[98],"speed":[101,108],"changes,":[102],"which":[103],"important":[105],"switching":[109],"overhead":[110],"cannot":[111],"be":[112,146],"neglected.":[113],"All":[114],"our":[115,153],"algorithms":[116],"if":[124],"arrivals":[126],"deadlines":[128],"sorted":[130],"otherwise":[132],"need":[133],"O":[134],"(":[135],"N":[136,138],"log":[137],")":[139],"time.":[140],"These":[141],"complexities":[142],"shown":[144],"best":[148],"possible.":[149],"Finally,":[150],"we":[151],"extend":[152],"results":[154],"fluid":[156],"nonconvex":[160],"cost":[161],"functions.":[162]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}