Tzu-Han Wu15524883 Yi-Chi Chiang54641046 Han-Yang Ou59283702.

Slides:



Advertisements
Similar presentations
COS 461 Fall 1997 Network Objects u first good implementation: DEC SRC Network Objects for Modula-3 u recent implementation: Java RMI (Remote Method Invocation)
Advertisements

CS3771 Today: deadlock detection and election algorithms  Previous class Event ordering in distributed systems Various approaches for Mutual Exclusion.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts Amherst Operating Systems CMPSCI 377 Lecture.
Copyright © 2001 Qusay H. Mahmoud RMI – Remote Method Invocation Introduction What is RMI? RMI System Architecture How does RMI work? Distributed Garbage.
Page 1 Mutual Exclusion* Distributed Systems *referred to slides by Prof. Paul Krzyzanowski at Rutgers University and Prof. Mary Ellen Weisskopf at University.
Distributed Systems Fall 2010 Replication Fall 20105DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
Enforcing Mutual Exclusion Message Passing. Peterson’s Algorithm for Processes P0 and P1 void P0() { while( true ) { flag[ 0 ] = false; /* remainder */
Distributed Algorithms Simulator By Har-Tal Oded Supervised by Dr Shlomi Dolev Project’s goal: Designing and implementing a simulator for distributed algorithms,
CS 582 / CMPE 481 Distributed Systems
Signature Based Concurrency Control Thomas Schwarz, S.J. JoAnne Holliday Santa Clara University Santa Clara, CA 95053
Distributed Systems Fall 2009 Replication Fall 20095DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
Chapter 18: Distributed Coordination (Chapter 18.1 – 18.5)
September 24, 2007The 3 rd CSAIL Student Workshop Byzantine Fault Tolerant Cooperative Caching Raluca Ada Popa, James Cowling, Barbara Liskov Summer UROP.
Exercises for Chapter 6: Operating System Support
A Gateway For SIP Event Interworking - Sasu Tarkoma & Thalainayar Balasubramanian Ramya.
DISTRIBUTED PROCESS IMPLEMENTAION BHAVIN KANSARA.
Distributed Process Implementation Hima Mandava. OUTLINE Logical Model Of Local And Remote Processes Application scenarios Remote Service Remote Execution.
Distributed Process Implementation
Dr. Kalpakis CMSC 621, Advanced Operating Systems. Fall 2003 URL: Distributed Mutual Exclusion.
Distributed Mutual Exclusion
DEMIGUISE STORAGE An Anonymous File Storage System VIJAY KUMAR RAVI PRAGATHI SEGIREDDY COMP 512.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Multicast routing.
Institute of Computer and Communication Network Engineering OFC/NFOEC, 6-10 March 2011, Los Angeles, CA Lessons Learned From Implementing a Path Computation.
DNA REASSEMBLY Using Javaspace Sung-Ho Maeung Laura Neureuter.
Orbited Scaling Bi-directional web applications A presentation by Michael Carter
Standard Algorithms –search for an item in an array –count items in an array –find the largest (or smallest) item in an array.
System Initialization 1)User starts application. 2)Client loads settings. 3)Client loads contact address book. 4)Client displays contact list. 5)Client.
Module 7: Resolving NetBIOS Names by Using Windows Internet Name Service (WINS)
Operating Systems Distributed Coordination. Topics –Event Ordering –Mutual Exclusion –Atomicity –Concurrency Control Topics –Event Ordering –Mutual Exclusion.
2/26/021 Pegasus Security Architecture Author: Nag Boranna Hewlett-Packard Company.
System integration of WAP and SMS for home network system Editor : Chi-Hsiang Wu, Rong-Hong Jan School : the National Chiao Tung University Source : Computer.
Shuman Guo CSc 8320 Advanced Operating Systems
Copyright © George Coulouris, Jean Dollimore, Tim Kindberg This material is made available for private study and for direct.
Quick Messaging Service John Sung. Objective Use Demeter/Java to the fullest –Use COOL for coordination –Use RIDL for RMI Ability to send messages “instantly”
1 Permission-based Distributed Mutual Exclusion : Ricart-Agrawala & Maekawa Algorithms By: Sherenaz W. Al-Haj Baddar.
A Design of User-Level Distributed Shared Memory Zhi Zhai Feng Shen Computer Science and Engineering University of Notre Dame Oct. 27, 2009 Progress Report.
UNECE-IRU eTIR Pilot Project Karachi, 18 August 2014 Adrian Albu, Senior Road Transport Expert.
D u k e S y s t e m s Asynchronous Replicated State Machines (Causal Multicast and All That) Jeff Chase Duke University.
DIS Project Proposal Distributed-PacMan. Overview of Project Motivation and goals Project Participants Project timeline.
Hwajung Lee. Mutual Exclusion CS p0 p1 p2 p3 Some applications are:  Resource sharing  Avoiding concurrent update on shared data  Controlling the.
Hwajung Lee. Mutual Exclusion CS p0 p1 p2 p3 Some applications are: 1. Resource sharing 2. Avoiding concurrent update on shared data 3. Controlling the.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
A Tree Based Algorithm fro Distributed Mutual Exclusion Addy Gronquist 11/19/2003.
Page 1 Mutual Exclusion & Election Algorithms Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content.
Activity 2 Keeping Yourself Secure. What Would You Do? Listen to each of the situations and watch the video that goes along with it. Think about what.
AFS/OSD Project R.Belloni, L.Giammarino, A.Maslennikov, G.Palumbo, H.Reuter, R.Toebbicke.
Tzu-Han Wu Yi-Chi Chiang Han-Yang Ou
COMP 655: Distributed/Operating Systems Summer 2011 Dr. Chunbo Chu Week 6: Synchronyzation 3/5/20161 Distributed Systems - COMP 655.
Mutual Exclusion Algorithms. Topics r Defining mutual exclusion r A centralized approach r A distributed approach r An approach assuming an organization.
Hwajung Lee. Mutual Exclusion CS p0 p1 p2 p3 Some applications are:  Resource sharing  Avoiding concurrent update on shared data  Controlling the.
DIS Final Project Proposal Content Express R 許坤進 R 余世傑 R 洪啓仁.
Network ManagerConnection Manager Connectivity and Messaging block Protocol Marshaller Factory.
The process of establishing a connection between a client and a server is called as Client – Server communication.
Distributed Server Scheduler Eyal Serero Alex Fishgate Supervisor : Vitaly Suchin.
© 2007 Open Grid Forum NSI CS Protocol State Machine Message Handling OGF 37.
GL TRADE Internal Use Only GL Stream Server Module Notification Sequence Diagram December 12th, 2007.
CS 425 / ECE 428 Distributed Systems Fall 2015 Indranil Gupta (Indy) Oct 1, 2015 Lecture 12: Mutual Exclusion All slides © IG.
WCDP: A protocol for web cache consistency Renu Tewari IBM Almaden Research Thirumale Niranjan IBM Software Group
Reactive Android Development
Distributed Computing
SEMINAR ON DDNS (DYNAMIC DOMAIN NAME SERVICE)
Extending Java RMI for Dynamic Reconfiguration
The Reliable Server Pooling Framework
Ivy Eva Wu.
Distributed P2P File System
Mutual Exclusion CS p0 CS p1 p2 CS CS p3.
ITEC452 Distributed Computing Lecture 7 Mutual Exclusion
Your computer is the client
Realizing a Peer-to-Peer System using a common API
Interoperability Test Message Patterns for IEC
Presentation transcript:

Tzu-Han Wu Yi-Chi Chiang Han-Yang Ou

 Motivation ◦ Avoid over-booking  Features ◦ Show seats status in real-time ◦ Multi-server processing in distributed environment ◦ Fully replication ◦ Load balancing ◦ Add servers dynamically  Implementation ◦ JAVA RMI ◦ Mutual exclusion: altered Ricart-Agrawala algorithm

Client 1 Client 3 Client 2 Server 1 Server 2

S1 S2 M S3 N Notify new server Send other servers info and status of seats Notify other servers new server coming At the same time, the other server may send seat status update messages The new server should compare the version and decide to update or ignore the messages

ID: 103 Connection Request Client address Ask appropriate server S1 S2 M S3 C101 C102 C202 C204 C205C306 C301 C003 C001 C005 N Reply address of S1 C103 Ask status of seats Reply status of seats

S1 S2 M S3 C101 C102 C202 C204 C205C306 C301 C003 C001 C005 The other server set flag 5 to trueThe other servers send OK to S2 Flag 5: True Assume seat 5 is available C204 send seat 5 request message to S2 Flag 5: false S2 set flag 5 to true S2 send seat request to other server Flag 5: true S2 sends update notification to other serversServers sends update notification to clients

S1 S2 M S3 C101 C102 C202 C204 C205C306 C301 C003 C001 C005 Assume seat 7 is occupied by C202 Flag 7: true C202 sends release message to S2S2 sets flag 7 to false Flag 7: false S2 sends update notification to other serversServers send update notifications to clients Flag 7: false Other servers set their flag 7 to false

S2 sends seat 2 update notifications messages to other servers S2 sends seat 3 update notifications messages to other servers Servers send seat 2 update notifications to clients S1 S2 M S3 C101 C102 C202 C204 C205C306 C301 C003 C001 C005 Assume C205 has requested seat 2 and 3 Flag 2: true Flag 3: true Flag 2: true Flag 3: true C205 sends commit message to S2Servers send seat 3 update notifications to clients