{"id":"https://openalex.org/W3144684352","doi":"https://doi.org/10.1109/ipdps.2006.1639403","title":"Battery aware dynamic scheduling for periodic task graphs","display_name":"Battery aware dynamic scheduling for periodic task graphs","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W3144684352","doi":"https://doi.org/10.1109/ipdps.2006.1639403","mag":"3144684352"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2006.1639403","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639403","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel &amp; Distributed Processing Symposium","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/A5110207655","display_name":"Venkat Rao","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"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":"V. Rao","raw_affiliation_strings":["TRIO TEAM, LORIA INRIA, France"],"affiliations":[{"raw_affiliation_string":"TRIO TEAM, LORIA INRIA, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210121838"]}]},{"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"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"N. Navet","raw_affiliation_strings":["TRIO TEAM, LORIA INRIA, France"],"affiliations":[{"raw_affiliation_string":"TRIO TEAM, LORIA INRIA, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210121838"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068212229","display_name":"Gaurav Singhal","orcid":"https://orcid.org/0000-0001-5355-7978"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. Singhal","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Technology, Austin, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Technology, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101356545","display_name":"Akash Kumar","orcid":"https://orcid.org/0000-0002-8988-1312"},"institutions":[{"id":"https://openalex.org/I64295750","display_name":"Indian Institute of Technology Indore","ror":"https://ror.org/01hhf7w52","country_code":"IN","type":"education","lineage":["https://openalex.org/I64295750"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"A. Kumar","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, India","institution_ids":["https://openalex.org/I64295750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087664170","display_name":"G. S. Visweswaran","orcid":null},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"G.S. Visweswaran","raw_affiliation_strings":["Department of Electrical Engineering, Indian Institute of Technology, New Delhi, India"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Indian Institute of Technology, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5110207655"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210121838"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.58804707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"8 pp.","last_page":"8 pp."},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10663","display_name":"Advanced Battery Technologies Research","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10663","display_name":"Advanced Battery Technologies Research","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9966999888420105,"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.9674000144004822,"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.7672407031059265},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6223499774932861},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5423563122749329},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5129837393760681},{"id":"https://openalex.org/keywords/battery","display_name":"Battery (electricity)","score":0.4719278812408447},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4213864803314209},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.37547028064727783},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33287858963012695},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23200908303260803},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.15213972330093384},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09408071637153625},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.07274603843688965}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7672407031059265},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6223499774932861},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5423563122749329},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5129837393760681},{"id":"https://openalex.org/C555008776","wikidata":"https://www.wikidata.org/wiki/Q267298","display_name":"Battery (electricity)","level":3,"score":0.4719278812408447},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4213864803314209},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.37547028064727783},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33287858963012695},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23200908303260803},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.15213972330093384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09408071637153625},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.07274603843688965},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2006.1639403","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639403","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel &amp; Distributed Processing Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1521572549","https://openalex.org/W1569458199","https://openalex.org/W1741568234","https://openalex.org/W2041182573","https://openalex.org/W2054775380","https://openalex.org/W2093582532","https://openalex.org/W2113449668","https://openalex.org/W2115892354","https://openalex.org/W2128991755","https://openalex.org/W2155435255","https://openalex.org/W2164509306","https://openalex.org/W4243933835","https://openalex.org/W4250661686"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2330407971"],"abstract_inverted_index":{"Battery":[0,150],"lifetime,":[1],"a":[2,39,58,67,89,101,105,162],"primary":[3],"design":[4],"constraint":[5],"for":[6,43,161],"mobile":[7],"embedded":[8],"systems,":[9],"has":[10,70],"been":[11,71],"shown":[12,72],"to":[13,73,85,112,146,175,179],"depend":[14],"heavily":[15],"on":[16,154],"the":[17,63,82,95,114,132,135,155],"load":[18],"current":[19],"profile.":[20],"This":[21],"paper":[22],"explores":[23],"how":[24],"scheduling":[25,182],"guidelines":[26,145],"from":[27],"battery":[28,34,144,148,169],"models":[29],"can":[30],"help":[31],"in":[32,84],"extending":[33],"capacity.":[35],"It":[36],"then":[37],"presents":[38],"'battery-aware":[40],"scheduling'":[41],"methodology":[42,80,122,160],"periodically":[44],"arriving":[45],"task":[46,115],"graphs":[47],"with":[48],"real":[49,127],"time":[50,128,171],"deadlines":[51,129],"and":[52,138],"precedence":[53],"constraints.":[54],"Scheduling":[55],"of":[56,66,98,126,131,134,165],"even":[57],"single":[59],"taskgraph":[60],"while":[61,142],"minimizing":[62],"weighted":[64],"sum":[65],"cost":[68],"function":[69,109,140],"be":[74],"NP-hard":[75],"(Lawler,":[76],"1978).":[77],"The":[78,121],"presented":[79],"divides":[81],"problem":[83],"two":[86],"steps.":[87],"First,":[88],"good":[90],"DVS":[91,136],"algorithm":[92,103,137],"dynamically":[93],"determines":[94],"minimum":[96],"frequency":[97],"execution.":[99],"Then,":[100],"greedy":[102],"allows":[104],"near":[106],"optimal":[107],"priority":[108,139],"(Gruian,":[110],"2002)":[111],"choose":[113],"which":[116],"would":[117],"maximize":[118,147],"slack":[119],"recovery.":[120],"also":[123],"ensures":[124],"adherence":[125],"independent":[130],"choice":[133],"used,":[141],"following":[143],"lifetime.":[149],"simulations":[151],"carried":[152],"out":[153],"profile":[156],"generated":[157],"by":[158],"our":[159],"large":[163],"set":[164],"taskgraphs":[166],"show":[167],"that":[168],"life":[170],"is":[172],"extended":[173],"up":[174],"23.3%":[176],"as":[177],"compared":[178],"existing":[180],"dynamic":[181],"schemes":[183]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
