{"id":"https://openalex.org/W4293198599","doi":"https://doi.org/10.1109/jsait.2022.3197675","title":"Balanced Nonadaptive Redundancy Scheduling","display_name":"Balanced Nonadaptive Redundancy Scheduling","publication_year":2022,"publication_date":"2022-06-01","ids":{"openalex":"https://openalex.org/W4293198599","doi":"https://doi.org/10.1109/jsait.2022.3197675"},"language":"en","primary_location":{"id":"doi:10.1109/jsait.2022.3197675","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsait.2022.3197675","pdf_url":null,"source":{"id":"https://openalex.org/S4210211895","display_name":"IEEE Journal on Selected Areas in Information Theory","issn_l":"2641-8770","issn":["2641-8770"],"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 Journal on Selected Areas in Information Theory","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/A5004024161","display_name":"Amir Behrouzi-Far","orcid":"https://orcid.org/0000-0003-4089-235X"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amir Behrouzi-Far","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Rutgers University, New Brunswick, NJ, USA"],"raw_orcid":"https://orcid.org/0000-0003-4089-235X","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Rutgers University, New Brunswick, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034577486","display_name":"Emina Soljanin","orcid":"https://orcid.org/0000-0002-7464-4242"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emina Soljanin","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Rutgers University, New Brunswick, NJ, USA"],"raw_orcid":"https://orcid.org/0000-0002-7464-4242","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Rutgers University, New Brunswick, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":0.3138,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62290797,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":"2","first_page":"422","last_page":"430"},"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.9980000257492065,"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.9980000257492065,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9970999956130981,"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/T12288","display_name":"Optimization and Search Problems","score":0.9968000054359436,"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/computer-science","display_name":"Computer science","score":0.7566999197006226},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5848485231399536},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5538373589515686},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.550628125667572},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.5504999756813049},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.524256706237793},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.5072371959686279},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.49556243419647217},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.44557714462280273},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.43965548276901245},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3579292893409729},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33716195821762085},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.18901166319847107},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18020880222320557},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08592367172241211},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.06820303201675415}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7566999197006226},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5848485231399536},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5538373589515686},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.550628125667572},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.5504999756813049},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.524256706237793},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5072371959686279},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.49556243419647217},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.44557714462280273},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.43965548276901245},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3579292893409729},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33716195821762085},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18901166319847107},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18020880222320557},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08592367172241211},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.06820303201675415}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/jsait.2022.3197675","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsait.2022.3197675","pdf_url":null,"source":{"id":"https://openalex.org/S4210211895","display_name":"IEEE Journal on Selected Areas in Information Theory","issn_l":"2641-8770","issn":["2641-8770"],"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 Journal on Selected Areas in Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G4719617011","display_name":"REU Site: DIMACS REU in Computing Theory and Applications Impacting Society","funder_award_id":"1559855","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5418600187","display_name":"CIF:Small:Collaborative Research:Codes for Storage with Queues for Access","funder_award_id":"1717314","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1482612231","https://openalex.org/W1491226129","https://openalex.org/W1587463421","https://openalex.org/W1631603072","https://openalex.org/W1982063824","https://openalex.org/W1997988698","https://openalex.org/W2064224609","https://openalex.org/W2096092966","https://openalex.org/W2108728916","https://openalex.org/W2139571722","https://openalex.org/W2148777482","https://openalex.org/W2248022866","https://openalex.org/W2252170720","https://openalex.org/W2268702383","https://openalex.org/W2290712622","https://openalex.org/W2307033123","https://openalex.org/W2460371668","https://openalex.org/W2604490148","https://openalex.org/W2894985208","https://openalex.org/W2945751652","https://openalex.org/W2962941774","https://openalex.org/W2963531643","https://openalex.org/W2963871418","https://openalex.org/W2977030270","https://openalex.org/W2992990865","https://openalex.org/W2997214873","https://openalex.org/W3007962222","https://openalex.org/W3017267989","https://openalex.org/W3100515187","https://openalex.org/W3121638581","https://openalex.org/W3145116747","https://openalex.org/W3213046182","https://openalex.org/W3213652509","https://openalex.org/W4288349379","https://openalex.org/W4293062905","https://openalex.org/W6698469232","https://openalex.org/W6751025625","https://openalex.org/W6762589954","https://openalex.org/W6783497943"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2225350526","https://openalex.org/W1545991362","https://openalex.org/W2372008037","https://openalex.org/W4386580182","https://openalex.org/W4386764057","https://openalex.org/W2397293317","https://openalex.org/W2978148977","https://openalex.org/W2365679959","https://openalex.org/W2106332846"],"abstract_inverted_index":{"Distributed":[0],"computing":[1,20],"systems":[2,31,53],"implement":[3],"redundancy":[4,27],"to":[5,45,191,193,196,202,205],"reduce":[6],"the":[7,22,47,60,86,89,116,120,125,129,141,145,161,164,169,184,189,197,206],"job":[8],"completion":[9],"time":[10,187],"and":[11,76,79,81,99,134,175,200],"variability.":[12],"Despite":[13],"a":[14,104],"large":[15],"body":[16],"of":[17,26,49,62,67,88,128,144,154],"work":[18],"about":[19],"redundancy,":[21],"analytical":[23],"performance":[24,48,83,121,143,162],"evaluation":[25],"techniques":[28],"in":[29,52,178,188],"queuing":[30],"is":[32],"still":[33],"an":[34],"open":[35],"problem.":[36],"In":[37,56],"this":[38,71],"work,":[39],"we":[40,58,73],"take":[41],"one":[42],"step":[43],"forward":[44],"analyze":[46],"scheduling":[50,96,105,118,177],"policies":[51],"with":[54,113,132],"redundancy.":[55],"particular,":[57],"study":[59,124],"pattern":[61],"shared":[63],"servers":[64],"among":[65],"replicas":[66],"different":[68,179],"jobs.":[69],"To":[70],"end,":[72],"employ":[74],"combinatorics":[75],"graph":[77],"theory":[78],"define":[80],"derive":[82],"indicators":[84],"using":[85],"statistics":[87],"overlaps.":[90],"We":[91,101,123],"consider":[92],"two":[93],"classical":[94],"nonadaptive":[95],"policies:":[97],"random":[98,174,198],"round-robin.":[100],"then":[102],"propose":[103],"policy":[106,148,172,199],"based":[107],"on":[108],"combinatorial":[109],"block":[110,135,146,170],"designs.":[111],"Compared":[112],"conventional":[114],"scheduling,":[115],"proposed":[117],"improves":[119],"indicators.":[122],"expansion":[126,152],"property":[127],"graphs":[130],"associated":[131,156],"round-robin":[133,176,207],"design-based":[136,147,171],"policies.":[137],"It":[138],"turns":[139],"out":[140],"superior":[142],"results":[149,166],"from":[150],"better":[151],"properties":[153],"its":[155],"graph.":[157],"As":[158],"indicated":[159],"by":[160],"indicators,":[163],"simulation":[165],"show":[167],"that":[168],"outperforms":[173],"scenarios.":[180],"Specifically,":[181],"it":[182],"reduces":[183],"average":[185],"waiting":[186],"queue":[190],"up":[192,201],"25%":[194],"compared":[195,204],"100%":[203],"policy.":[208]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}
