<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Split-Brain on Brave New Geek</title><link>https://bravenewgeek.com/tag/split-brain/</link><description>Recent content in Split-Brain on Brave New Geek</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Wed, 24 Sep 2014 21:35:07 -0600</lastBuildDate><atom:link href="https://bravenewgeek.com/tag/split-brain/index.xml" rel="self" type="application/rss+xml"/><item><title>Understanding Consensus</title><link>https://bravenewgeek.com/understanding-consensus/</link><pubDate>Wed, 24 Sep 2014 21:35:07 -0600</pubDate><guid>https://bravenewgeek.com/understanding-consensus/</guid><description>&lt;p&gt;A classical problem presented within the field of distributed systems is the &lt;a href="http://en.wikipedia.org/wiki/Two_Generals'_Problem"&gt;Byzantine Generals Problem&lt;/a&gt;. In it, we observe two allied armies positioned on either side of a valley. Within the valley is a fortified city. Each army has a general with one acting as commander. Both armies &lt;em&gt;must&lt;/em&gt; attack at the same time or face defeat by the city’s defenders. In order to come to an agreement on when to attack, messengers must be sent through the valley, risking capture by the city’s patrols. Consider the diagram below illustrating this problem.&lt;/p&gt;</description></item></channel></rss>