Managing distributed file system with consistent distributed store & leader based algorithm

May 2015

11 Mon

12 Tue

13 Wed

14 Thu

15 Fri 08:15 AM – 05:30 PM IST

16 Sat 08:15 AM – 05:15 PM IST

17 Sun

MLR Convention Centre, J P Nagar

All submissions

Previous Next

This submission has been added to the schedule

Managing distributed file system with consistent distributed store & leader based algorithm

Submitted Mar 30, 2015

Section: Full talk Technical level: Intermediate

The objective of this presentation is to bring awareness to the people about how to achieve consistency, availablity and fault tolerance in distributed system in an efficient way.

Outline

In a typical distributed system managing n number of nodes in an effective way is always a challenge. Distributed systems always demands to meet CAP theorem which is really hard to meet with a good performance numbers. All the nodes participating in the cluster should have the consistent data which is one of the criteria of the CAP theorem. This could be achieved by keeping the configuration details across all the nodes in the cluster, however this algorithm doesn’t scale (considering n X n number of exchange of information) and can end up having split brain situations. This could be avoided having distributed consistent store across m number of nodes (considered) as leaders where m < n. There are few technologies like consul/etcd by which this can be achieved.

Speaker bio

Atin is a Glusterfs hacker and currently working as a Senior S/W Engineer in Redhat India. Apart from storage he has also worked on different other domains which include telecom, BFS.