Distributed systems Module 2 -Distributed algorithms Teaching unit 1 – basic techniques Ernesto Damiani University of Bozen Lesson 1 – Introduction.

Slides:



Advertisements
Similar presentations
Virtual Time Virtual Time and Global States of Distributed Systems Friedmann Mattern, 1989 The Model: An asynchronous distributed system = a set of processes.
Advertisements

Chapter 13 Leader Election. Breaking the symmetry in system Similar to distributed mutual exclusion problems, the first process to enter the CS can be.
Leader Election Breaking the symmetry in a system.
Parallel Processing & Parallel Algorithm May 8, 2003 B4 Yuuki Horita.
Virtual Time “Virtual Time and Global States of Distributed Systems” Friedmann Mattern, 1989 The Model: An asynchronous distributed system = a set of processes.
Lecture 8: Asynchronous Network Algorithms
Failure Detection The ping-ack failure detector in a synchronous system satisfies – A: completeness – B: accuracy – C: neither – D: both.
Leader Election Let G = (V,E) define the network topology. Each process i has a variable L(i) that defines the leader.  i,j  V  i,j are non-faulty.
The Role of Communication Complexity in Distributed Computing Rotem Oshman.
Distributed Systems Spring 2009
1 Distributed Computing Algorithms CSCI Distributed Computing: everything not centralized many processors.
Distributed systems Module 2 -Distributed algorithms Teaching unit 1 – Basic techniques Ernesto Damiani University of Bozen Lesson 3 – Distributed Systems.
1 Friday, September 29, 2006 If all you have is a hammer, then everything looks like a nail. -Anonymous.
Systems of Distributed Systems Module 2 -Distributed algorithms Teaching unit 3 – Advanced algorithms Ernesto Damiani University of Bozen Lesson 6 – Two.
Distributed systems Module 1 -Basic networking Teaching unit 1 – LAN standards Ernesto Damiani University of Bozen-Bolzano Lesson 5 – Collision management.
Software engineering Module 1 -Introduction to software process Teaching unit 1 - Requirements engineering Ernesto Damiani Free University of Bozen-Bolzano.
Responder Anonymity and Anonymous Peer-to-Peer File Sharing. by Vincent Scarlata, Brian Levine and Clay Shields Presentation by Saravanan.
CS603 Process Synchronization February 11, Synchronization: Basics Problem: Shared Resources –Generally data –But could be others Approaches: –Model.
Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings.
Synchronization in Distributed Systems. Mutual Exclusion To read or update shared data, a process should enter a critical region to ensure mutual exclusion.
Distributed systems Module 2 -Distributed algorithms Teaching unit 1 – Basic techniques Ernesto Damiani University of Bozen Lesson 4 – Consensus and reliable.
Distributed systems Module 2 -Distributed algorithms Teaching unit 1 – Basic techniques Ernesto Damiani University of Bozen Lesson 2 – Distributed Systems.
Distributed systems Module 1 -Basic networking Teaching unit 1 – LAN standards Ernesto Damiani University of Bozen-Bolzano Lesson 4 – Ethernet frame.
Ordering and Consistent Cuts Presented by Chi H. Ho.
Distributed Systems CS Programming Models- Part I Lecture 13, Oct 13, 2014 Mohammad Hammoud 1.
Systems of Distributed systems Module 2 - Distributed algorithms Teaching unit 2 – Properties of distributed algorithms Ernesto Damiani University of Bozen.
Software engineering Module 1 -Introduction to software process Teaching unit 1 - Requirements engineering Ernesto Damiani Free University of Bozen-Bolzano.
Distributed Systems Module 1 -Basic networking Teaching unit 1 – LAN standards Ernesto Damiani University of Bozen-Bolzano Lesson 3 – Introduction to Ethernet.
Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Vector timestamps Global state –Distributed Snapshot Election algorithms.
Election Algorithms and Distributed Processing Section 6.5.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Distributed Systems (15-440) Mohammad Hammoud December 4 th, 2013.
Issues in Concurrent Systems. Online Survey The Spring term course/instructor opinion survey will be available during the period Monday, April 17th through.
Lecture 6: Introduction to Distributed Computing.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
DISTRIBUTED ALGORITHMS Luc Onana Seif Haridi. DISTRIBUTED SYSTEMS Collection of autonomous computers, processes, or processors (nodes) interconnected.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved Chapter 6 Synchronization.
Dionicio D. Gante, Genevev G. Reyes & Vanylive T. Galima DDistributed Operating Systems.
Lecture #12 Distributed Algorithms (I) CS492 Special Topics in Computer Science: Distributed Algorithms and Systems.
Centralized mutual exclusion Problem : What if the coordinator fails? Solution : Elect a new one.
Lecture 5: Sun: 1/5/ Distributed Algorithms - Distributed Databases Lecturer/ Kawther Abas CS- 492 : Distributed system &
Computer Science Lecture 10, page 1 CS677: Distributed OS Last Class: Naming Name distribution: use hierarchies DNS X.500 and LDAP.
Review for Exam 2. Topics included Deadlock detection Resource and communication deadlock Graph algorithms: Routing, spanning tree, MST, leader election.
CSE 486/586, Spring 2013 CSE 486/586 Distributed Systems Wrap-up Steve Ko Computer Sciences and Engineering University at Buffalo.
Definitions Speed-up Efficiency Cost Diameter Dilation Deadlock Embedding Scalability Big Oh notation Latency Hiding Termination problem Bernstein’s conditions.
Synchronization CSCI 4780/6780. Mutual Exclusion Concurrency and collaboration are fundamental to distributed systems Simultaneous access to resources.
ADITH KRISHNA SRINIVASAN
CSE 486/586, Spring 2012 CSE 486/586 Distributed Systems Wrap-up Steve Ko Computer Sciences and Engineering University at Buffalo.
1 Leader Election in Rings. 2 A Ring Network Sense of direction left right.
Lecture #14 Distributed Algorithms (II) CS492 Special Topics in Computer Science: Distributed Algorithms and Systems.
Data Structures and Algorithms in Parallel Computing Lecture 1.
1 Rutgers UniversityCS 416: Operating Systems Final exam details December 22, pm-3pm. Venue: SEC 118. Tips: Spend time reading the questions before.
Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks
Page 1 Mutual Exclusion & Election Algorithms Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content.
NSF/TCPP Curriculum Planning Workshop Joseph JaJa Institute for Advanced Computer Studies Department of Electrical and Computer Engineering University.
Fault tolerance and related issues in distributed computing Shmuel Zaks GSSI - Feb
Computer Science Lecture 28, page 1 CS677: Distributed OS Today: Final Thoughts.
ICC Module 3 Lesson 1 – Computer Architecture 1 / 11 © 2015 Ph. Janson Information, Computing & Communication Module 3 : Systems.
CIS 825 Review session. P1: Assume that processes are arranged in a ring topology. Consider the following modification of the Lamport’s mutual exclusion.
ITEC452 Distributed Computing Lecture 2 – Part 3 Models in Distributed Systems Hwajung Lee.
Outline Distributed Mutual Exclusion Distributed Deadlock Detection
Lecture 7: Introduction to Distributed Computing.
CS60002: Distributed Systems
Distributed Computing:
Introduction to Self-Stabilization
GCSE Computer Science.
Prof. Leonardo Mostarda University of Camerino
The Shortest Path Algorithm
Distributed Systems (15-440)
Leader Election Bernard Chen.
Presentation transcript:

Distributed systems Module 2 -Distributed algorithms Teaching unit 1 – basic techniques Ernesto Damiani University of Bozen Lesson 1 – Introduction

Distributed Algorithms What is a distributed algorithm? Is it practical? Examples: Napster, Gnutella, etc.

Model basics (1) Anonymous

Model basics (2) With IDs

Model basics (3) Overlay network (mono or bi-directional)

Model basics (4) Ring

Model basics (5) Shared memory

Synchronous vs asynchronous communication model t t+d d: clock period t t+??

Algorithms overview Leader election Shortest path Consensus Secure sum Building blocks –Atomic memory, mutual exclusion, logical clocks FINE