1 resultado para llw (send)
em Massachusetts Institute of Technology
Filtro por publicador
- JISC Information Environment Repository (1)
- Academic Archive On-line (Mid Sweden University; Sweden) (1)
- Academic Research Repository at Institute of Developing Economies (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (4)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (5)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Aquatic Commons (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (3)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (1)
- Archive of European Integration (5)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (5)
- Aston University Research Archive (11)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (1)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (1)
- Biblioteca Digital da Câmara dos Deputados (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (2)
- Biblioteca Digital de la Universidad Católica Argentina (3)
- Blue Tiger Commons - Lincoln University - USA (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (6)
- Boston University Digital Common (4)
- Brock University, Canada (31)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (3)
- CaltechTHESIS (3)
- Cambridge University Engineering Department Publications Database (1)
- CentAUR: Central Archive University of Reading - UK (10)
- Central European University - Research Support Scheme (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (7)
- Cochin University of Science & Technology (CUSAT), India (3)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (3)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Dalarna University College Electronic Archive (4)
- Deakin Research Online - Australia (24)
- Digital Commons - Michigan Tech (4)
- Digital Commons at Florida International University (10)
- Digital Peer Publishing (2)
- Digital Repository at Iowa State University (1)
- DigitalCommons@The Texas Medical Center (3)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (3)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (2)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (7)
- FUNDAJ - Fundação Joaquim Nabuco (2)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (1)
- Harvard University (15)
- Helda - Digital Repository of University of Helsinki (4)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (83)
- Instituto Politécnico do Porto, Portugal (2)
- Instituto Superior de Psicologia Aplicada - Lisboa (1)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (1)
- Martin Luther Universitat Halle Wittenberg, Germany (1)
- Massachusetts Institute of Technology (1)
- Memoria Académica - FaHCE, UNLP - Argentina (3)
- Ministerio de Cultura, Spain (2)
- National Center for Biotechnology Information - NCBI (4)
- Nottingham eTheses (1)
- Portal de Revistas Científicas Complutenses - Espanha (4)
- Publishing Network for Geoscientific & Environmental Data (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (13)
- Queensland University of Technology - ePrints Archive (49)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (4)
- Repositório digital da Fundação Getúlio Vargas - FGV (8)
- Repositório Institucional da Universidade de Aveiro - Portugal (5)
- Repositório Institucional da Universidade de Brasília (2)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (2)
- Repositório Institucional da Universidade Federal do Rio Grande do Norte (3)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (47)
- Research Open Access Repository of the University of East London. (2)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- School of Medicine, Washington University, United States (2)
- South Carolina State Documents Depository (1)
- Universidad de Alicante (4)
- Universidad del Rosario, Colombia (7)
- Universidad Politécnica de Madrid (32)
- Universidade Federal do Pará (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (17)
- Universidade Metodista de São Paulo (5)
- Universitat de Girona, Spain (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (3)
- Université de Montréal (1)
- Université de Montréal, Canada (13)
- Université Laval Mémoires et thèses électroniques (1)
- University of Connecticut - USA (3)
- University of Michigan (12)
- University of Queensland eSpace - Australia (7)
- University of Washington (1)
- WestminsterResearch - UK (1)
Resumo:
In this paper, we discuss the consensus problem for synchronous distributed systems with orderly crash failures. For a synchronous distributed system of n processes with up to t crash failures and f failures actually occur, first, we present a bivalency argument proof to solve the open problem of proving the lower bound, min (t + 1, f + 2) rounds, for early-stopping synchronous consensus with orderly crash failures, where t < n - 1. Then, we extend the system model with orderly crash failures to a new model in which a process is allowed to send multiple messages to the same destination process in a round and the failing processes still respect the order specified by the protocol in sending messages. For this new model, we present a uniform consensus protocol, in which all non-faulty processes always decide and stop immediately by the end of f + 1 rounds. We prove that the lower bound of early stopping protocols for both consensus and uniform consensus are f + 1 rounds under the new model, and our proposed protocol is optimal.