{"id":"https://openalex.org/W2809164497","doi":"https://doi.org/10.1145/3210367","title":"Robust and Probabilistic Failure-Aware Placement","display_name":"Robust and Probabilistic Failure-Aware Placement","publication_year":2018,"publication_date":"2018-03-31","ids":{"openalex":"https://openalex.org/W2809164497","doi":"https://doi.org/10.1145/3210367","mag":"2809164497"},"language":"en","primary_location":{"id":"doi:10.1145/3210367","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210367","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210367?download=true","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"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 Parallel Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3210367?download=true","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027504604","display_name":"Madhukar Korupolu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210127875","display_name":"Nvidia (United States)","ror":"https://ror.org/03jdj4y14","country_code":"US","type":"company","lineage":["https://openalex.org/I4210127875"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Madhukar Korupolu","raw_affiliation_strings":["Nvidia Inc, Santa Clara, CA"],"affiliations":[{"raw_affiliation_string":"Nvidia Inc, Santa Clara, CA","institution_ids":["https://openalex.org/I4210127875"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103525476","display_name":"Rajmohan Rajaraman","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajmohan Rajaraman","raw_affiliation_strings":["Northeastern University, Boston, MA"],"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, MA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027504604"],"corresponding_institution_ids":["https://openalex.org/I4210127875"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.07039337,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"5","issue":"1","first_page":"1","last_page":"30"},"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.9995999932289124,"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.9995999932289124,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9995999932289124,"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.9983999729156494,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.7052520513534546},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.607891857624054},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5814836621284485},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5699101686477661},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49195143580436707},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48830556869506836},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4737628102302551},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4703640639781952},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.45245394110679626},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.4382648468017578},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38448867201805115},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33627721667289734},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3110537528991699},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28724992275238037},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1699061393737793},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.08520296216011047}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7052520513534546},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.607891857624054},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5814836621284485},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5699101686477661},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49195143580436707},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48830556869506836},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4737628102302551},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4703640639781952},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.45245394110679626},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.4382648468017578},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38448867201805115},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33627721667289734},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3110537528991699},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28724992275238037},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1699061393737793},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.08520296216011047},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"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/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3210367","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210367","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210367?download=true","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"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 Parallel Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3210367","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210367","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210367?download=true","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"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 Parallel Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6499999761581421,"display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G2107656396","display_name":null,"funder_award_id":"CSR-1217981, CCF-1422715 and AITF-1535929","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2178312495","display_name":null,"funder_award_id":"CSR-1217981","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3370793288","display_name":null,"funder_award_id":"CCF-1422715","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4392828662","display_name":"AF: Small: Network Algorithms Under Adversarial and Stochastic Uncertainty","funder_award_id":"1422715","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G467264487","display_name":"AitF: FULL: Collaborative Research: Optimizing Networked Systems with Limited Information","funder_award_id":"1535929","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8145691828","display_name":"CSR: Small: Collaborative Research: Pursuing High Performance on Clouds and Other Dynamically Heterogeneous Computing Platforms","funder_award_id":"1217981","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"},{"id":"https://openalex.org/F4320319907","display_name":"Alberta Innovates - Technology Futures","ror":"https://ror.org/00ynafe15"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2809164497.pdf","grobid_xml":"https://content.openalex.org/works/W2809164497.grobid-xml"},"referenced_works_count":52,"referenced_works":["https://openalex.org/W45177990","https://openalex.org/W196928694","https://openalex.org/W985049445","https://openalex.org/W1506734247","https://openalex.org/W1510496002","https://openalex.org/W1529768988","https://openalex.org/W1532555777","https://openalex.org/W1588628884","https://openalex.org/W1606480398","https://openalex.org/W1974401809","https://openalex.org/W1996837595","https://openalex.org/W2011039300","https://openalex.org/W2015099024","https://openalex.org/W2027111774","https://openalex.org/W2041998819","https://openalex.org/W2042876290","https://openalex.org/W2048772520","https://openalex.org/W2052371896","https://openalex.org/W2060204338","https://openalex.org/W2074814670","https://openalex.org/W2089536264","https://openalex.org/W2095575865","https://openalex.org/W2099506495","https://openalex.org/W2109706326","https://openalex.org/W2118578357","https://openalex.org/W2118676041","https://openalex.org/W2122109562","https://openalex.org/W2122249806","https://openalex.org/W2125165932","https://openalex.org/W2126969025","https://openalex.org/W2129542763","https://openalex.org/W2130531694","https://openalex.org/W2131308780","https://openalex.org/W2139150553","https://openalex.org/W2141992894","https://openalex.org/W2146436552","https://openalex.org/W2159128662","https://openalex.org/W2164499670","https://openalex.org/W2173213060","https://openalex.org/W2176566884","https://openalex.org/W2189465200","https://openalex.org/W2271655448","https://openalex.org/W2320835389","https://openalex.org/W2405200838","https://openalex.org/W2469806316","https://openalex.org/W3004493283","https://openalex.org/W3099574588","https://openalex.org/W3106281551","https://openalex.org/W3138781140","https://openalex.org/W3160434771","https://openalex.org/W3163287424","https://openalex.org/W4240196045"],"related_works":["https://openalex.org/W4320018150","https://openalex.org/W4239582170","https://openalex.org/W2918664383","https://openalex.org/W106056076","https://openalex.org/W4320855730","https://openalex.org/W2135200719","https://openalex.org/W4377371889","https://openalex.org/W1862126075","https://openalex.org/W2113623403","https://openalex.org/W2055932080"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"the":[2,12,21,35,39,54,68,95,103,122,144,151,155,162,238,260,276,311,323,362,377,381,401,408,411,439,446,451],"growing":[3],"complexity":[4],"and":[5,11,51,67,85,113,177,262,295,339],"heterogeneity":[6],"of":[7,14,25,28,41,48,74,76,111,129,154,161,182,208,220,257,272,291,314,326,333,403,441,448],"modern":[8],"data":[9,36],"centers,":[10],"prevalence":[13],"commodity":[15],"component":[16],"failures,":[17,138,442],"this":[18,347],"article":[19],"studies":[20],"failure-aware":[22],"placement":[23,92,119],"problem":[24,163,244],"placing":[26],"tasks":[27,131],"a":[29,60,81,91,109,118,159,194,205,211,217,246,263,266,289,296,394],"parallel":[30],"job":[31],"on":[32,310],"machines":[33],"in":[34,147,249,259,275,376,400,426,438,450],"center":[37],"with":[38,331],"goal":[40,87],"increasing":[42],"availability.":[43],"We":[44,191,226,405],"consider":[45],"two":[46],"models":[47],"failures:":[49],"adversarial":[50,55,137],"probabilistic.":[52],"In":[53,102],"model,":[56,105],"each":[57,106],"node":[58,107,267],"has":[59,108],"weight":[61,63,78,313],"(higher":[62],"implying":[64],"higher":[65],"reliability)":[66],"adversary":[69,318],"can":[70,252,268,319],"remove":[71],"any":[72,134,255],"subset":[73,256],"nodes":[75,258,315,332],"total":[77,312],"at":[79,125,133,254,265],"most":[80],"given":[82],"bound":[83,308],"W":[84,309],"our":[86],"is":[88,175,187,210,237,302,445],"to":[89,116,329,348,410],"find":[90,117],"that":[93,120,124,142,164,213,316,370],"incurs":[94],"least":[96,126],"disruption":[97],"against":[98],"such":[99],"an":[100,179,317,350,368,372,422,432],"adversary.":[101],"probabilistic":[104,363],"probability":[110,123,379,428],"failure":[112,264,378,427],"we":[114,139,165,214,287,345,365],"need":[115],"maximizes":[121],"K":[127],"out":[128],"N":[130],"survive":[132],"time.":[135],"For":[136,361],"first":[140,366],"show":[141],"(i)":[143],"problems":[145],"are":[146],"\u03a3":[148,188],"2":[149,189],",":[150,204,235,286,390,420],"second":[152],"level":[153,383],"polynomial":[156],"hierarchy;":[157],"(ii)":[158],"variant":[160],"call":[166],"R":[167,183,200,221,231,240,282,356],"obust":[168,184,201,222,232,241,283,357],"F":[169,185,202,223,233,242,284,358,388,418],"ap":[170,186,203,224,234,243,285,359,389,419],"(for":[171],"Robust":[172],"Failure-Aware":[173],"Placement)":[174],"co-NP-hard;":[176],"(iii)":[178],"all-or-nothing":[180],"version":[181,219],"-complete.":[190],"then":[192,227,406],"give":[193,349,367],"polynomial-time":[195],"approximation":[196,375,425],"scheme":[197],"(PTAS)":[198],"for":[199,216,305,352,380],"key":[206],"ingredient":[207],"which":[209,236,250,301],"solution":[212],"design":[215],"fractional":[218,239],".":[225,360],"study":[228],"H":[229,280,354,414],"ier":[230,281,355,415],"over":[245],"hierarchical":[247,292,340,412],"network,":[248],"failures":[251],"occur":[253],"hierarchy,":[261],"adversely":[269],"impact":[270],"all":[271],"its":[273],"descendants":[274],"hierarchy.":[277,452],"To":[278],"solve":[279],"introduce":[288],"notion":[290,325],"max-min":[293,327],"fairness":[294,328],"novel":[297],"Generalized":[298],"Spreading":[299],"algorithm,":[300],"simultaneously":[303],"optimal":[304],"every":[306],"upper":[307],"fail.":[320],"These":[321],"generalize":[322],"classical":[324],"work":[330],"differing":[334,336],"capacities,":[335],"reliability":[337],"weights,":[338],"structures.":[341],"Using":[342],"randomized":[343],"rounding,":[344],"extend":[346,407],"algorithm":[351,369],"integral":[353],"version,":[364,384,413],"achieves":[371],"additive":[373,424],"\u03f5":[374,423],"single":[382],"called":[385],"P":[386,416],"rob":[387,417],"while":[391,429],"giving":[392,430],"up":[393,431],"(1":[395],"+":[396,434],"\u03f5)":[397,435],"multiplicative":[398,436],"factor":[399,437],"number":[402,440,447],"failures.":[404],"result":[409],"achieving":[421],"(L":[433],"where":[443],"L":[444],"levels":[449]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2025-10-10T00:00:00"}