{"id":"https://openalex.org/W7117515345","doi":"https://doi.org/10.1109/ipccc66453.2025.11304653","title":"Exploiting ML Task Correlation in the Minimization of Capital Expense for GPU Data Centers","display_name":"Exploiting ML Task Correlation in the Minimization of Capital Expense for GPU Data Centers","publication_year":2025,"publication_date":"2025-11-15","ids":{"openalex":"https://openalex.org/W7117515345","doi":"https://doi.org/10.1109/ipccc66453.2025.11304653"},"language":null,"primary_location":{"id":"doi:10.1109/ipccc66453.2025.11304653","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipccc66453.2025.11304653","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Performance, Computing, and Communications Conference (IPCCC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5020129565","display_name":"Srinivasan Subramaniyan","orcid":"https://orcid.org/0000-0002-5848-5667"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Srinivasan Subramaniyan","raw_affiliation_strings":["The Ohio State University,Department of Electrical and Computer Engineering,Columbus,Ohio,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University,Department of Electrical and Computer Engineering,Columbus,Ohio,USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120938102","display_name":"Xiaorui Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaorui Wang","raw_affiliation_strings":["The Ohio State University,Department of Electrical and Computer Engineering,Columbus,Ohio,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University,Department of Electrical and Computer Engineering,Columbus,Ohio,USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.589900016784668,"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"}},"topics":[{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.589900016784668,"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.16030000150203705,"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/T14347","display_name":"Big Data and Digital Economy","score":0.07429999858140945,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/testbed","display_name":"Testbed","score":0.7049000263214111},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6087999939918518},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5968000292778015},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5511000156402588},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5177000164985657},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.47029998898506165},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4074999988079071},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.38850000500679016}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8363999724388123},{"id":"https://openalex.org/C31395832","wikidata":"https://www.wikidata.org/wiki/Q1318674","display_name":"Testbed","level":2,"score":0.7049000263214111},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6087999939918518},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5968000292778015},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5511000156402588},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5177000164985657},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.47029998898506165},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4074999988079071},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39419999718666077},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.38850000500679016},{"id":"https://openalex.org/C153740404","wikidata":"https://www.wikidata.org/wiki/Q671224","display_name":"Data center","level":2,"score":0.3756999969482422},{"id":"https://openalex.org/C117220453","wikidata":"https://www.wikidata.org/wiki/Q5172842","display_name":"Correlation","level":2,"score":0.3653999865055084},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3564999997615814},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.34049999713897705},{"id":"https://openalex.org/C50630238","wikidata":"https://www.wikidata.org/wiki/Q971505","display_name":"General-purpose computing on graphics processing units","level":3,"score":0.33809998631477356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30869999527931213},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.2856999933719635},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2685999870300293},{"id":"https://openalex.org/C51632099","wikidata":"https://www.wikidata.org/wiki/Q3985153","display_name":"Training set","level":2,"score":0.2533000111579895}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipccc66453.2025.11304653","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipccc66453.2025.11304653","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Performance, Computing, and Communications Conference (IPCCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7075333376","display_name":null,"funder_award_id":"CNS-2336886","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"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":23,"referenced_works":["https://openalex.org/W1585314083","https://openalex.org/W2001065285","https://openalex.org/W2068342608","https://openalex.org/W2097117768","https://openalex.org/W2155893237","https://openalex.org/W2194775991","https://openalex.org/W2294710185","https://openalex.org/W2919897868","https://openalex.org/W2946417913","https://openalex.org/W2953169926","https://openalex.org/W2963446712","https://openalex.org/W3012121966","https://openalex.org/W3020079565","https://openalex.org/W3047610867","https://openalex.org/W3097411828","https://openalex.org/W3138516171","https://openalex.org/W3209503812","https://openalex.org/W4225808286","https://openalex.org/W4312754493","https://openalex.org/W4383860572","https://openalex.org/W4399596817","https://openalex.org/W4401752327","https://openalex.org/W7116427101"],"related_works":[],"abstract_inverted_index":{"Efficiently":[0],"scheduling":[1,102],"Machine":[2],"Learning":[3],"(ML)":[4],"training":[5,56,177],"tasks":[6,22,57,73,111,140,160,166],"in":[7,76,119,163],"a":[8,13,43,68,86,99,120,128,154,185,204],"GPU":[9,27,34,61,82,91,101,145,186],"data":[10,121,187],"center":[11,188],"presents":[12],"significant":[14],"research":[15],"challenge.":[16],"Existing":[17],"solutions":[18,242],"commonly":[19,58],"schedule":[20,72],"such":[21],"based":[23,126,192],"on":[24,127,193,231],"their":[25,60,144,211],"demanded":[26],"utilization,":[28],"but":[29],"simply":[30],"assume":[31],"that":[32,104,138,237],"the":[33,49,54,80,106,114,132,150,157,171,176,180,201,223],"utilization":[35,62,107,146],"of":[36,79,116,134,207,225],"each":[37],"task":[38],"can":[39,74,167,199],"be":[40,168,190],"approximated":[41],"as":[42],"constant":[44,69],"number":[45,70,115,206,224],"(e.g.,":[46],"by":[47,243,247],"using":[48],"peak":[50,147],"value),":[51],"even":[52],"though":[53],"ML":[55,136,196,233],"have":[59,143],"varying":[63],"significantly":[64],"over":[65],"time.":[66,152,183],"Using":[67],"to":[71,112,189,221],"result":[75],"an":[77,194],"overestimation":[78],"needed":[81,117],"count":[83],"and,":[84],"therefore,":[85],"high":[87],"capital":[88,212,245],"expense":[89,246],"for":[90],"purchases.":[92],"To":[93],"address":[94],"this,":[95],"we":[96],"design":[97],"CorrGPU,":[98],"correlation-aware":[100],"algorithm":[103],"considers":[105],"correlation":[108],"among":[109,159],"different":[110,139],"minimize":[113],"GPUs":[118,226],"center.":[122],"CorrGPU":[123,198,238],"is":[124],"designed":[125],"key":[129],"observation":[130],"from":[131],"analysis":[133],"real":[135],"traces":[137,234],"do":[141],"not":[142],"at":[148],"exactly":[149],"same":[151,172],"As":[153],"result,":[155],"if":[156],"correlations":[158],"are":[161],"considered":[162],"scheduling,":[164],"more":[165],"scheduled":[169],"onto":[170],"GPUs,":[173,208],"without":[174],"extending":[175],"duration":[178],"beyond":[179],"desired":[181],"due":[182],"For":[184],"constructed":[191],"estimated":[195],"workload,":[197],"help":[200],"operators":[202],"purchase":[203],"smaller":[205],"thus":[209],"minimizing":[210],"expense.":[213],"Our":[214,228],"hardware":[215],"testbed":[216],"results":[217,230],"demonstrate":[218],"CorrGPU's":[219],"potential":[220],"reduce":[222],"needed.":[227],"simulation":[229],"real-world":[232],"also":[235],"show":[236],"outperforms":[239],"several":[240],"state-of-the-art":[241],"reducing":[244],"20.88":[248],"%.":[249]},"counts_by_year":[{"year":2026,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-12-29T00:00:00"}