{"id":"https://openalex.org/W7163530985","doi":"https://doi.org/10.1145/3815572.3815743","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","display_name":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","publication_year":2026,"publication_date":"2026-06-26","ids":{"openalex":"https://openalex.org/W7163530985","doi":"https://doi.org/10.1145/3815572.3815743"},"language":null,"primary_location":{"id":"doi:10.1145/3815572.3815743","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3815572.3815743","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Platform for Advanced Scientific Computing Conference","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3815572.3815743","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101032936","display_name":"Abrar Hossain","orcid":null},"institutions":[{"id":"https://openalex.org/I90871651","display_name":"University of Toledo","ror":"https://ror.org/01pbdzh19","country_code":"US","type":"education","lineage":["https://openalex.org/I90871651"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abrar Hossain","raw_affiliation_strings":["Electrical Engineering and Computer Science, University of Toledo, Toledo, Ohio, USA"],"raw_orcid":"https://orcid.org/0009-0006-7007-8104","affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science, University of Toledo, Toledo, Ohio, USA","institution_ids":["https://openalex.org/I90871651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5137859154","display_name":"Kishwar Ahmed","orcid":null},"institutions":[{"id":"https://openalex.org/I90871651","display_name":"University of Toledo","ror":"https://ror.org/01pbdzh19","country_code":"US","type":"education","lineage":["https://openalex.org/I90871651"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kishwar Ahmed","raw_affiliation_strings":["Electrical Engineering and Computer Science, University of Toledo, Toledo, Ohio, USA"],"raw_orcid":"https://orcid.org/0000-0001-6295-3569","affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science, University of Toledo, Toledo, Ohio, USA","institution_ids":["https://openalex.org/I90871651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I90871651"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.61732073,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"11"},"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.8223999738693237,"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.8223999738693237,"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.133200004696846,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.007300000172108412,"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/bidding","display_name":"Bidding","score":0.6869000196456909},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.5877000093460083},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5389000177383423},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4943000078201294},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.4797999858856201},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4690000116825104},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.42660000920295715},{"id":"https://openalex.org/keywords/resource-management","display_name":"Resource management (computing)","score":0.3984000086784363}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7462999820709229},{"id":"https://openalex.org/C9233905","wikidata":"https://www.wikidata.org/wiki/Q3276328","display_name":"Bidding","level":2,"score":0.6869000196456909},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.5877000093460083},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5572999715805054},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5389000177383423},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4943000078201294},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.4797999858856201},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4690000116825104},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.42660000920295715},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.3984000086784363},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38659998774528503},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.3630000054836273},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3395000100135803},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.32760000228881836},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.32600000500679016},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.3149000108242035},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.29499998688697815},{"id":"https://openalex.org/C197640229","wikidata":"https://www.wikidata.org/wiki/Q2534066","display_name":"Predictability","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C114237682","wikidata":"https://www.wikidata.org/wiki/Q5072483","display_name":"Channel allocation schemes","level":3,"score":0.27379998564720154},{"id":"https://openalex.org/C102486512","wikidata":"https://www.wikidata.org/wiki/Q457762","display_name":"Weighted fair queueing","level":3,"score":0.2709999978542328},{"id":"https://openalex.org/C2781011336","wikidata":"https://www.wikidata.org/wiki/Q1465133","display_name":"Time limit","level":2,"score":0.2703000009059906},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.26350000500679016},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.2597000002861023},{"id":"https://openalex.org/C203274722","wikidata":"https://www.wikidata.org/wiki/Q7001161","display_name":"Network performance","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3815572.3815743","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3815572.3815743","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Platform for Advanced Scientific Computing Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2606.00490","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2606.00490","pdf_url":"https://arxiv.org/pdf/2606.00490","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3815572.3815743","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3815572.3815743","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Platform for Advanced Scientific Computing Conference","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5624935626983643}],"awards":[{"id":"https://openalex.org/G2652618062","display_name":null,"funder_award_id":"CNS-2300124.","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6807013256","display_name":"CRII: CNS: Auction Mechanism Design for Energy-Efficient High Performance Computing","funder_award_id":"2300124","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":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Modern":[0],"High":[1],"Performance":[2],"Computing":[3],"(HPC)":[4],"centers":[5],"face":[6],"growing":[7],"challenges":[8],"in":[9],"ingesting":[10],"large":[11],"and":[12,25,32,44,59,82,103,145,189,198],"diverse":[13],"data":[14,101],"streams.":[15],"These":[16],"issues":[17],"often":[18,117],"create":[19],"bottlenecks":[20],"that":[21,99,126],"limit":[22],"bandwidth":[23,49,196],"use":[24],"delay":[26,161],"scientific":[27,104,204],"progress.":[28],"Traditional":[29],"static":[30],"allocation":[31],"simple":[33],"queuing":[34],"methods":[35],"are":[36],"not":[37],"sufficient.":[38],"This":[39,186],"paper":[40],"presents":[41],"a":[42],"dynamic":[43],"value":[45,113,187],"based":[46,70,202],"approach":[47],"to":[48,80,109,119,165,176,182,184],"allocation.":[50],"We":[51],"formalize":[52],"the":[53,72,83,111,156],"problem":[54],"by":[55,149,163,180],"incorporating":[56],"both":[57],"network":[58],"processing":[60],"constraints.":[61],"To":[62],"address":[63],"it,":[64],"we":[65],"introduce":[66],"two":[67],"new":[68],"auction":[69,128],"mechanisms:":[71],"Greedy":[73],"Value":[74],"Density":[75],"Auction,":[76,87],"which":[77,88],"is":[78,108],"fast":[79],"compute,":[81],"Vickrey-Clarke-Groves":[84],"(VCG)":[85],"Knapsack":[86],"offers":[89],"strong":[90],"theoretical":[91],"guarantees.":[92],"Both":[93],"mechanisms":[94,129],"rely":[95],"on":[96,203],"user":[97],"bids":[98],"include":[100],"needs":[102],"value.":[105],"The":[106],"goal":[107],"maximize":[110],"total":[112],"of":[114,158,160],"successful":[115],"transfers,":[116],"referred":[118],"as":[120,170],"social":[121],"welfare.":[122],"Simulation":[123],"results":[124],"show":[125],"our":[127],"significantly":[130],"outperform":[131],"First":[132,134],"Come":[133],"Served":[135],"(FCFS)":[136],"baselines.":[137],"In":[138],"high":[139],"load":[140,173],"conditions,":[141],"they":[142],"reduce":[143,193],"average":[144],"tail":[146],"completion":[147],"delays":[148],"over":[150],"80%.":[151],"Predictability":[152],"also":[153],"improves,":[154],"with":[155,172],"Coefficient":[157],"Variation":[159],"falling":[162],"75":[164],"85%.":[166],"Network":[167],"stability":[168],"increases":[169],"well,":[171],"volatility":[174],"(Peak":[175],"Average":[177],"Ratio)":[178],"dropping":[179],"up":[181],"60":[183],"70%.":[185],"driven":[188],"adaptive":[190],"strategy":[191],"helps":[192],"congestion,":[194],"improves":[195],"use,":[197],"ensures":[199],"fairer":[200],"access":[201],"importance.":[205]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-06-05T00:00:00"}