MemCacheD-Parallel and Distributed Data Management-Lecture Slides, Slides of Distributed Database Management Systems

Prof. Jitesh Bhaskar delivered this lecture for Distributed and Parallel Data Management course at Dhirubhai Ambani Institute of Information and Communication Technology. Its main point are: MemCacheD, Distributed, Memory, Caching, System, Zookeeper, Throughput, Servers, Kestrel, Scalability

Typology: Slides

2011/2012

Uploaded on 07/16/2012

sambandam
sambandam 🇮🇳

4.3

(37)

154 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
3
ZooKeeper Notes
Differences with file system:
all nodes can store data
storage size limited
API: insert node, read node, read children, delete
node, ...
Can set triggers on nodes
Clients and servers must know all servers
ZooKeeper works as long as a majority of servers are
available
Writes totally ordered; read ordered w.r.t. writes
CS 347 Lecture 1 13 CS 347 Lecture 1 14
CS 347:
Parallel and Distributed
Data Management
Notes X: Kestrel
Hector Garcia-Molina
Kestrel
Kestrel server handles a set of reliable,
ordered message queues
A server does not communicate with other
servers (advertised as good for scalability!)
CS 347 Lecture 1 15
client
client
server
server
queues
queues
Kestrel
Kestrel server handles a set of reliable,
ordered message queues
A server does not communicate with other
servers (advertised as good for scalability!)
CS 347 Lecture 1 16
client
client
server
server
queues
queues
get q
put q
log
log
docsity.com

Partial preview of the text

Download MemCacheD-Parallel and Distributed Data Management-Lecture Slides and more Slides Distributed Database Management Systems in PDF only on Docsity!

ZooKeeper Notes

  • Differences with file system:– all nodes can store data
  • API: insert node, read node, read children, delete– storage size limited
  • node, ...Can set triggers on nodes
  • • Clients and servers must know all serversZooKeeper works as long as a majority of servers are
  • availableWrites totally ordered; read ordered w.r.t. writes CS 347 Lecture 1 13 CS 347 Lecture 1 14

CS 347:

Parallel and Distributed

Data Management

Notes X: Kestrel

Hector Garcia-Molina

Kestrel

• Kestrel server handles a set of reliable,ordered message queues

• A server does not communicate with otherservers (advertised as good for scalability!)

CS 347 Lecture 1 15

client client

server server

queues queues

Kestrel

• Kestrel server handles a set of reliable,ordered message queues

• A server does not communicate with otherservers (advertised as good for scalability!)

CS 347 Lecture 1 16

client client

server server

queues get q queues

put q log

log

docsity.com