DOCSLIB.ORG

G-36-649 (Sub-Project Under E-21-626/Paris/EE)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
G-36-649 (Sub-Project Under E-21-626/Paris/EE) GEORGIA INSTITUTE OF TECHNOLOGY OFFICE OF CONTRACT ADMINISTRATION SPONSORED PROJECT INITIATION Date: February 29, 1980 Project Title: RADC Post-Doctoral Program (C4 Systems) Project No: G-36-649 (Sub-project under E-21-626/Paris/EE) Project Director: Dr. P. H. Enslaw Sponsor: USAF, AFSC, Rome Air Development Center, Griffiss AFB, NY 13441 Agreement Period: From 1/15/80 Until 9/30/80 (Task Performance Period) Type Agreement: Contract No. F30602-78-C-0120 Amount: $44,453 RADC (G-36-649) 4,949 GIT (G-36-337) $49,392 TOTAL Reports Required: Task Technical Report; Presentation Material (For other reporting requirements see E-21-626) Sponsor Contact Person (s): Technical Matters Contractual Matters (thru OCA) Dr. D. T. Paris Director School of Electrical Engineering Campus Extension 2902 Defense Priority Rating: DO-A7 under DMS Reg. 1 Assigned to: Tnfnrmatinn and Crxrtiputer Science (School/Laboratory) COPIES TO: Project Director Library, Technical Reports Section Division Chief (EES) EES Information Office School/Laboratory Director EESRegtons&Procedurim Dean/Director—EES ProjectFlIelMO Accounting Office Project Code (GTRI) Procurement Office Other Dr. D. T. Paris/EE SecurityCoordinator(OCA) ar‘pmrtsCotn-dimttorACICA) Research Property Coordinator “X7.10 CA-3 (3/76) GEORGIA INSTITUTE OF TECHNOLOGY • 4-) OFFICE OF CONTRACT ADMINISTRATION SPONSORED PROJECT TERMINATION Date: March 19, 1981 Project Title: RADC Post—Doctoral Program (C—E Systems) Project No: G-36-649 Project Director: Dr. P. H. Enslow Sponsor: USAF/RADC/Griffiss AFB, NY Effective Termination Date: 9/30/80 Clearance of Accounting Charges: 9/30/80 Grant/Contract CloseoutNone Actions Remaining: Final Invoice and Closing Documents Final Fiscal Report Final Report of Inventions Govt. Property Inventory & Related Certificate Classified Material Certificate Other Assigned to: ICS (Schoolary) COPIES TO: Project Director Library, Technical Reports Section Division Chief (EES) EES Information Office School/Laboratory Director Project File (OCA) Dean/Director—EES Project Code (GTRI) Accounting Office Other Dr. D. T. Paris Procurement Office Security Coordinator (OCA) _,.Reports Coordinator (OCA) Research Property Management CA-4 (1/79) THE GEORGIA INSTITUTE OF TECHNOLOGY RESEARCH PROGRAM IN FULLY DISTRIBUTED PROCESSING SYSTEMS Quarterly Progress Report Number 1 1 September, 1979 — 30 November, 1979 January, 1980 Supported by Office of Naval Research Contract N00014-79—C-0873 School of Information and Computer Science Georgia Institute of Technology Atlanta, Georgia 30332 GIT FDPS Research Program Quarterly Prod Report 1 1. INIBOWCIati This is the first quarterly progress report prepared on the Georgia Tech Research Program in Fully Distributed Proces- sing Systems (FDPS). On 1 September, 1979, the School of Information and Computer Science, the Georgia Institute of Technology, received a Selected Research Opportunity (SRO) contract from the Office of Naval Research to establish a "Center of Fxcellence for Research in Highly Distributed Systems." This contract covers a three-year period of operation with a total funding of $1,114,620 plus an additional $250,000 cost sharing from Georgia Tech for equipment. Final negotiations are under way with three other organizations for additional research contracts in this area. It is anticipated that those contracts will be awarded in December, 1979. In addition, another research contract for a three-year period has al- ready been awarded to an individual faculty member in the School of Information and Computer Science---U.S. Army Research Office, "Theory of Systems of Asynchronous Parallel Processors," Nancy Lynch, 3 years, approximately $150,000. Although distributed processing systems, especially highly distributed and fully distributed ones, have been a subject of interest and research (unfunded for the most part) within the School for the Last three years, this is the first major funding received in this area, and these first three months of the project have been devoted primarily to organizational matters and the initiation of specific research projects and tasks. Since it is strongly felt that the maximum accomplishments will be achieved by the synergistic effects of a large num- ber of individuals working together and interacting, it is planned that the Research Program will be run as a single program with specific directions for the research areas be- ing taken from individual sponsors as appropriate. Z. HfitiNIZEIQU Ata 5.THEINi The following members of the ICS Faculty have been identified as participants in the FDPS Research Program. Crews, Phillip--Assistant Professor Demillo, Richard A.--Associate Professor Fnslow, Philip H. Jr.--Professor Griffeth, Nancy--Assistant Professor GIT FDPS Research Program Quarterly Prog Report 1 LeBlanc, Richard--Assistant Professor Livesey, Jon--Assistant Professor (effective April, 1980) Lynch, Nancy--Associate Professor Underwood, William—Assistant Professor Most of these individuals are presently working on specific projects in the program, while others are completing other work already in progress. Mal Jensen, Alton P.--Princ. Res. Eng. McDonell, Sharon--Sr. Secy. Myers, Jeanette--Res. Scientist Peckham, Gary (EES)--Chief, Software Applications Div. Pinion, Nancy--Part-time Secy. ktusitotz There are 27 students working on various projects in the FDPS Research Program. Of these, 12 are in the Ph.D. program and 4 are preparing MS Thesis on topics in FDPS. 1. EglEintl EENIECl2 INIILAIER The specific research projects have been organized into the major areas identified in the Program Proposal. A. 'Warn/ant Rod Emit 5tudita A.1 Studies of the Theory of Asynchronous Processors B- Intrigootstin log Uttnekin C. tistributtd ktratipg 2xattma C.1 Decentralized Control C.2 Resource Allocation and Work Distribution in an FDPS C.3 Distributed Operating System - Initial Considerations C.4 TBA (Distributed Operating Systems) C.5 TBA (Distributed Operating Systems) C.6 TBA (Distributed and Parallel Operating Systems) D. fliztribut2d Qati Ulm D.1 TBA (Distributed Data Bases) Page -3- GIT FDPS Research Program Quarterly Prod Report 1 E. FawII:I2Itranit F. §2t91i1 L1 2E21+113 12 221222n FDPS G. A212iitati20 2f kilta2Ut22 EL2italie9 G.1 TBA (FDPS Effects on Management Organization) H. §Y11293 Otl12D Mttb222122i21 H.1 FDPS Requirements Engineering Techniques H.2 Coordinating Large Programming Projects I - §YltIM U1i41Ziti2D I.1 A Language for Distributed Programming I.? System Implementation Language Development J. a lur ity J.1 Process Structures K. §YitIM MADA91Mtet L. EmliwAtin ang MD2Ral2D M. fl/E2 ItlIttl M.1 Establishment of FDPS Testbed Facility M.2 Remote Load Emulator 4. §IAIU§ Qf !IMAM HUM§ With the exception of project A.1, "Studies of the Theory of Asynchronous Processors," all of the projects listed above were initiated in the first quarter of the Program and no immediate results are anticipated with one exception, Project H.1, "FDPS Requirements Engineering Techniques", was only a 3-month study and has been completed except for the final report. MERCY 21 Et2illt A.1 t2 ht A very general and tractable automaton-style model has been designed for describing distributed systems. Details of the formalism, as well as some prototypical arbiter examples, appear in reference Eb]. The model separates the machinery used to describe the requirements for and the implementation of a system. Complexity measures for implementations have been proposed in Eb], most importantly including a natural Page -4- GIT FDPS Research Program Quarterly Prog Report 1 measure of "running time" for asychronous systems. Analysis using this measure has been carried out for the examples in Cb]. Some techniques derived from those used in ordinary sequential complexity theory have been carried over to the new distributed setting. Suggestions have been made for the types of system parameters whose measurement is of greatest interest. For the specific arbiter examples appearing in Cb], our analysis has suggested a particular system design consistig of a tree of polling processes, which has been im- plemented at the University of Washington for actual use in their computer system. Preliminary observations suggest that the design does in fact perform efficiently. Work in Ca] involves measurement of the space complexity of algorithms for mutual exclusion. There are many results of technical interest, providing upper and lower bounds on the amount of storage required for the attainment of certain fairness properties. A major contribution of Ca] has been the development of a concise mathematical notation for describing the execution of systems. We are able to describe precisely many alternative execution possibilities for a system, a task which is extremely difficult to do in English. It is this precision which allows us to prove meaningful lower bound results. Specific technical results of Ca] demonstrate ways in which communication space (band- width) can be used simultaneously for several purposes, without danger of confusion. In Cc], the problem of designing algorithms which are immune to a limited amount of (non-malicious) process failure is considered. The problem area studied is a generalization of the problem in Ca], involving allocation of multiple copies of identical resources. One key contribution of Cc] is the careful statement of conditions of "graceful degradation of performance" -- exactly what the system is still required to do when a small number of processors fail. Another contribution is the design of some specific ways
Load more

Recommended publications
  • Kein Folientitel
    182.703: Problems in Distributed Computing (Part 3) WS 2019 Ulrich Schmid Institute of Computer Engineering, TU Vienna Embedded Computing Systems Group E191-02 [email protected] Content (Part 3) The Role of Synchrony Conditions Failure Detectors Real-Time Clocks Partially Synchronous Models Models supporting lock-step round simulations Weaker partially synchronous models Dynamic distributed systems U. Schmid 182.703 PRDC 2 The Role of Synchrony Conditions U. Schmid 182.703 PRDC 3 Recall Distributed Agreement (Consensus) Yes No Yes NoYes? None? meet All meet Yes No No U. Schmid 182.703 PRDC 4 Recall Consensus Impossibility (FLP) Fischer, Lynch und Paterson [FLP85]: “There is no deterministic algorithm for solving consensus in an asynchronous distributed system in the presence of a single crash failure.” Key problem: Distinguish slow from dead! U. Schmid 182.703 PRDC 5 Consensus Solvability in ParSync [DDS87] (I) Dolev, Dwork and Stockmeyer investigated consensus solvability in Partially Synchronous Systems (ParSync), varying 5 „synchrony handles“ : • Processors synchronous / asynchronous • Communication synchronous / asynchronous • Message order synchronous (system-wide consistent) / asynchronous (out-of-order) • Send steps broadcast / unicast • Computing steps atomic rec+send / separate rec, send U. Schmid 182.703 PRDC 6 Consensus Solvability in ParSync [DDS87] (II) Wait-free consensus possible Consensus impossible s/r Consensus possible s+r for f=1 ucast bcast async sync Global message order message Global async sync Communication U. Schmid 182.703 PRDC 7 The Role of Synchrony Conditions Enable failure detection Enforce event ordering • Distinguish „old“ from „new“ • Ruling out existence of stale (in-transit) information • Distinguish slow from dead • Creating non-overlapping „phases of operation“ (rounds) U.
    [Show full text]
  • Distinguished Lecture Series
    DISTINGUISHED LECTURE SERIES NANCY LYNCH NEC Professor of Software Science and Engineering, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology “A Theoretical View of Distributed Systems” Thursday, January 30, 2020 • 2-3 p.m Donald Bren Hall, Room 6011 ABSTRACT For several decades, my collaborators, students, and I have worked on theory for distributed systems, in order to understand their capabilities and limitations in a rigorous, mathematical way. This work has produced many different kinds of results, including: • Abstract models for problems that are solved by distributed systems, and for the algorithms used to solve them, • Rigorous proofs of algorithm correctness and performance properties (also some error discoveries), • Impossibility results and lower bounds, expressing inherent limitations of distributed systems, • Some new algorithms, and • General mathematical foundations for modeling and analyzing distributed systems. These various results have spanned many different kinds of systems, ranging from distributed data- management systems, to communication systems, to biological systems such as insect colonies and brains. In this talk, I will overview some highlights of our work over many years on theory for distributed systems. I will break this down in terms of three intertwined “research threads”: algorithms for traditional distributed systems, impossibility results, and mathematical foundations. At the end, I will say something about ourrecent work on algorithms for new kinds of distributed systems. BIO Nancy Lynch is the NEC Professor of Software Science and Engineering in MIT’s EECS department. She heads the Theory of Distributed Systems research group in the Computer Science and AI Laboratory. She received her PhD from MIT and her BS from Brooklyn College, both in Mathematics Lynch has (co-)written many research articles about distributed algorithms and impossibility results, and about formal modeling and verification of distributed systems.
    [Show full text]
  • Chapter on Distributed Computing
    Chapter on Distributed Computing Leslie Lamport and Nancy Lynch February 3, 1989 Contents 1 What is Distributed Computing? 1 2 Models of Distributed Systems 2 2.1 Message-PassingModels . 2 2.1.1 Taxonomy......................... 2 2.1.2 MeasuringComplexity . 6 2.2 OtherModels........................... 8 2.2.1 SharedVariables . .. .. .. .. .. 8 2.2.2 Synchronous Communication . 9 2.3 FundamentalConcepts. 10 3 Reasoning About Distributed Algorithms 12 3.1 ASystemasaSetofBehaviors . 13 3.2 SafetyandLiveness. 14 3.3 DescribingaSystem . .. .. .. .. .. .. 14 3.4 AssertionalReasoning . 17 3.4.1 Simple Safety Properties . 17 3.4.2 Liveness Properties . 20 3.5 DerivingAlgorithms . 25 3.6 Specification............................ 26 4 Some Typical Distributed Algorithms 27 4.1 Shared Variable Algorithms . 28 4.1.1 MutualExclusion. 28 4.1.2 Other Contention Problems . 31 4.1.3 Cooperation Problems . 32 4.1.4 Concurrent Readers and Writers . 33 4.2 DistributedConsensus . 34 4.2.1 The Two-Generals Problem . 35 4.2.2 Agreement on a Value . 35 4.2.3 OtherConsensusProblems . 38 4.2.4 The Distributed Commit Problem . 41 4.3 Network Algorithms . 41 4.3.1 Static Algorithms . 42 4.3.2 Dynamic Algorithms . 44 4.3.3 Changing Networks . 47 4.3.4 LinkProtocols ...................... 48 i 4.4 Concurrency Control in Databases . 49 4.4.1 Techniques ........................ 50 4.4.2 DistributionIssues . 51 4.4.3 Nested Transactions . 52 ii Abstract Rigorous analysis starts with a precise model of a distributed system; the most popular models, differing in how they represent interprocess commu- nication, are message passing, shared variables, and synchronous communi- cation. The properties satisfied by an algorithm must be precisely stated and carefully proved; the most successful approach is based on assertional reasoning.
    [Show full text]
  • Easy Impossibility Proofs for Distributed Consensus Problems
    Distributed Computing (1986) 1:26 39 Easy impossibility proofs for distributed consensus problems Michael J. Fischer 1, Nancy A. Lynch 2, and Michael Merritt 3 Department of Computer Science, Yale University, P.O. Box 2158, New Haven, CT 06520, USA 2 Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, M A 02139, USA s AT & T Bell Laboratories, 600 Mountain Ave, Murray Hill, NJ 07974, USA and Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, M A 02139, US A Michael J. Fischer is cur- 1972. She has served on the .klculty of Tufts University, the rently Professor of Computer University of Southern California, Florida International Science at Yale University, University, Georgia Tech. New Haven, CT, where he heads the Theory of Compu- Michael Merritt is currently tation Group. He is also Edi- a member of the technical tor_in_Chief of the Journal of stq[] with AT& T Bell the Association .for Comput- Laboratories. During the 1984 ing Machinery. His research 85 academic year, he was interests include theory of a visiting lecturer at M.I.7:, distributed systems, crypto- sponsered by Bell Labs. His graphic protocols, and compu- research interests include dis- tational complexity. tributed computation, cryptog- Dr. Fischer received the raphy and security. Dr. Merritt B. S. degree in mathematics received the B. S. degree in j?om the University of Mi- computer science and philo- chigan, Ann Arbor, in 1963, sophy from Yale in 1978 and and the M. A. and Ph.D. degrees in applied mathematics the M. Sc.
    [Show full text]
  • Download The
    2018 Year in Review CONNECTOR News from the MIT Department of Electrical Engineering and Computer Science Year in Review: 2018 Connector The MIT Stephen A. Schwarzman College of Rising Stars, an academic-careers workshop Computing — established with a gift from the for women, brought 76 of the world’s top EECS co-founder, CEO, and chairman of Blackstone postdocs and grad students to MIT to hear — is scheduled to open in the fall of 2019. faculty talks, network with each other, and Photo: Courtesy of Blackstone. present their research. Photo: Gretchen Ertl CONTENTS 1 A Letter from the Department Head FACULTY FOCUS FEATURES 47 Faculty Awards 4 MIT Reshapes Itself to Shape the Future: EECS Leadership Update Asu Ozdaglar Introducing the MIT Stephen A. Schwarzman College of Computing 53 Asu Ozdaglar, Department Head Department Head 8 Artificial Intelligence in Action: Introducing the 54 Associate Department Heads MIT-IBM Watson AI Lab 55 Education and Undergraduate Officers Saman Amarasinghe 10 EECS Professor Antonio Torralba Appointed to 56 Faculty Research Innovation Fellowships (FRIFs) Associate Department Head Direct MIT Quest for Intelligence 57 Professorships 12 Summit Explores Pioneering Approaches for AI Nancy Lynch and Digital Technology for Health Care 62 Faculty Promotions Associate Department Head, 14 SuperUROP: Coding, Thinking, Sharing, 64 Tenured Faculty Building Strategic Directions 66 New Faculty 16 SuperUROP: CS+HASS Scholarship Program Debuts with Nine Projects 69 Remembering Professor Alan McWhorter, 1930-2018 Joel Voldman
    [Show full text]
  • Cynthia Dwork
    Cynthia Dwork Gordon McKay Professor of Computer Science, Harvard University Radcliffe Alumnae Professor, Radcliffe Institute for Advanced Study Professor by Affiliation, Harvard Law School Professor by Affiliation, Department of Statistics, Harvard University Distinguished Scientist, Microsoft Research Education: 1983: Ph.D. in Computer Science, Cornell University 1981: M.Sc. in Computer Science, Cornell University 1979: BSE (with Honors), in Electrical Engineering and Computer Science, Princeton Uni- versity Employment January, 2017 { present: Gordon McKay Professor of Computer Science at the Harvard Paulson School of Engineering and Radcliffe Alumnae Professor at the Radcliffe Institute for Advanced Study October, 2001 { present: Microsoft Research, Silicon Valley Campus; Current Title: Distin- guished Scientist June, 2000 { October, 2001: Compaq Systems Research Center; Staff Fellow August, 1985 { June, 2000: IBM Almaden Research Center, Research Staff Member May, 1983 - May, 1985 Post-Doctoral Research Fellow, MIT Laboratory for Computer Science Host: Nancy Lynch Other Professional Affiliations Consulting Professor, Stanford University, 1997 { 2006 1989-1990: Visiting Scientist, MIT Laboratory for Computer Science Bantrell Post-Doctoral Fellowship (at MIT), 1983-1985 Honors and Awards: Donald E. Knuth Prize, 2020 Doctorate Honoris Causa, Ecole´ Polytechnique F´ed´eralede Lausanne (EPFL), 2020 Institute of Electrical and Electronics Engineers (IEEE) Richard W. Hamming Medal, 2020 G¨odelPrize, 2017 1 Fellow of the American Philosophical Society, elected 2016 Fellow of the Association for Computing Machinery, elected 2016 Member of the National Academy of Sciences, elected 2014 Fellow of the American Academy of Arts and Sciences, elected 2008 Member of the National Academy of Engineering, elected 2008 Fellow of the Association for Computing Machinery, elevated 2015 Theory of Cryptography Conference Test of Time Award, 2016 PET Award for Outstanding Research in Privacy Enhancing Technologies, 2009 Edsger W.
    [Show full text]
  • CURRICULUM VITAE and LIST of PUBLICATIONS December 2019 Personal Details: Name: Shlomi (Shlomo) Dolev
    CURRICULUM VITAE AND LIST OF PUBLICATIONS December 2019 Personal Details: Name: Shlomi (Shlomo) Dolev. Date and place of birth: 5/12/58, Israel. Regular military service: 13/2/77 to 12/8/80 (Cap- tain). Address and telephone number at work: Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel, Tel: 08-6472718, Fax: 08-6477650, Email: [email protected]. Parent of: Noa, Yorai, Hagar and Eden. Short Biography: Shlomi Dolev received his B.Sc. in Engineering and B.A. in Computer Science in 1984 and 1985, and his M.Sc. and D.Sc. in computer Science in 1990 and 1992 from the Technion Israel Institute of Technology. From 1992 to 1995 he was at Texas A&M University as a visiting research specialist. In 1995 he joined the Department of Mathematics and Computer Science at Ben-Gurion University. Shlomi is the founder and the first department head of the Computer Science Department at Ben-Gurion University, established in 2000. After just 15 years, the department has been ranked among the first 150 best departments in the world. He is the author of a book entitled Self-Stabilization published by MIT Press in 2000. His publications, more than three hundred conferences, journals and patents, include papers in JACM, SIAM journal on computing, Nature Photonics, Nature Communications, Physical Review, Journal of the Optical Society of America A, Distributed Computing, IEEE/ACM Trans. on Networking, ACM Trans. on Information and System Security, Journal of Cryptology, Journal of Computer and System Sciences, ACM Trans. on Knowledge Discovery from Data, ACM Trans.
    [Show full text]
  • Athena Lecturer” for Advances in Distributed Systems That Enable Dependable Internet and Wireless Network Applications
    acm The Association for Computing Machinery Advancing Computing as a Science & Profession Contact: Virginia Gold 212-626-0505 [email protected] ACM COUNCIL ON WOMEN HONORS LEADER IN RELIABILITY OF COMPUTER SYSTEMS MIT’s Lynch Named “Athena Lecturer” for Advances in Distributed Systems that Enable Dependable Internet and Wireless Network Applications NEW YORK, April 18, 2012 – The Association for Computing Machinery’s Council on Women in Computing (ACM-W) http://women.acm.org today named Nancy Lynch of the Massachusetts Institute of Technology as the 2012-2013 Athena Lecturer. She developed mathematical approaches to understanding the capabilities of distributed systems, which rely on multiple processors for computation and coordination. These systems include traditional wired networks, modern mobile communications, cloud computing systems, parallel computers, and embedded computers in factory machinery. Her contributions include modeling and proof techniques, algorithms, and impossibility results that are now in the toolbox of computer scientists who design distributed systems. The Athena Lecturer award celebrates women researchers who have made fundamental contributions to computer science. It includes a $10,000 honorarium provided by Google Inc. http://women.acm.org/participate/awards/athena_announcement.cfm “Lynch’s work has influenced both theoreticians and practitioners,” said Mary Jane Irwin, who heads the ACM-W Athena Lecturer award committee. “Her ability to formulate many of the core problems of the field in clear and precise ways has provided a foundation that allows computer system designers to find ways to work around the limitations she verified, and to solve problems with high probability.” In a career spanning more than 30 years, Lynch identified the boundaries between what is possible and provably impossible to solve in distributed settings.
    [Show full text]
  • Daniel Cason the Role of Synchrony on the Performance of Paxos O Papel Da Sincronia No Desempenho De Paxos
    Universidade Estadual de Campinas Instituto de Computação INSTITUTO DE COMPUTAÇÃO Daniel Cason The role of synchrony on the performance of Paxos O papel da sincronia no desempenho de Paxos CAMPINAS 2017 Daniel Cason The role of synchrony on the performance of Paxos O papel da sincronia no desempenho de Paxos Tese apresentada ao Instituto de Computação da Universidade Estadual de Campinas como parte dos requisitos para a obtenção do título de Doutor em Ciência da Computação. Dissertation presented to the Institute of Computing of the University of Campinas in partial fulfillment of the requirements for the degree of Doctor in Computer Science. Supervisor/Orientador: Prof. Dr. Luiz Eduardo Buzato Este exemplar corresponde à versão final da Tese defendida por Daniel Cason e orientada pelo Prof. Dr. Luiz Eduardo Buzato. CAMPINAS 2017 Agência(s) de fomento e nº(s) de processo(s): FAPESP, 2011/23705-4 ORCID: http://orcid.org/0000-0003-1598-106X Ficha catalográfica Universidade Estadual de Campinas Biblioteca do Instituto de Matemática, Estatística e Computação Científica Ana Regina Machado - CRB 8/5467 Cason, Daniel, 1987- C27r CasThe role of synchrony on the performance of Paxos / Daniel Cason. – Campinas, SP : [s.n.], 2017. CasOrientador: Luiz Eduardo Buzato. CasTese (doutorado) – Universidade Estadual de Campinas, Instituto de Computação. Cas1. Sistemas distribuídos. 2. Tolerância a falha (Computação). 3. Consenso distribuído (Computação). 4. Algoritmos de ordenação total. 5. Sincronização. I. Buzato, Luiz Eduardo,1961-. II. Universidade Estadual
    [Show full text]
  • Leaderless Byzantine Paxos
    Leaderless Byzantine Paxos Leslie Lamport Microsoft Research Appeared in Distributed Computing: 25th International Symposium: DISC 2011, David Peleg, editor. Springer-Verlag (2011) 141{142 Minor correction: 27 December 2011 Leaderless Byzantine Paxos Leslie Lamport Microsoft Research Abstract. The role of leader in an asynchronous Byzantine agreement algorithm is played by a virtual leader that is implemented using a syn- chronous Byzantine agreement algorithm. Agreement in a completely asynchronous distributed system is impossible in the presence of even a single fault [5]. Practical fault-tolerant \asynchronous" agreement algorithms assume some synchrony assumption to make progress, maintaining consistency even if that assumption is violated. Dependence on syn- chrony may be explicit [4], or may be built into reliance on a failure detector [2] or a leader-election algorithm. Algorithms that are based on leader election are called Paxos algorithms [6{8]. Byzantine Paxos algorithms are extensions of these algorithms to tolerate malicious failures [1, 9]. For Byzantine agreement, reliance on a leader is problematic. Existing algo- rithms have quite convincing proofs that a malicious leader cannot cause incon- sistency. However, arguments that a malicious leader cannot prevent progress are not so satisfactory. Castro and Liskov [1] describe a method by which the system can detect lack of progress and choose a new leader. However, their method is rather ad hoc. It is not clear how well it will work in practice, where it can be very difficult to distinguish malicious behavior from transient communication errors. The first Byzantine agreement algorithms, developed for process control ap- plications, did not require a leader [10].
    [Show full text]
  • The Theory of Timed I/O Automata Second Edition
    The Theory of Timed I/O Automata Second Edition Synthesis Lectures on Distributed Computing Theory Editor Nancy Lynch, Massachusetts Institute of Technology Synthesis Lectures on Distributed Computing Theory is edited by Nancy Lynch of the Massachusetts Institute of Technology. The series will publish 50- to 150 page publications on topics pertaining to distributed computing theory. The scope will largely follow the purview of premier information and computer science conferences, such as ACM PODC, DISC, SPAA, OPODIS, CONCUR, DialM-POMC, ICDCS, SODA, Sirocco, SSS, and related conferences. Potential topics include, but not are limited to: distributed algorithms and lower bounds, algorithm design methods, formal modeling and verification of distributed algorithms, and concurrent data structures. The Theory of Timed I/O Automata - Second Edition Dilsun K. Kaynar, Nancy Lynch, Roberto Segala, and Frits Vaandrager 2010 Principles of Transactional Memory Rachid Guerraoui and Michal Kapalka 2010 Fault-tolerant Agreement in Synchronous Message-passing Systems Michel Raynal 2010 Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems Michel Raynal 2010 The Mobile Agent Rendezvous Problem in the Ring Evangelos Kranakis, Danny Krizanc, and Euripides Markou 2010 Copyright © 2011 by Morgan & Claypool All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means—electronic, mechanical, photocopy, recording, or any other except for brief
    [Show full text]
  • International Federation for Information Processing
    International Federation for Information Processing Annual Report 2018 / 2019 www.ifip.org @ifipnews International Federation for Information Processing, 2020 2. INTRODUCTION ............................................................................................................ 4 3. PRESIDENT’S REPORT ................................................................................................... 5 4. HONORARY SECRETARY'S REPORT ................................................................................ 7 5. HONORARY TREASURER'S REPORT ................................................................................ 8 6. IFIP HISTORIAN'S REPORT ........................................................................................... 12 7. INTERNATIONAL PROFESSIONAL PRACTICE PROGRAMME (IP3) ................................... 15 8. STANDING COMMITTEE REPORTS ............................................................................... 22 8.1 Admissions Committee ...................................................................................................... 22 8.2 Publications Committee .................................................................................................... 23 8.3 Digital Equity Committee .................................................................................................. 30 8.4 Finance Committee ........................................................................................................... 36 8.5 Membership and Marketing Committee ..........................................................................
    [Show full text]