P2P Architecture for Self-* Atomic Memory Emmanuelle Anceaume Maria Gradinariu Vincent Gramoli Antonino Virgillito.

Slides:

Advertisements

Similar presentations

Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.

Advertisements

Dynamo: Amazon’s Highly Available Key-value Store ID2210-VT13 Slides by Tallat M. Shafaat.

Scalable Content-Addressable Network Lintao Liu

Replication. Topics r Why Replication? r System Model r Consistency Models r One approach to consistency management and dealing with failures.

Distributed Shared Memory, Related Issues, and New Challenges in Large-Scale Dynamic Systems Vincent Gramoli 1.

Serverless Network File Systems. Network File Systems Allow sharing among independent file systems in a transparent manner Mounting a remote directory.

Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Schenker Presented by Greg Nims.

Study of Hurricane and Tornado Operating Systems By Shubhanan Bakre.

Search and Replication in Unstructured Peer-to-Peer Networks Pei Cao, Christine Lv., Edith Cohen, Kai Li and Scott Shenker ICS 2002.

A Dependable Auction System: Architecture and an Implementation Framework

Peer-to-Peer Networks as a Distribution and Publishing Model Jorn De Boever (june 14, 2007)

A Scalable Content Addressable Network (CAN)

Peer to Peer File Sharing Huseyin Ozgur TAN. What is Peer-to-Peer?  Every node is designed to(but may not by user choice) provide some service that helps.

Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker A Scalable, Content- Addressable Network (CAN) ACIRI U.C.Berkeley Tahoe Networks.

2/18/2004 Challenges in Building Internet Services February 18, 2004.

Dynamo Kay Ousterhout. Goals Small files Always writeable Low latency – Measured at 99.9 th percentile.

Chord and CFS Philip Skov Knudsen Niels Teglsbo Jensen Mads Lundemann

A Scalable Content-Addressable Network Authors: S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker University of California, Berkeley Presenter:

Distributed Lookup Systems

Distributed Systems Fall 2009 Replication Fall 20095DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.

Object Naming & Content based Object Search 2/3/2003.

Timed Quorum Systems … for large-scale and dynamic environments Vincent Gramoli, Michel Raynal.

November 22, 2007 Vincent Gramoli1/61 Distributed Shared Memory for Large-Scale Dynamic Systems Vincent Gramoli supervised by Michel Raynal.

SQUARE Scalable Quorum-based Atomic Memory with Local Reconfiguration Vincent Gramoli, Emmanuelle Anceaume, Antonino Virgillito.

What Can Databases Do for Peer-to-Peer Steven Gribble, Alon Halevy, Zachary Ives, Maya Rodrig, Dan Suciu Presented by: Ryan Huebsch CS294-4 P2P Systems.

Structured P2P Network Group14: Qiwei Zhang; Shi Yan; Dawei Ouyang; Boyu Sun.

Inexpensive Scalable Information Access Many Internet applications need to access data for millions of concurrent users Relational DBMS technology cannot.

1 A scalable Content- Addressable Network Sylvia Rathnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker Pirammanayagam Manickavasagam.

Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.

6.4 Data And File Replication Presenter : Jing He Instructor: Dr. Yanqing Zhang.

Module 12: Designing High Availability in Windows Server ® 2008.

DM Rasanjalee Himali CSc8320 – Advanced Operating Systems (SECTION 2.6) FALL 2009.

Presenter: Dipesh Gautam.  Introduction  Why Data Grid?  High Level View  Design Considerations  Data Grid Services  Topology  Grids and Cloud.

1 The Design of a Robust Peer-to-Peer System Gisik Kwon Dept. of Computer Science and Engineering Arizona State University Reference: SIGOPS European Workshop.

High Throughput Computing on P2P Networks Carlos Pérez Miguel

DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S

Peer-to-Peer Distributed Shared Memory? Gabriel Antoniu, Luc Bougé, Mathieu Jan IRISA / INRIA & ENS Cachan/Bretagne France Dagstuhl seminar, October 2003.

Replication March 16, Replication What is Replication?  A technique for increasing availability, fault tolerance and sometimes, performance 

Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.

A Scalable Content-Addressable Network (CAN) Seminar “Peer-to-peer Information Systems” Speaker Vladimir Eske Advisor Dr. Ralf Schenkel November 2003.

Fast Searching in Peer-to-Peer Networks Self-Organizing Parallel Search Clusters Rocky Dunlap.

A Peer-to-Peer Approach to Resource Discovery in Grid Environments (in HPDC’02, by U of Chicago) Gisik Kwon Nov. 18, 2002.

DISTRIBUTED COMPUTING Introduction Dr. Yingwu Zhu.

Distributed Computing Systems CSCI 4780/6780. Distributed System A distributed system is: A collection of independent computers that appears to its users.

Distributed Computing Systems CSCI 4780/6780. Geographical Scalability Challenges Synchronous communication –Waiting for a reply does not scale well!!

Distributed Systems CS Synchronization – Part III Lecture 10, Sep 30, 2013 Mohammad Hammoud.

Scalable Content- Addressable Networks Prepared by Kuhan Paramsothy March 5, 2007.

Replica Consistency in a Data Grid1 IX International Workshop on Advanced Computing and Analysis Techniques in Physics Research December 1-5, 2003 High.

Copyright © George Coulouris, Jean Dollimore, Tim Kindberg This material is made available for private study and for direct.

1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.

1 Distributed Hash Table CS780-3 Lecture Notes In courtesy of Heng Yin.

Research of P2P Architecture based on Cloud Computing Speaker : 吳靖緯 MA0G0101.

Replication (1). Topics r Why Replication? r System Model r Consistency Models r One approach to consistency management and dealing with failures.

Distributed Computing Systems CSCI 4780/6780. Scalability ConceptExample Centralized servicesA single server for all users Centralized dataA single on-line.

BATON A Balanced Tree Structure for Peer-to-Peer Networks H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu.

Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT By Jyothsna Natarajan Instructor: Prof. Yanqing Zhang Course: Advanced Operating Systems.

Peer-to-Peer Systems: An Overview Hongyu Li. Outline  Introduction  Characteristics of P2P  Algorithms  P2P Applications  Conclusion.

November, 19th GDS meeting, LIP6, Paris 1 Hierarchical Synchronization and Consistency in GDS Sébastien Monnet IRISA, Rennes.

P2P Search COP P2P Search Techniques Centralized P2P systems  e.g. Napster, Decentralized & unstructured P2P systems  e.g. Gnutella.

NCLAB 1 Supporting complex queries in a distributed manner without using DHT NodeWiz: Peer-to-Peer Resource Discovery for Grids Sujoy Basu, Sujata Banerjee,

Antidio Viguria Ann Krueger A Nonblocking Quorum Consensus Protocol for Replicated Data Divyakant Agrawal and Arthur J. Bernstein Paper Presentation: Dependable.

Large Scale Sharing Marco F. Duarte COMP 520: Distributed Systems September 19, 2004.

PERFORMANCE MANAGEMENT IMPROVING PERFORMANCE TECHNIQUES Network management system 1.

Distributed Systems – Paxos

Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT -Sumanth Kandagatla Instructor: Prof. Yanqing Zhang Advanced Operating Systems (CSC 8320)

EEC 688/788 Secure and Dependable Computing

EEC 688/788 Secure and Dependable Computing

Distributed File Systems

Replica Placement Model: We consider objects (and don’t worry whether they contain just data or code, or both) Distinguish different processes: A process.

EEC 688/788 Secure and Dependable Computing

Presentation transcript:

P2P Architecture for Self-* Atomic Memory Emmanuelle Anceaume Maria Gradinariu Vincent Gramoli Antonino Virgillito

ISPAN 05Vincent Gramoli Goal Architecture for Scalable Multi- Reader/Writer Distributed Shared Memory in P2P Systems

ISPAN 05Vincent Gramoli Roadmap Applications There is a solution for each problem Modular memory architecture Self-Healing mechanism Traversing mechanism Self-Adjusting mechanism Conclusion

ISPAN 05Vincent Gramoli Applications WebServices Groupware …w/o cost of maintenance of any centralized control

ISPAN 05Vincent Gramoli Peer-to-Peer (P2P) Dynamism Decentralized Unstructured Wide-Scale

ISPAN 05Vincent Gramoli Related Problems Data Availability Load

ISPAN 05Vincent Gramoli Related Problems Atomic Consistency Data Availability Load

ISPAN 05Vincent Gramoli Dedicated Solutions Atomic Consistency Data Availability Load Self-Healing

ISPAN 05Vincent Gramoli Dedicated Solutions Atomic Consistency Data Availability Load Self-HealingSelf-Adjusting

ISPAN 05Vincent Gramoli Dedicated Solutions Atomic Consistency Data Availability Load Dynamic Quorums* Self-HealingSelf-Adjusting * Quorums = Mutually intersecting sets

ISPAN 05Vincent Gramoli Modular Approach Dynamic Quorums Self-Healing Self-Adjusting Traversal Module Load Balancer Module Adjuster Module

ISPAN 05Vincent Gramoli Single Object Memory Atomicity is preserved under object composition. The memory is obtained by composition of all single object memories. Some nodes have a copy of the same object X: the object’s replicas. We refer to those replicas as the memory of object X.

ISPAN 05Vincent Gramoli Adjuster Module Architecture Traversal Module Load Balancer Module Operation Manager operationoperation-ack Client

ISPAN 05Vincent Gramoli Logical Overlay The object’s responsibility is a CAN torus-grid shared by replicas. Each replica is responsible for a part of a virtual domain space [0,1) x [0,1). If two zones are adjacent, their responsible are neighbors. Client operation operation-ack

ISPAN 05Vincent Gramoli Bootstrapping Process Initially, one replica possessed object X. This is the only responsible of X. Then X is replicated and responsibility is shared among replicas. Each replica is responsible for a part of a virtual domain space [0,1) x [0,1). If two zones are adjacent, their responsible are neighbors.

ISPAN 05Vincent Gramoli Self-Healing Overlay failed replica

ISPAN 05Vincent Gramoli Self-Healing Overlay Assuming eventual failure detection. A neighbor becomes responsible of the failed replica’s zone. The neighbor choice is made by CAN takeover mechanism.

ISPAN 05Vincent Gramoli Traversing Overlay Consultation quorum: set of replicas responsible of a whole line. Propagation quorum: set of replicas responsible of a whole column. Request receiver Every propagation quorum intersects every consultation quorum

ISPAN 05Vincent Gramoli Self-Adjusting Overlay overloaded replica

ISPAN 05Vincent Gramoli Self-Adjusting Overlay

ISPAN 05Vincent Gramoli Self-Adjusting Overlay

ISPAN 05Vincent Gramoli Self-Adjusting Overlay Active replication on a node outside the grid.

ISPAN 05Vincent Gramoli Self-Adjusting Overlay underloaded replica

ISPAN 05Vincent Gramoli Self-Adjusting Overlay Similar to the self- healing mechanism

ISPAN 05Vincent Gramoli Conclusion Our approach uses various concepts  P2P overlay  dynamic quorums  replica control Result  Multi-Reader/Writer DSM in P2P Systems  Only local information is necessary  Fault tolerance is guaranteed  Load is balanced  Operations are atomic Future work  Using mechanism theory for incentive strategy