{"id":"https://openalex.org/W2726533958","doi":"https://doi.org/10.1109/ipdps.2017.14","title":"Bounded Reordering Allows Efficient Reliable Message Transmission","display_name":"Bounded Reordering Allows Efficient Reliable Message Transmission","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2726533958","doi":"https://doi.org/10.1109/ipdps.2017.14","mag":"2726533958"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2017.14","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2017.14","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","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/A5063630505","display_name":"Keishla D Ortiz-Lopez","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Keishla D Ortiz-Lopez","raw_affiliation_strings":["Department of Computer Science & Engineering, Texas A&M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014894919","display_name":"Jennifer L. Welch","orcid":"https://orcid.org/0000-0001-7164-1436"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jennifer L. Welch","raw_affiliation_strings":["Department of Computer Science & Engineering, Texas A&M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04975104,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"327","last_page":"336"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"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.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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.8421434760093689},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.8232805728912354},{"id":"https://openalex.org/keywords/communication-source","display_name":"Communication source","score":0.7616522312164307},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7513840198516846},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.5400198101997375},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4935711622238159},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.4794161021709442},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.435374915599823},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4143393933773041},{"id":"https://openalex.org/keywords/impossibility","display_name":"Impossibility","score":0.41075050830841064},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4078107476234436},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37739861011505127},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12242519855499268}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8421434760093689},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.8232805728912354},{"id":"https://openalex.org/C198104137","wikidata":"https://www.wikidata.org/wiki/Q974688","display_name":"Communication source","level":2,"score":0.7616522312164307},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7513840198516846},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.5400198101997375},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4935711622238159},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.4794161021709442},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.435374915599823},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4143393933773041},{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.41075050830841064},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4078107476234436},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37739861011505127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12242519855499268},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2017.14","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2017.14","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5099999904632568,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"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":16,"referenced_works":["https://openalex.org/W1236752170","https://openalex.org/W1487860367","https://openalex.org/W1590586151","https://openalex.org/W1973624402","https://openalex.org/W1978358700","https://openalex.org/W1986507065","https://openalex.org/W1988354148","https://openalex.org/W2017822947","https://openalex.org/W2021168082","https://openalex.org/W2028165551","https://openalex.org/W2062349674","https://openalex.org/W2083609879","https://openalex.org/W2089118959","https://openalex.org/W2130140280","https://openalex.org/W2154017671","https://openalex.org/W2165513513"],"related_works":["https://openalex.org/W2384156839","https://openalex.org/W4321602641","https://openalex.org/W2394251275","https://openalex.org/W4241392912","https://openalex.org/W2596801716","https://openalex.org/W4387391601","https://openalex.org/W2141614742","https://openalex.org/W2369846953","https://openalex.org/W2135714282","https://openalex.org/W1595373702"],"abstract_inverted_index":{"In":[0,79],"the":[1,13,48,58,60,69,89,105,118,129,132],"reliable":[2],"message":[3,22,37,138],"transmission":[4],"problem":[5,61],"(RMTP)":[6],"processors":[7,18],"communicate":[8],"by":[9],"exchanging":[10],"messages,":[11,59],"but":[12,96],"channel":[14,49],"that":[15,121],"connects":[16],"two":[17],"is":[19,39,62,77,101,113,140],"subject":[20],"to":[21,87,104,125,131],"loss,":[23],"duplication,":[24],"and":[25,41,134],"reordering.":[26],"Previous":[27],"work":[28],"focused":[29],"on":[30],"proposing":[31],"protocols":[32],"in":[33,72,102],"asynchronous":[34,70],"systems,":[35],"where":[36],"size":[38],"finite":[40],"sequence":[42],"numbers":[43],"are":[44],"bounded.":[45,78],"However,":[46],"if":[47],"can":[50],"duplicate":[51],"messages-but":[52],"not":[53,97],"lose":[54],"them-and":[55],"arbitrarily":[56],"reorder":[57],"unsolvable.":[63],"We":[64],"consider":[65],"a":[66],"strengthening":[67],"of":[68,75,107],"model":[71],"which":[73],"reordering":[74,112],"messages":[76,92,123],"this":[80],"model,":[81],"we":[82],"develop":[83],"an":[84,109],"efficient":[85],"protocol":[86,116],"solve":[88],"RMTP":[90],"when":[91,111,137],"may":[93],"be":[94,126],"duplicated":[95],"lost.":[98],"This":[99],"result":[100],"contrast":[103],"impossibility":[106],"such":[108],"algorithm":[110],"unbounded.":[114],"Our":[115],"has":[117],"pleasing":[119],"property":[120],"no":[122],"need":[124],"sent":[127],"from":[128],"receiver":[130],"sender":[133],"it":[135],"works":[136],"loss":[139],"allowed":[141],"with":[142],"some":[143],"minimal":[144],"modifications.":[145]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}