CS60002: Distributed Systems

Slides:

Advertisements

Similar presentations

Distributed Algorithms – 2g1513 Lecture 1b – by Ali Ghodsi Models of distributed systems continued and logical time in distributed systems.

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.

Breadth-First Search Seminar – Networking Algorithms CS and EE Dept. Lulea University of Technology 27 Jan Mohammad Reza Akhavan.

Randomized Algorithms Randomized Algorithms CS648 Lecture 20 Probabilistic Method (part 1) Lecture 20 Probabilistic Method (part 1) 1.

CS774. Markov Random Field : Theory and Application Lecture 06 Kyomin Jung KAIST Sep

1 Distributed Computing Algorithms CSCI Distributed Computing: everything not centralized many processors.

Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:

1 Internet Networking Spring 2006 Tutorial 6 Network Cost of Minimum Spanning Tree.

Chapter 5 Trees PROPERTIES OF TREES 3 4.

CS2420: Lecture 40 Vladimir Kulyukin Computer Science Department Utah State University.

1 Internet Networking Spring 2004 Tutorial 6 Network Cost of Minimum Spanning Tree.

1 Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem Kuo-Hsien Chuang 2008/11/05.

Design and Analysis of Algorithms Minimum Spanning trees

Broadcast & Convergecast Downcast & Upcast

Lecture #12 Distributed Algorithms (I) CS492 Special Topics in Computer Science: Distributed Algorithms and Systems.

Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.

Spectral graph theory Network & Matrix Computations CS NMC David F. Gleich.

Teacher: Chun-Yuan Lin

Programming Practicum Day 3: Problem Solving with Graphs Aaron Tan NUS School of Computing.

Lecture #14 Distributed Algorithms (II) CS492 Special Topics in Computer Science: Distributed Algorithms and Systems.

Distributed Spanning Tree Center for Information Security Department of Computer Science University of Tulsa, Tulsa, OK

Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Hamiltonian Cycles Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering,

More Trees Discrete Structures (CS 173)

CSC2100B Tutorial 10 Graph Jianye Hao.

CSCI2100 Data Structures Tutorial 12

1 Review Questions Define n variables, types of shared variables, message-passing, shared-memory system, system topology n program-counter/guarded command.

Dijkstra-Scholten and Shavit-Francez termination algorithms

Prims Algorithm for finding a minimum spanning tree

Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Trees Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT

Fan Qi Database Lab 1, com1 #01-08 CS3223 Tutorial 6.

CS Introduction to AI Tutorial 8 Unification Tutorial 8 Unification.

Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Matchings and Factors Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering,

2016/6/23Election Algorithms1 Introduction to Distributed Algorithm Part Two: Fundamental Algorithm Chapter 7- Election Algorithms Teacher: Chun-Yuan Lin.

Spanning Trees Alyce Brady CS 510: Computer Algorithms.

Computer Network Topology

Minimum Spanning Tree Chapter 13.6.

Deadlock-free Packet Switching

Tutorial - Propositional Logic

Presented By Indian Dresses

CS60002: Distributed Systems

Roadmap to Programming work, right, fast KISS

By Indian Dresses

Wave and Traversal Algorithms

CS60002: Distributed Systems

CS200: Algorithm Analysis

Minimum Spanning Tree Neil Tang 3/25/2010

Connected Components Minimum Spanning Tree

CS60002: Distributed Systems

Leader Election CS60002: Distributed Systems

Distributed Deadlock Detection

Shortest-Paths Trees Kun-Mao Chao (趙坤茂)

4-4 Graph Theory Trees.

Kruskal’s Algorithm for finding a minimum spanning tree

Dijkstra’s Shortest Path Algorithm Neil Tang 03/25/2008

Non-Distributed Excercises

Algorithms Lecture # 30 Dr. Sohail Aslam.

Minimum Spanning Tree Neil Tang 4/3/2008

CSCI2100 Data Structures Tutorial

CSC4005 – Distributed and Parallel Computing

Ալգորիթմներ Stack, Queue, Tree.

Dijkstra’s Shortest Path Algorithm Neil Tang 3/2/2010

Minimum Spanning Trees (MSTs)

Clustering The process of grouping samples so that the samples are similar within each group.

Prim’s Minimum Spanning Tree Algorithm Neil Tang 4/1/2008

Warm Up – Monday Calculate the Redundancy of the above network.

Software Engineering and Architecture

Tutorial - 1 Course: CS60045 Pallab Dasgupta Professor,

INDIAN DRESSES.

Presentation transcript:

CS60002: Distributed Systems A Tutorial CS60002: Distributed Systems INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR

1. Compute the spanning tree on the following graph using a wave algorithm with A as the initiator. INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR

2. Adapt the Echo Algorithm to compute the sum over the inputs from the processes. INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR

3. What would be the difference between Chang-Roberts algorithm and the Extinction Algorithm when applied to rings? What effect does this difference have? INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR