Distributed Computing:

Slides:



Advertisements
Similar presentations
Communication-Avoiding Algorithms Jim Demmel EECS & Math Departments UC Berkeley.
Advertisements

Operating Systems Part III: Process Management (Process Synchronization)
Parallel Processing with OpenMP
Instructor Neelima Gupta Table of Contents Parallel Algorithms.
Master/Slave Architecture Pattern Source: Pattern-Oriented Software Architecture, Vol. 1, Buschmann, et al.
1 Contents Distributed data structures Different implementations First example: bank transactions JavaSpaces concepts Replicated-worker pattern Second.
Concurrency: Mutual Exclusion and Synchronization Why we need Mutual Exclusion? Classical examples: Bank Transactions:Read Account (A); Compute A = A +
Slide 1 Parallel Computation Models Lecture 3 Lecture 4.
1 Distributed Computing Algorithms CSCI Distributed Computing: everything not centralized many processors.
CS 584. A Parallel Programming Model We need abstractions to make it simple. The programming model needs to fit our parallel machine model. Abstractions.
Multiprocessors Andreas Klappenecker CPSC321 Computer Architecture.
Chapter 11: Distributed Processing Parallel programming Principles of parallel programming languages Concurrent execution –Programming constructs –Guarded.
Synchronization in Distributed Systems. Mutual Exclusion To read or update shared data, a process should enter a critical region to ensure mutual exclusion.
1 Recap. 2 No. of Processors C.P.I Computational Power Improvement Multiprocessor Uniprocessor.
Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Vector timestamps Global state –Distributed Snapshot Election algorithms.
© 2009 Matthew J. Sottile, Timothy G. Mattson, and Craig E Rasmussen 1 Concurrency in Programming Languages Matthew J. Sottile Timothy G. Mattson Craig.
4.5 DISTRIBUTED MUTUAL EXCLUSION MOSES RENTAPALLI.
Parallelization: Area Under a Curve. AUC: An important task in science Neuroscience – Endocrine levels in the body over time Economics – Discounting:
Centralized mutual exclusion Problem : What if the coordinator fails? Solution : Elect a new one.
Cluster Workstations. Recently the distinction between parallel and distributed computers has become blurred with the advent of the network of workstations.
Course Introduction Andy Wang COP 5611 Advanced Operating Systems.
CS 345: Chapter 10 Parallelism, Concurrency, and Alternative Models Or, Getting Lots of Stuff Done at Once.
Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Vector timestamps Global state –Distributed Snapshot Election algorithms –Bully algorithm.
ECE200 – Computer Organization Chapter 9 – Multiprocessors.
CSE 486/586, Spring 2013 CSE 486/586 Distributed Systems Wrap-up Steve Ko Computer Sciences and Engineering University at Buffalo.
CS4402 – Parallel Computing Lecture 1: Classification of Parallel Computers Classification of Parallel Computation Important Laws of Parallel Compuation.
Multiple Processor Systems. Multiprocessor Systems Continuous need for faster computers –shared memory model ( access nsec) –message passing multiprocessor.
Memory/Storage Architecture Lab Computer Architecture Multiprocessors.
CSE 486/586, Spring 2012 CSE 486/586 Distributed Systems Wrap-up Steve Ko Computer Sciences and Engineering University at Buffalo.
Chapter 7 -1 CHAPTER 7 PROCESS SYNCHRONIZATION CGS Operating System Concepts UCF, Spring 2004.
Virtual Private Grid (VPG) : A Command Shell for Utilizing Remote Machines Efficiently Kenji Kaneda, Kenjiro Taura, Akinori Yonezawa Department of Computer.
Data Management for Decision Support Session-4 Prof. Bharat Bhasker.
UNIT-I. 11/14/00CSE 3802 UNIT-I Distributed Systems ECS-701 Lecture Note NEERAJ KUMAR.
Distributed Spanning Tree Center for Information Security Department of Computer Science University of Tulsa, Tulsa, OK
Page 1 Mutual Exclusion & Election Algorithms Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content.
Scaling Conway’s Game of Life. Why do parallelism? Speedup – solve a problem faster. Accuracy – solve a problem better. Scaling – solve a bigger problem.
CIS 825 Review session. P1: Assume that processes are arranged in a ring topology. Consider the following modification of the Lamport’s mutual exclusion.
Distributed Mutual Exclusion Synchronization in Distributed Systems Synchronization in distributed systems are often more difficult compared to synchronization.
Computer Science and Engineering Parallel and Distributed Processing CSE 8380 April 28, 2005 Session 29.
Parallel Programming Models EECC 756 David D. McGann 18 May, 1999.
What types of problems we study, Part 1: Statistical problemsHighlights of the theoretical results What types of problems we study, Part 2: ClusteringFuture.
BAHIR DAR UNIVERSITY Institute of technology Faculty of Computing Department of information technology Msc program Distributed Database Article Review.
Coordination and Agreement
CSE 486/586 Distributed Systems Wrap-up
Introduction to Parallel Computing: MPI, OpenMP and Hybrid Programming
Accelerators to Applications
Distributed Shared Memory
Andy Wang COP 5611 Advanced Operating Systems
Interconnection topologies
Course Introduction Dr. Eggen COP 6611 Advanced Operating Systems
Andy Wang COP 5611 Advanced Operating Systems
CSE 486/586 Distributed Systems Wrap-up
IS310 Hardware & Network Infrastructure Ronny L
Multi-Processing in High Performance Computer Architecture:
Optimal Sorting Algorithms for Parallel Computers
Multi-Processing in High Performance Computer Architecture:
CS60002: Distributed Systems
Multiprocessor Synchronization Algorithms ( )
Introduction to locality sensitive approach to distributed systems
Background and Motivation
Andy Wang COP 5611 Advanced Operating Systems
Concurrency: Mutual Exclusion and Process Synchronization
Parallel Algorithm Models
Andy Wang COP 5611 Advanced Operating Systems
Distributed Information Processing
Type Topic in here! Created by Educational Technology Network
Andy Wang COP 5611 Advanced Operating Systems
Hwajung Lee ITEC452 Distributed Computing Lecture 1 Introduction to Distributed Systems.
Distributed Systems and Algorithms
Presentation transcript:

Distributed Computing: - not everything centralized - many processors

Distributed Systems: Internet The machines of our department ATM machines, bank accounts

What is then parallel computing? Many processors in the same machine All processors solve the same task A restricted form of distributed computing

Basic Distributed Systems: Message passing Shared Memory

Message Passing Systems Easy to implement in hardware

Shared Memory Systems Harder to implement in hardware Easy to program

Distributed Algorithms Several problems: Communication Problems Coordination Problems Specific problems

Example: The counting problem Shared variable Sequential Bottleneck!!!

A better solution: Counting network many shared variables

Example: Routing Problems

Example: Finding the spanning tree problem

Example: Leader election problem

Example: Mutual Exclusion Problem Critical Region One processor allowed

Example: Consensus Problem Time 0 Final Time 1 1 1 1 1 1 1 1 1

Topics: Message Passing Model Spanning Trees Independent Set Coloring Clustering Shared Memory Mutual Exclusion Byzantine Agreement Consensus Distributed Counting