{"id":"https://openalex.org/W4412482040","doi":"https://doi.org/10.1145/3694906.3743344","title":"Brief Announcement: Stochastic Parallel Scheduling with Bandit Feedback","display_name":"Brief Announcement: Stochastic Parallel Scheduling with Bandit Feedback","publication_year":2025,"publication_date":"2025-07-16","ids":{"openalex":"https://openalex.org/W4412482040","doi":"https://doi.org/10.1145/3694906.3743344"},"language":"en","primary_location":{"id":"doi:10.1145/3694906.3743344","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743344","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743344","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743344","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010513899","display_name":"Gerdus Benad\u00e8","orcid":"https://orcid.org/0000-0002-0024-0026"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gerdus Benad\u00e8","raw_affiliation_strings":["Boston University, Boston, Massachusetts, USA"],"raw_orcid":"https://orcid.org/0000-0002-0024-0026","affiliations":[{"raw_affiliation_string":"Boston University, Boston, Massachusetts, USA","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020629410","display_name":"Rathish Das","orcid":"https://orcid.org/0000-0002-2416-6422"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rathish Das","raw_affiliation_strings":["University of Houston, Houston, Texas, USA"],"raw_orcid":"https://orcid.org/0000-0002-2416-6422","affiliations":[{"raw_affiliation_string":"University of Houston, Houston, Texas, USA","institution_ids":["https://openalex.org/I44461941"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088408128","display_name":"Thomas Lavastida","orcid":"https://orcid.org/0009-0007-7874-1908"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Lavastida","raw_affiliation_strings":["University of Texas at Dallas, Richardson, Texas, USA"],"raw_orcid":"https://orcid.org/0009-0007-7874-1908","affiliations":[{"raw_affiliation_string":"University of Texas at Dallas, Richardson, Texas, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5010513899"],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19783045,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"618","last_page":"622"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7236042618751526},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6301143169403076},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4778834879398346},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.381308913230896},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33995282649993896},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3047906756401062},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1256944239139557},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10258370637893677}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7236042618751526},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6301143169403076},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4778834879398346},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.381308913230896},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33995282649993896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3047906756401062},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1256944239139557},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10258370637893677},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3694906.3743344","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743344","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743344","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3694906.3743344","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743344","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743344","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412482040.pdf","grobid_xml":"https://content.openalex.org/works/W4412482040.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W156783644","https://openalex.org/W398859631","https://openalex.org/W1515397553","https://openalex.org/W1570963478","https://openalex.org/W1969292692","https://openalex.org/W1974114807","https://openalex.org/W1980938359","https://openalex.org/W2014423113","https://openalex.org/W2061753713","https://openalex.org/W2071104320","https://openalex.org/W2118328307","https://openalex.org/W2134422938","https://openalex.org/W2560674852","https://openalex.org/W2778937346","https://openalex.org/W2784121118","https://openalex.org/W2903753352","https://openalex.org/W2914156981","https://openalex.org/W2990138404","https://openalex.org/W3128171061","https://openalex.org/W4205841652","https://openalex.org/W4206275166","https://openalex.org/W4285010250","https://openalex.org/W4390306300","https://openalex.org/W4390575667","https://openalex.org/W4398220249"],"related_works":["https://openalex.org/W1809394610","https://openalex.org/W2128410848","https://openalex.org/W2118368532","https://openalex.org/W2014085448","https://openalex.org/W2102390841","https://openalex.org/W3047653192","https://openalex.org/W2096289371","https://openalex.org/W2126232624","https://openalex.org/W2434525066","https://openalex.org/W3140149227"],"abstract_inverted_index":{"We":[0,71],"study":[1],"the":[2,13,24,33,35,40,48,56,96,116,120,134,145,149,160,165],"fundamental":[3],"problem":[4,49],"of":[5,50,90,119,156,164],"scheduling":[6,85],"jobs":[7,105],"with":[8,83],"stochastic":[9,104],"sizes":[10],"to":[11,29,32,53,65,99,108,143],"minimize":[12,144],"total":[14,146,153],"completion":[15,154],"time":[16,155],"for":[17,39,102],"both":[18],"single":[19],"and":[20,61,112,122],"parallel":[21,110],"machines.":[22],"Traditionally,":[23],"size":[25,57,138],"distributions":[26,58],"are":[27,59,63],"assumed":[28],"be":[30],"known":[31],"scheduler;":[34],"challenge":[36],"is":[37,142],"accounting":[38],"stochasticity.":[41],"Departing":[42],"from":[43,69,162],"prior":[44],"work,":[45],"we":[46,62],"explore":[47],"efficiently":[51],"learning":[52,76],"schedule":[54,101,167],"when":[55],"unknown":[60],"unable":[64],"directly":[66],"obtain":[67],"samples":[68],"it.":[70],"adopt":[72],"an":[73,80],"online":[74],"bandit":[75],"framework":[77],"in":[78,151],"which":[79],"algorithm":[81,97,161],"interacts":[82],"a":[84,88,100],"environment":[86],"over":[87],"series":[89],"T":[91],"periods.":[92],"In":[93],"each":[94],"period,":[95],"commits":[98],"n":[103],"on":[106],"up":[107],"m":[109],"machines":[111],"then":[113],"observes":[114],"only":[115],"random":[117],"cost":[118],"schedule,":[121],"not":[123],"individual":[124],"job":[125,137],"sizes.":[126],"This":[127],"so-called":[128],"bandit-feedback":[129],"provides":[130],"limited":[131],"information":[132],"about":[133],"underlying":[135],"(unknown)":[136],"distributions.":[139],"The":[140],"objective":[141],"regret":[147],"---":[148],"difference":[150],"expected":[152],"schedules":[157],"chosen":[158],"by":[159],"that":[163],"optimal":[166],"under":[168],"complete":[169],"information.":[170]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}