{"id":"https://openalex.org/W2992990865","doi":"https://doi.org/10.1109/allerton.2019.8919929","title":"Redundancy Scheduling in Systems with Bi-Modal Job Service Time Distributions","display_name":"Redundancy Scheduling in Systems with Bi-Modal Job Service Time Distributions","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2992990865","doi":"https://doi.org/10.1109/allerton.2019.8919929","mag":"2992990865"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2019.8919929","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2019.8919929","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/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":["Rutgers University, the State University of New Jersey,Department of Electrical and Computer Engineering,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, the State University of New Jersey,Department of Electrical and Computer Engineering,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":["Rutgers University, the State University of New Jersey,Department of Electrical and Computer Engineering,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, the State University of New Jersey,Department of Electrical and Computer Engineering,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":1.2018,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77619856,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"9","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9980000257492065,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980000257492065,"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.9968000054359436,"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"}},{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7583380937576294},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.6244487762451172},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6008827090263367},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.577132523059845},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.5156249403953552},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.45275992155075073},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.42887449264526367},{"id":"https://openalex.org/keywords/fair-queuing","display_name":"Fair queuing","score":0.4159778654575348},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3275706171989441},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3152554929256439},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22206568717956543},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.19346323609352112},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11714091897010803},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09929707646369934}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7583380937576294},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.6244487762451172},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6008827090263367},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.577132523059845},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.5156249403953552},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.45275992155075073},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.42887449264526367},{"id":"https://openalex.org/C143647952","wikidata":"https://www.wikidata.org/wiki/Q1392979","display_name":"Fair queuing","level":5,"score":0.4159778654575348},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3275706171989441},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3152554929256439},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22206568717956543},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.19346323609352112},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11714091897010803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09929707646369934},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2019.8919929","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2019.8919929","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6800000071525574,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1505793925","https://openalex.org/W1587463421","https://openalex.org/W1903497807","https://openalex.org/W1979946760","https://openalex.org/W1982063824","https://openalex.org/W1983964956","https://openalex.org/W1985292121","https://openalex.org/W1997988698","https://openalex.org/W2013582597","https://openalex.org/W2064224609","https://openalex.org/W2096092966","https://openalex.org/W2101204871","https://openalex.org/W2108728916","https://openalex.org/W2139571722","https://openalex.org/W2154614311","https://openalex.org/W2166005686","https://openalex.org/W2248022866","https://openalex.org/W2252170720","https://openalex.org/W2268702383","https://openalex.org/W2307033123","https://openalex.org/W2604490148","https://openalex.org/W2757172027","https://openalex.org/W2894985208","https://openalex.org/W2945624024","https://openalex.org/W2945751652","https://openalex.org/W2963531643","https://openalex.org/W2963871418","https://openalex.org/W2982519549","https://openalex.org/W3017267989","https://openalex.org/W3083946488","https://openalex.org/W3100515187","https://openalex.org/W3113961955","https://openalex.org/W4231356307","https://openalex.org/W4288349379","https://openalex.org/W6639528875","https://openalex.org/W6698469232","https://openalex.org/W6762589954"],"related_works":["https://openalex.org/W2132767805","https://openalex.org/W2581865514","https://openalex.org/W2361230975","https://openalex.org/W2043600582","https://openalex.org/W4241198902","https://openalex.org/W4248368233","https://openalex.org/W3173601542","https://openalex.org/W4388174918","https://openalex.org/W2622283040","https://openalex.org/W137239617"],"abstract_inverted_index":{"Queuing":[0],"systems":[1,50,54],"with":[2,55],"redundant":[3],"requests":[4],"have":[5,63],"drawn":[6],"great":[7],"attention":[8],"because":[9],"of":[10,25,39,97,122],"their":[11],"promise":[12],"to":[13,81,91,168],"reduce":[14],"the":[15,28,37,93,112,123,154,159,164],"job":[16,57],"completion":[17],"time":[18,59,95,125],"and":[19,85,88,104,115,143,170],"variability.":[20],"Despite":[21],"a":[22,82,133],"large":[23],"body":[24],"work":[26],"on":[27,140],"topic,":[29],"we":[30],"are":[31,119],"still":[32],"far":[33],"from":[34],"fully":[35],"understanding":[36],"benefits":[38],"redundancy":[40],"in":[41,66,111,126],"practice.":[42],"We":[43,77,106,130],"here":[44],"take":[45],"one":[46],"step":[47],"towards":[48],"practical":[49],"by":[51],"studying":[52],"queuing":[53,94,124,165],"bi-modal":[56],"service":[58],"distribution.":[60],"Such":[61],"distributions":[62],"been":[64],"observed":[65],"practice,":[67],"as":[68,158],"can":[69],"be":[70],"seen":[71],"in,":[72],"e.g.,":[73],"Google":[74],"cluster":[75],"traces.":[76],"develop":[78],"an":[79],"analogy":[80],"classical":[83,100],"urns":[84],"balls":[86],"problem,":[87],"use":[89],"it":[90,146],"study":[92],"performance":[96,109,149,160],"two":[98],"non-adaptive":[99,127,134],"scheduling":[101,128,135,156],"policies:":[102],"random":[103,169],"round-robin.":[105],"introduce":[107],"new":[108],"indicators":[110,161],"analogous":[113],"model,":[114],"argue":[116],"that":[117,137,145,153],"they":[118],"good":[120],"predictors":[121],"policies.":[129],"then":[131],"propose":[132],"policy":[136],"is":[138],"based":[139],"combinatorial":[141],"designs,":[142],"show":[144],"has":[147],"better":[148],"indicators.":[150],"Simulations":[151],"confirm":[152],"proposed":[155],"policy,":[157],"suggest,":[162],"reduces":[163],"times":[166],"compared":[167],"round-robin":[171],"scheduling.":[172]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}