{"id":"https://openalex.org/W2143251825","doi":"https://doi.org/10.1109/igcc.2011.6008554","title":"Fast algorithms for thermal constrained performance optimization in DAG scheduling on multi-core processors","display_name":"Fast algorithms for thermal constrained performance optimization in DAG scheduling on multi-core processors","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2143251825","doi":"https://doi.org/10.1109/igcc.2011.6008554","mag":"2143251825"},"language":"en","primary_location":{"id":"doi:10.1109/igcc.2011.6008554","is_oa":false,"landing_page_url":"https://doi.org/10.1109/igcc.2011.6008554","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Green Computing Conference and Workshops","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/A5032485563","display_name":"Hafiz Fahad Sheikh","orcid":null},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hafiz Fahad Sheikh","raw_affiliation_strings":["Computer Science and Engineering, University of Texas, Arlington, USA","University of Texas at Arlington, Computer Science and Engineering, UTA, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Texas, Arlington, USA","institution_ids":["https://openalex.org/I189196454"]},{"raw_affiliation_string":"University of Texas at Arlington, Computer Science and Engineering, UTA, USA","institution_ids":["https://openalex.org/I189196454"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103430533","display_name":"Ishfaq Ahmad","orcid":null},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ishfaq Ahmad","raw_affiliation_strings":["Computer Science and Engineering, University of Texas, Arlington, USA","University of Texas at Arlington, Computer Science and Engineering, UTA, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Texas, Arlington, USA","institution_ids":["https://openalex.org/I189196454"]},{"raw_affiliation_string":"University of Texas at Arlington, Computer Science and Engineering, UTA, USA","institution_ids":["https://openalex.org/I189196454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032485563"],"corresponding_institution_ids":["https://openalex.org/I189196454"],"apc_list":null,"apc_paid":null,"fwci":0.7556,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.74553784,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"23","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","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/T10054","display_name":"Parallel Computing and Optimization Techniques","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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7181066274642944},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5875042676925659},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.550391674041748},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5264887809753418},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5051887631416321},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.472973495721817},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43896156549453735},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42899176478385925},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.41448867321014404},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3671687841415405},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21803489327430725},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13461339473724365},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12337404489517212}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7181066274642944},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5875042676925659},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.550391674041748},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5264887809753418},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5051887631416321},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.472973495721817},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43896156549453735},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42899176478385925},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.41448867321014404},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3671687841415405},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21803489327430725},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13461339473724365},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12337404489517212},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","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":1,"locations":[{"id":"doi:10.1109/igcc.2011.6008554","is_oa":false,"landing_page_url":"https://doi.org/10.1109/igcc.2011.6008554","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Green Computing Conference and Workshops","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W162527601","https://openalex.org/W1966395229","https://openalex.org/W1991364847","https://openalex.org/W2023753260","https://openalex.org/W2031617075","https://openalex.org/W2040466547","https://openalex.org/W2063168591","https://openalex.org/W2101020117","https://openalex.org/W2101496345","https://openalex.org/W2116009028","https://openalex.org/W2118569761","https://openalex.org/W2132816157","https://openalex.org/W2143667874","https://openalex.org/W2151038512","https://openalex.org/W2165468151","https://openalex.org/W2166405426","https://openalex.org/W3146536846","https://openalex.org/W3148930147","https://openalex.org/W4242900150","https://openalex.org/W4248334455","https://openalex.org/W4285719527","https://openalex.org/W6641646543","https://openalex.org/W6648181739","https://openalex.org/W6658262365"],"related_works":["https://openalex.org/W197049984","https://openalex.org/W1993191611","https://openalex.org/W2023938924","https://openalex.org/W2918840249","https://openalex.org/W1991859582","https://openalex.org/W2110053126","https://openalex.org/W2104702637","https://openalex.org/W2079303253","https://openalex.org/W4248099758","https://openalex.org/W2794027470"],"abstract_inverted_index":{"Thermal":[0],"management":[1],"is":[2,71,89,201],"highly":[3],"crucial":[4],"for":[5,99],"efficient":[6],"exploitation":[7],"of":[8,124,133,156],"the":[9,39,75,80,86,90,101,105,110,130,144,154,165,170,181,184,199,218],"potentially":[10],"enormous":[11],"computational":[12],"power":[13],"offered":[14],"by":[15,128,167,222],"advanced":[16],"multi-core":[17],"processors.":[18,25],"Higher":[19],"temperatures":[20],"can":[21],"adversely":[22],"affect":[23],"these":[24],"Without":[26],"any":[27],"thermal":[28,82,111,220],"constraint,":[29],"a":[30,60,121,125,148,192],"task":[31,77,126,149,210],"graph":[32,78,127],"may":[33],"be":[34],"scheduled":[35],"to":[36,50,73,196],"run":[37],"on":[38,53],"cores":[40,57,171],"at":[41,150],"their":[42],"maximum":[43,176],"voltage.":[44],"Very":[45],"often,":[46],"multiple":[47],"factors":[48],"lead":[49],"imposing":[51],"constraints":[52,83,221],"temperature,":[54],"ensuring":[55],"that":[56,85,161,198,213],"remain":[58],"below":[59],"certain":[61],"temperature":[62,177],"range":[63],"and":[64,104,118,153,172,208],"yet":[65],"deliver":[66],"good":[67],"performance.":[68],"The":[69,113,140],"challenge":[70],"how":[72],"schedule":[74,123],"same":[76],"under":[79],"imposed":[81,219],"such":[84],"performance":[87,102,186],"degradation":[88,103],"minimum.":[91],"In":[92],"this":[93],"paper":[94],"we":[95,190],"present":[96],"two":[97],"algorithms":[98,141,216],"minimizing":[100],"corresponding":[106],"overhead":[107],"while":[108,178,225],"satisfying":[109],"constraints.":[112],"proposed":[114],"algorithms,":[115],"named":[116],"PAVD,":[117],"TAVD,":[119],"adjust":[120],"given":[122],"decreasing":[129],"voltage":[131],"level":[132],"judiciously":[134],"selected":[135],"tasks":[136,166,173,182],"in":[137,143,159],"each":[138,151,226],"step.":[139],"differ":[142],"way":[145],"they":[146],"select":[147],"step":[152],"amount":[155],"time":[157],"spent":[158],"searching":[160],"task.":[162],"TAVD":[163],"selects":[164,180],"prioritizing":[168],"among":[169],"which":[174],"attained":[175],"PAVD":[179],"with":[183],"minimum":[185],"penalty.":[187],"For":[188],"comparison,":[189],"develop":[191],"simpler":[193],"greedy-based":[194],"approach":[195],"show":[197],"problem":[200],"non-trivial.":[202],"Extensive":[203],"experiments":[204],"using":[205],"both":[206],"random":[207],"application-oriented":[209],"graphs":[211],"demonstrate":[212],"all":[214],"three":[215],"satisfy":[217],"trading-off":[223],"performance,":[224],"showing":[227],"its":[228],"own":[229],"strength.":[230]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}