GitHub / harshitv95 / cs542-Design-Patterns-Distributed-Systems--Tree-of-Student-Records
A distributed in-memory cache based on tree data-store that relies on a robust replication algorithm that uses the Publish-Subscribe model. It relies on the Observer Pattern, Prototype Pattern, Factory Pattern, and the Singleton Pattern, to demonstrate how Distributed Systems could work internally, to maintain data consistency. This application uses a simple Binary Search Tree to store Students sorted by their IDs, and creates a variable number of Trees, which are replicas of each other, and sets up the Observer pattern among the same nodes of all the trees, thus, if any node is updated, that node will notify all the other nodes in other trees with the update, and the observers would finally make the same changes to their own instance.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/harshitv95%2Fcs542-Design-Patterns-Distributed-Systems--Tree-of-Student-Records
PURL: pkg:github/harshitv95/cs542-Design-Patterns-Distributed-Systems--Tree-of-Student-Records
Stars: 0
Forks: 0
Open issues: 0
License: None
Language: Java
Size: 37.1 KB
Dependencies parsed at: Pending
Created at: almost 5 years ago
Updated at: about 4 years ago
Pushed at: almost 5 years ago
Last synced at: over 2 years ago
Topics: in-memory-caching, replicated-cache