paxos算法java代码实现.pdf

ppaaxxooss算算法法jjaavvaa代代码码实实现现 paxos算法以其难以理解⽽著称，主要体现在两个⽅⾯： 、Lamport最初的论⽂以叙事的⽅式叙述了算法核⼼ 2、算法即使有⾮常严谨的推导过程也很难被确定为严格正确的 （但⽬前事实证明确实是有效的） ⽬前在⽹络上很多类似的推导过程，⾃⼰看着也很困惑，所以尝试使⽤代码实现了这个过程，记录如下： importjava.util.ArrayList; importjava.util.List; importjava.util.Random; /** * Phase 1 * (a) A proposer selects a proposal number n and sends a prepare re uest w ith number n to a majority of acceptors. * (b) If an acceptor receives a prepare re uest w ith number n greater than that of any prepare re uest to w hich it has already responded , then it responds to the re uest w ith * Phase 2 * (a) If the proposer receives a response to its prepare re uests (numbered n) from a majority of acceptors, then it sends an accept re uest to each of those acceptors for a pr * (b) If an acceptor receives an accept re uest for a proposal numbered n, it accepts the proposal unless it has already responded to a prepare re uest having a number gre */ public classPaxos { public static voidmain(String[] args) { ComputerManager computerManager =new Paxos().newComputerManager(); try{ computerManager.start(7); }catch(Exception e) { e.printStackTrace(); } } classComputerManager { privateListcomputers=newArrayList();//定义⼀个集合 privateIntegerstartSize ; /** *启动所有服务器 * *@throwsException */ public voidstart(Integer startSize)throwsException { if(computers !=nullcomputers.size() 0) throw new Exception(restart error); this.startSize= startSize ; Paxos paxos =new Paxos(); for(inti =0 ;i startSize ;i++) { Computer computer = paxos.newComputer(this); Thread thread =newThread(computer); thread .start(); } } /** *启动完成的服务器注册 * *@return */ public voidregister(Computer computer) { computers.add(computer); } /** *获取所有服务器 * *@return */ publicIntegergetHelfSize() { returncomput