{"id":"https://openalex.org/W2963083228","doi":"https://doi.org/10.1109/infocom.2016.7524362","title":"Non-asymptotic delay bounds for (k, l) fork-join systems and multi-stage fork-join networks","display_name":"Non-asymptotic delay bounds for (k, l) fork-join systems and multi-stage fork-join networks","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2963083228","doi":"https://doi.org/10.1109/infocom.2016.7524362","mag":"2963083228"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2016.7524362","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524362","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","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/A5015087900","display_name":"Markus Fidler","orcid":"https://orcid.org/0000-0003-3490-6399"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Fidler","raw_affiliation_strings":["Institute of Communications Technology, Leibniz Universit\u00e4t, Hannover"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Communications Technology, Leibniz Universit\u00e4t, Hannover","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108054662","display_name":"Yuming Jiang","orcid":"https://orcid.org/0000-0002-9495-0888"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuming Jiang","raw_affiliation_strings":["Department of Telematics, NTNU, Trondheim"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Telematics, NTNU, Trondheim","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","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/computer-science","display_name":"Computer science","score":0.7364400029182434},{"id":"https://openalex.org/keywords/fork\u2013join-queue","display_name":"Fork\u2013join queue","score":0.7138653993606567},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.6728241443634033},{"id":"https://openalex.org/keywords/fork","display_name":"Fork (system call)","score":0.672514021396637},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.6489923000335693},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5580911040306091},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.49163371324539185},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.47714850306510925},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37603849172592163},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.28287163376808167},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23018842935562134},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17983785271644592},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09462881088256836}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7364400029182434},{"id":"https://openalex.org/C124444977","wikidata":"https://www.wikidata.org/wiki/Q4025962","display_name":"Fork\u2013join queue","level":4,"score":0.7138653993606567},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6728241443634033},{"id":"https://openalex.org/C40523978","wikidata":"https://www.wikidata.org/wiki/Q14675","display_name":"Fork (system call)","level":2,"score":0.672514021396637},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.6489923000335693},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5580911040306091},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.49163371324539185},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.47714850306510925},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37603849172592163},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.28287163376808167},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23018842935562134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17983785271644592},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09462881088256836},{"id":"https://openalex.org/C128220111","wikidata":"https://www.wikidata.org/wiki/Q4531011","display_name":"Queue management system","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2016.7524362","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524362","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W618449037","https://openalex.org/W1538285220","https://openalex.org/W1968846052","https://openalex.org/W1978905175","https://openalex.org/W1985615988","https://openalex.org/W1990998971","https://openalex.org/W1991466857","https://openalex.org/W1994154115","https://openalex.org/W1998066559","https://openalex.org/W2004439486","https://openalex.org/W2008154388","https://openalex.org/W2015774390","https://openalex.org/W2045966591","https://openalex.org/W2053140433","https://openalex.org/W2057397262","https://openalex.org/W2064224609","https://openalex.org/W2073121338","https://openalex.org/W2109125344","https://openalex.org/W2113381886","https://openalex.org/W2116690616","https://openalex.org/W2123807455","https://openalex.org/W2142917009","https://openalex.org/W2149650042","https://openalex.org/W2158352245","https://openalex.org/W2329656816","https://openalex.org/W2610913990","https://openalex.org/W2799137445","https://openalex.org/W3010052030","https://openalex.org/W3022010365","https://openalex.org/W4206809386","https://openalex.org/W4242372241","https://openalex.org/W6619470042","https://openalex.org/W6681037670"],"related_works":["https://openalex.org/W1513409726","https://openalex.org/W4300025912","https://openalex.org/W1896618351","https://openalex.org/W3150131656","https://openalex.org/W2963083228","https://openalex.org/W3207584223","https://openalex.org/W2199070405","https://openalex.org/W2287175615","https://openalex.org/W1970134260","https://openalex.org/W2036453481"],"abstract_inverted_index":{"Parallel":[0],"systems":[1,21,62,76,118,128],"have":[2,31,35],"received":[3],"increasing":[4],"attention":[5],"with":[6,119,129],"numerous":[7],"recent":[8],"applications":[9],"such":[10],"as":[11,121,123],"fork-join":[12,107,115,127],"systems,":[13,116],"load-balancing,":[14,120],"and":[15,64,90],"l-out-of-k":[16,140],"redundancy.":[17,130],"Common":[18],"to":[19,36,84],"these":[20],"is":[22],"a":[23,51,78],"join":[24],"or":[25],"resequencing":[26],"stage,":[27],"where":[28],"tasks":[29,43],"that":[30,45,81],"finished":[32],"service":[33],"may":[34],"wait":[37],"for":[38,105,112],"the":[39,48,58,136],"completion":[40],"of":[41,60,88,95,139],"other":[42],"so":[44],"they":[46],"leave":[47],"system":[49,97],"in":[50],"predefined":[52],"order.":[53],"These":[54],"synchronization":[55],"constraints":[56],"make":[57],"analysis":[59],"parallel":[61,75,117],"challenging":[63],"few":[65],"explicit":[66],"results":[67,132],"are":[68],"known.":[69],"In":[70],"this":[71],"work,":[72],"we":[73,99],"model":[74],"using":[77],"max-plus":[79,96],"approach":[80],"enables":[82],"us":[83],"derive":[85],"statistical":[86],"bounds":[87,104],"waiting":[89],"sojourn":[91],"times.":[92],"Taking":[93],"advantage":[94],"theory,":[98],"also":[100],"show":[101],"end-to-end":[102],"delay":[103],"multi-stage":[106],"networks.":[108],"We":[109],"contribute":[110],"solutions":[111],"basic":[113],"G|G|1":[114],"well":[122],"general":[124],"(k,":[125],"l)":[126],"Our":[131],"provide":[133],"insights":[134],"into":[135],"respective":[137],"advantages":[138],"redundancy":[141],"vs.":[142],"load-balancing.":[143]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}