hi 馃憢, my name is Akshat Sharma, I'm currently a CS grad student working in the File Systems and Storage Lab (FSL) at Stony Brook University.
I'm currently researching secure archival storage systems and their applications. I'm interested in learning about databases, operation systems, distributed systems and have worked in distributed systems at Stony Systems Lab before working in FSL.
Here, I post things that I find interesting/notes that I want to share with the world.
Notes Dynamo is similar to a Distributed Hash Table meaning it uses consistent hashing. Dynamo is called a zero-hop DHT because each node has enough information about the whole consistent hashing ring...
Notes Consistency is a spectrum with weak to strong levels. GFS/Eventual consistency is an example of weak consistency. Linearizability is an example of strong consistency. Consistency can be defined ...
Readings - Practical Byzantine Fault Tolerance.pdf Byzantine PAXOS.pdf Notes What can be potential byzantine failures? Wrong replies which cannot be detected Halt consensus(same as crash so not really...
Notes Background Already existing scheme used db query for replication Replication scheme was in such a way that any follower could query any other follower Due to this when they tried to implement RA...
Notes Runs in 2 phases - Phase 1 - get a promise from majority of servers Phase 2 - get a majority of servers to commit Two important rules Two numbers should be used to track the system Highest seen ...