{"id":"https://openalex.org/W2553507145","doi":"https://doi.org/10.1109/tsusc.2016.2623775","title":"Energy-Efficient Task Scheduling on Multiple Heterogeneous Computers: Algorithms, Analysis, and Performance Evaluation","display_name":"Energy-Efficient Task Scheduling on Multiple Heterogeneous Computers: Algorithms, Analysis, and Performance Evaluation","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2553507145","doi":"https://doi.org/10.1109/tsusc.2016.2623775","mag":"2553507145"},"language":"en","primary_location":{"id":"doi:10.1109/tsusc.2016.2623775","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsusc.2016.2623775","pdf_url":null,"source":{"id":"https://openalex.org/S4210221417","display_name":"IEEE Transactions on Sustainable Computing","issn_l":"2377-3782","issn":["2377-3782","2377-3790"],"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 Sustainable Computing","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/A5087894632","display_name":"Keqin Li","orcid":"https://orcid.org/0000-0001-5224-4048"},"institutions":[{"id":"https://openalex.org/I157455823","display_name":"SUNY New Paltz","ror":"https://ror.org/03j3dv688","country_code":"US","type":"education","lineage":["https://openalex.org/I157455823"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Keqin Li","raw_affiliation_strings":["Department of Computer Science, State University of New York, New Paltz, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, State University of New York, New Paltz, NY","institution_ids":["https://openalex.org/I157455823"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087894632"],"corresponding_institution_ids":["https://openalex.org/I157455823"],"apc_list":null,"apc_paid":null,"fwci":3.839,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.94123626,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"1","issue":"1","first_page":"7","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998000264167786,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9993000030517578,"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.747686505317688},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.621713399887085},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6194146275520325},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6046982407569885},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.547450840473175},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5453001260757446},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5011255741119385},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49554550647735596},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3612239360809326},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35580769181251526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1437416672706604}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.747686505317688},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.621713399887085},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6194146275520325},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6046982407569885},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.547450840473175},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5453001260757446},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5011255741119385},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49554550647735596},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3612239360809326},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35580769181251526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1437416672706604},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tsusc.2016.2623775","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsusc.2016.2623775","pdf_url":null,"source":{"id":"https://openalex.org/S4210221417","display_name":"IEEE Transactions on Sustainable Computing","issn_l":"2377-3782","issn":["2377-3782","2377-3790"],"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 Sustainable Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.9100000262260437}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W418571712","https://openalex.org/W979110331","https://openalex.org/W1633471522","https://openalex.org/W1821730416","https://openalex.org/W1983936126","https://openalex.org/W1987354455","https://openalex.org/W2001408814","https://openalex.org/W2012181719","https://openalex.org/W2014008637","https://openalex.org/W2016523339","https://openalex.org/W2020079765","https://openalex.org/W2028945515","https://openalex.org/W2038972761","https://openalex.org/W2047691106","https://openalex.org/W2059836339","https://openalex.org/W2060042533","https://openalex.org/W2063425401","https://openalex.org/W2067500286","https://openalex.org/W2076721029","https://openalex.org/W2087767011","https://openalex.org/W2091968665","https://openalex.org/W2104680817","https://openalex.org/W2120366615","https://openalex.org/W2121574851","https://openalex.org/W2123321856","https://openalex.org/W2124449669","https://openalex.org/W2126578910","https://openalex.org/W2128748528","https://openalex.org/W2129542763","https://openalex.org/W2141172690","https://openalex.org/W2144907978","https://openalex.org/W2150879632","https://openalex.org/W2166243422","https://openalex.org/W2292497506","https://openalex.org/W2340682048","https://openalex.org/W2343343776","https://openalex.org/W6704783828"],"related_works":["https://openalex.org/W1549987457","https://openalex.org/W2025912669","https://openalex.org/W2014615094","https://openalex.org/W1977789739","https://openalex.org/W2351778335","https://openalex.org/W4240458717","https://openalex.org/W2497180562","https://openalex.org/W2379495598","https://openalex.org/W2047470742","https://openalex.org/W2767131998"],"abstract_inverted_index":{"The":[0],"problems":[1,126,181,220],"of":[2,22,32,76,92,95,101,127,132,182,221,226],"energy-constrained":[3,128,222],"and":[4,36,80,129,163,189,223],"time-constrained":[5,130,224],"task":[6,58],"scheduling":[7,85,131,154,225],"on":[8,135,230],"multiple":[9,136,231],"heterogeneous":[10,137,232],"computers":[11],"are":[12,69,176],"investigated":[13],"as":[14],"combinatorial":[15],"optimization":[16],"problems.":[17],"For":[18,139],"a":[19,30,39,53,77,82,90,145,197],"given":[20,78,198],"set":[21,94],"independent":[23,133],"tasks,":[24,44],"our":[25,150],"strategy":[26],"is":[27,49,66,98],"to":[28,42,71,88,178,186],"find":[29,38,72],"schedule":[31],"the":[33,43,46,56,62,93,102,116,125,167,172,180,187,210,219],"tasks":[34,96,134,142,158,165,229],"first,":[35],"then":[37],"power":[40,47],"allocation":[41,48,185],"where":[45],"performed":[50],"in":[51,123,166,196,217],"such":[52],"way":[54],"that":[55,97,110,204],"total":[57,63],"execution":[59],"time":[60],"or":[61],"energy":[64],"consumption":[65],"minimized.":[67],"We":[68,175],"able":[70,177],"an":[73,99],"optimal":[74,103,114,183,190,208],"partition":[75,91,192],"workload":[79,104,191],"use":[81],"modified":[83,152],"list":[84,153],"(MLS)":[86],"algorithm":[87,118,156,212],"generate":[89],"approximation":[100],"partition.":[105],"Our":[106,200],"simulation":[107,201],"results":[108,202],"demonstrate":[109,203],"when":[111,205],"compared":[112,206],"with":[113,207],"solutions,":[115,209],"MLS":[117,173],"has":[119,213],"excellent":[120,214],"expected":[121,215],"performance":[122,216],"solving":[124,218],"computers.":[138,233],"precedence":[140,227],"constrained":[141,228],"represented":[143],"by":[144,160,170],"directed":[146],"acyclic":[147],"graph":[148],"(dag),":[149],"level-by-level":[151],"(LL-MLS)":[155],"schedules":[157,164],"level":[159,161,169],"(LL)":[162],"same":[168],"using":[171],"algorithm.":[174],"solve":[179],"energy/time":[184],"levels":[188,195],"for":[193],"all":[194],"dag.":[199],"LL-MLS":[211]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4}],"updated_date":"2026-05-15T08:27:34.491423","created_date":"2025-10-10T00:00:00"}