<--- Back to Details
First PageDocument Content
Fault-tolerant computer systems / Computing / Distributed algorithms / Computer programming / Inter-process communication / Paxos / Consensus / Software engineering / Haskell features / Algorithm / Futures and promises
Date: 2014-06-12 03:57:46
Fault-tolerant computer systems
Computing
Distributed algorithms
Computer programming
Inter-process communication
Paxos
Consensus
Software engineering
Haskell features
Algorithm
Futures and promises

CS240H: Implementing Paxos in Haskell Jiayuan Ma JuneAbstract

Add to Reading List

Source URL: www.scs.stanford.edu

Download Document from Source Website

File Size: 154,25 KB

Share Document on Facebook

Similar Documents

Mike Izbicki About Me My research makes machine learning algorithms faster. I’ve developed improved data structures for nearest neighbor queries and faster distributed learning procedures. I use techniques from high di

Mike Izbicki About Me My research makes machine learning algorithms faster. I’ve developed improved data structures for nearest neighbor queries and faster distributed learning procedures. I use techniques from high di

DocID: 1xTYW - View Document

Distributed Hole Detection Algorithms for Wireless Sensor Networks Pradipta Ghosh Bhaskar Krishnamachari Ming Hsieh Department of Electrical Engineering University of Southern California {pradiptg, bkrishna}@usc.edu

Distributed Hole Detection Algorithms for Wireless Sensor Networks Pradipta Ghosh Bhaskar Krishnamachari Ming Hsieh Department of Electrical Engineering University of Southern California {pradiptg, bkrishna}@usc.edu

DocID: 1vdB7 - View Document

Deterministic distributed algorithms: using covering graphs for good and evil Jukka Suomela Helsinki Institute for Information Technology HIIT University of Helsinki, Finland Braunschweig,

Deterministic distributed algorithms: using covering graphs for good and evil Jukka Suomela Helsinki Institute for Information Technology HIIT University of Helsinki, Finland Braunschweig,

DocID: 1vbIR - View Document

Distributed Best Response Algorithms for Potential Games Stéphane Durand, Federica Garin, Bruno Gaujal To cite this version: Stéphane Durand, Federica Garin, Bruno Gaujal. Distributed Best Response Algorithms for Poten

Distributed Best Response Algorithms for Potential Games Stéphane Durand, Federica Garin, Bruno Gaujal To cite this version: Stéphane Durand, Federica Garin, Bruno Gaujal. Distributed Best Response Algorithms for Poten

DocID: 1uX5s - View Document

Distributed Join Algorithms on Thousands of Cores Claude Barthels, Ingo Muller ¨ ‡ , Timo Schneider, Gustavo Alonso, Torsten Hoefler Systems Group, Dept. of Computer Science, ETH Zurich ¨ {firstname.lastname}@inf.eth

Distributed Join Algorithms on Thousands of Cores Claude Barthels, Ingo Muller ¨ ‡ , Timo Schneider, Gustavo Alonso, Torsten Hoefler Systems Group, Dept. of Computer Science, ETH Zurich ¨ {firstname.lastname}@inf.eth

DocID: 1uMei - View Document