This document contains a summary of an assignment involving failure and high availability with Zookeeper. It lists the names and student numbers of 4 students in Section A who submitted the assignment. It also briefly describes registering an ephemeral sequential zNode with Zookeeper and an algorithm where if a process fails, the surviving zNode with the minimum processor ID will be elected to create a new process.
This document contains a summary of an assignment involving failure and high availability with Zookeeper. It lists the names and student numbers of 4 students in Section A who submitted the assignment. It also briefly describes registering an ephemeral sequential zNode with Zookeeper and an algorithm where if a process fails, the surviving zNode with the minimum processor ID will be elected to create a new process.
This document contains a summary of an assignment involving failure and high availability with Zookeeper. It lists the names and student numbers of 4 students in Section A who submitted the assignment. It also briefly describes registering an ephemeral sequential zNode with Zookeeper and an algorithm where if a process fails, the surviving zNode with the minimum processor ID will be elected to create a new process.