Distributed systems II Closing

Slides:



Advertisements
Similar presentations
DISTRIBUTED SYSTEMS II FAULT-TOLERANT AGREEMENT Prof Philippas Tsigas Distributed Computing and Systems Research Group.
Advertisements

Parallel Programming Motivation and terminology – from ACM/IEEE 2013 curricula.
Introduction to Computer Programming in C
Distribuerade System fk TDA297(CTH), INN290 (GU) VT 2009 LP3 – 5p (7.5 hp)
UMass Lowell Computer Science Foundations of Computer Science Prof. Karen Daniels Fall, 2009 Lecture 1 Introduction/Overview Th. 9/3/2009.
Idit Keidar, Principles of Reliable Distributed Systems, Technion EE, Spring Principles of Reliable Distributed Systems Lecture 5: Synchronous Uniform.
Computer Organization TI1400 Alexandru Iosup (lecturer) Henk Sips (original slides) Parallel and Distributed Systems
Concordia University Department of Computer Science and Software Engineering Click to edit Master title style ADVANCED PROGRAMING PRACTICES Introduction.
Lecture #12 Distributed Algorithms (I) CS492 Special Topics in Computer Science: Distributed Algorithms and Systems.
Lecture 0 Anish Arora CSE 6333 Introduction to Distributed Computing.
Distributed Computation in MANets Robot swarm developed by James Rice University.
Distributed Systems II TDA297(CTH), DIT290 (GU) LP hec
Distributed Systems II TDA297(CTH), DIT290 (GU) LP hec
Probabilistic & Statistical Techniques Eng. Tamer Eshtawi First Semester 2008 Eng. Tamer Eshtawi First Semester 2008.
CompSci 6 Introduction to Computer Science October 20, 2011 Prof. Rodger.
Distributed Systems II TDA297(CTH), INN290 (GU) LP hec
CPSC 121: Models of Computation Unit 0 Introduction George Tsiknis Based on slides by Patrice Belleville and Steve Wolfman.
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data Akhil Kumar IEEE TRANSACTION ON COMPUTERS, VOL.40, NO.9, SEPTEMBER 1991.
4-Jun-16COMP28112 Lecture 181 It’s been three months since the first lecture… We went a long way… We covered a number of topics… Let’s see some… COMP28112.
DISTRIBUTED SYSTEMS II A POLYNOMIAL LOCAL SOLUTION TO MUTUAL EXCLUSION Prof Philippas Tsigas Distributed Computing and Systems Research Group.
DISTRIBUTED SYSTEMS II CLOSING Prof Philippas Tsigas Distributed Computing and Systems Research Group.
By Purva Gawde For Advanced Operating Systems Instructor: Mikhail Nesterenko.
© Chinese University, CSE Dept. Distributed Systems / ECLT5820: Distributed and Mobile Systems Dr. Michael R. Lyu Computer Science & Engineering.
CIS 313: Analysis and Design of Algorithms Assoc. Prof Hassan Aly Department of Computer Science and Information College of Science at AzZulfi Al-Majmaah.
MS. NANCY HARRIS LECTURER, DEPARTMENT OF COMPUTER SCIENCE CS 149 – Programming Fundamentals (Accelerated)
Distributed systems II Closing
CPE741: Distributed Systems Course Introduction
CS101 Computer Programming I
Algorithm for Virtually Synchronous Group Communication
Lecture 1 Introduction/Overview Text: Chapters 1, 2 Wed. 1/28/04
Midterm Review.
Assignment: Accounting 201 Review Cornelian Window Washing
Lecture 32 CSE 331 Nov 16, 2016.
CPE741: Distributed Systems Course Introduction
Computer Architecture Syllabus
CPE741: Distributed Systems Course Introduction
CPSC 121: Models of Computation
Transactional Programming EE 4984/5984
Introduction to Statistics for the Social Sciences SBS200 - Lecture Section 001, Spring 2017 Room 150 Harvill Building 9:00 - 9:50 Mondays, Wednesdays.
COMS W1004 Introduction to Computer Science and Programming in Java
Computer Science 210 Computer Organization
FINAL EXAM INFORMATION
ENGR 3300 – 505 Advanced Engineering Mathematics
Distributed systems II A polynomial local solution to Mutual Exclusion
Chapter 1: Introduction
Ho-Ramammorthy 2 phase snapshot algorithm PRESENTATION
ECEN “Internet Protocols and Modeling”
COMP28112 Distributed Computing
OBJECT ORIENTED PROGRAMMING II GEORGE KOUTSOGIANNAKIS
CSE1311 Introductory Programming for Engineers & Scientists
Algorithms Key Revision Points.
COMP28112 Distributed Computing
COMP28112 Distributed Computing
Course calendar (page 1 of 2)
Lecture 32 CSE 331 Nov 15, 2017.
COMP28112 Distributed Computing
COMP28112 Distributed Computing
Algorithm Design and Analysis
C Programming Lecture 1 : Introduction
AGENDA -Bellwork -Reading Time
АВЛИГАТАЙ ТЭМЦЭХ ҮНДЭСНИЙ ХӨТӨЛБӨР /танилцуулга/
COMS W1004 Introduction to Computer Science
ENGR 3300 – 505 Advanced Engineering Mathematics
CS114B Introduction to Computer Science II
Advanced Engineering Mathematics
ENGR 3300 – 505 Advanced Engineering Mathematics
COMP28112 Distributed Computing
ECLT5820: Distributed and Mobile Systems
Computer Science 210 Computer Organization
Presentation transcript:

Distributed systems II Closing Prof Philippas Tsigas Distributed Computing and Systems Research Group Distributed systems II Closing

What do I need to study? Chapters: 12 Coordination and Agreement Read all material from the Chapters 15, 16, 17 and 18th (edition 5) and the following extra material for Chapter 15: http://pingpong.chalmers.se/public/pp/public_courses/course02284/published/1362560491083/resourceId/1176044/content/ByzAgr-Proof.pdf http://pingpong.chalmers.se/public/pp/public_courses/course02284/published/1362560491083/resourceId/1176044/content/p67-akkoyunlu.pdf From the 4th edition the numbering is different: 12 Coordination and Agreement 13 Transactions and Concurrency Control 14 Distributed Transactions 15 Replication 2

What do I need to study? (cnt.) Chapter 3 and 5 of the Master's Thesis, except from 5.4. While reading this thesis it is good to check also the following papers: Dijkstra, E. W. (1971, June). Hierarchical ordering of sequential processes. Acta Informatica 1(2): 115-138. Chandy, K.M.; Misra, J. (1984). The Drinking Philosophers Problem. ACM Transactions on Programming Languages and Systems. Nancy A. Lynch. Upper bounds for static resource allocation in a distributed system Journal for Computer and System Sciences, 23:254-278, 1981 Manhoi Choy and Ambuj K. Singh. Efficient fault-tolerant algorithms for distributed resource allocation. ACM Transactions on Programming Languages and Systems, 17(3):535-559, May 1995. 3

How to answer the exam questions? Write Pseudocode together with the informal description. Write formal statements, when giving proofs, complexity analysis. 4

Lectures The slides used at the first lecture are now availiable: Introduction.pdf Wednesday's (2013-01-23) slides: Fault-Tolerant Broadcast.ppt Monday's (2013-01-28) slides: ByzAgreem.ppt and extra reading material ByzAgr-Proof.pdf Wednesday's (2013-01-30) slides: Agreem_2-3phase.ppt Monday's (2013-02-04) slides: Replication-Lecture1a.pptx Monday's (2013-02-11) slides: Replication-Lecture2.pptx Wednesday's (2013-02-13) slides: Replication-Lecture3.pptx Monday's (2013-02-18) slides: da1.pdf Wednesday's (2013-02-20) slides: ResourceAllocation1.pdf Wednesday's (2013-02-27) slides: ResourceAllocation2.pdf and ChoySingh.pptx Wednesday's (2013-03-06) slides: TBA 5

Wednesday's (2013-01-30) slides: Introduction to lab 1 Assignments Wednesday's (2013-01-30) slides: Introduction to lab 1 Monday's (2013-02-11) slides: Introduction to lab 2 Wednesday's (2013-02-25) slides: presentation_lab3_2013.ppt (presentation_lab3_2013.pdf) and sensornetworkrouting_2013.ppt (sensornetworkrouting_2013.pdf) Monday's (2013-03-04) slides: Comments.pdf 6