<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Programmer&#8217;s Toolbox Part 3: Consistent Hashing</title>
	<atom:link href="http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/</link>
	<description></description>
	<lastBuildDate>Wed, 27 Jul 2011 18:56:02 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1</generator>
	<item>
		<title>By: Consistent Hashing &#187; ~magog/public</title>
		<link>http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/comment-page-1/#comment-27252</link>
		<dc:creator>Consistent Hashing &#187; ~magog/public</dc:creator>
		<pubDate>Sun, 14 Nov 2010 00:48:08 +0000</pubDate>
		<guid isPermaLink="false">http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/#comment-27252</guid>
		<description>[...] Nice read and something I didn&#8217;t hear of before: http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/ [...]</description>
		<content:encoded><![CDATA[<p>[...] Nice read and something I didn&#8217;t hear of before: <a href="http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/" rel="nofollow">http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/</a> [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Optimiser la répartition de charge avec le &#8220;Consistent Hashing&#8221;</title>
		<link>http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/comment-page-1/#comment-24385</link>
		<dc:creator>Optimiser la répartition de charge avec le &#8220;Consistent Hashing&#8221;</dc:creator>
		<pubDate>Sun, 03 Oct 2010 20:35:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/#comment-24385</guid>
		<description>[...] http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/ [...]</description>
		<content:encoded><![CDATA[<p>[...] <a href="http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/" rel="nofollow">http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/</a> [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Onkar</title>
		<link>http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/comment-page-1/#comment-21200</link>
		<dc:creator>Onkar</dc:creator>
		<pubDate>Thu, 22 Jul 2010 11:59:38 +0000</pubDate>
		<guid isPermaLink="false">http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/#comment-21200</guid>
		<description>Very informative article. Nicely written. Cool stuff.

Thanks.</description>
		<content:encoded><![CDATA[<p>Very informative article. Nicely written. Cool stuff.</p>
<p>Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Siddhartah</title>
		<link>http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/comment-page-1/#comment-21024</link>
		<dc:creator>Siddhartah</dc:creator>
		<pubDate>Wed, 14 Jul 2010 16:38:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/#comment-21024</guid>
		<description>Good Article Tom,
For newbies, if you include active-standby also in this article, then removal use-case will make more sense. I mean when one server has to be removed, what will happen to the data it contained. So either (a) the standby server is assigned the same IP ( say using Virtual IP ) or (b) a new server which was having the original data of the failed node will be added to the hashing and failed node IP will be removed.

Many thanks Tom</description>
		<content:encoded><![CDATA[<p>Good Article Tom,<br />
For newbies, if you include active-standby also in this article, then removal use-case will make more sense. I mean when one server has to be removed, what will happen to the data it contained. So either (a) the standby server is assigned the same IP ( say using Virtual IP ) or (b) a new server which was having the original data of the failed node will be added to the hashing and failed node IP will be removed.</p>
<p>Many thanks Tom</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tom</title>
		<link>http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/comment-page-1/#comment-19834</link>
		<dc:creator>Tom</dc:creator>
		<pubDate>Mon, 07 Jun 2010 23:49:01 +0000</pubDate>
		<guid isPermaLink="false">http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/#comment-19834</guid>
		<description>@Ross -- each server should be hashed into many points on the circle.  That way probability takes care of spreading them out equally.</description>
		<content:encoded><![CDATA[<p>@Ross &#8212; each server should be hashed into many points on the circle.  That way probability takes care of spreading them out equally.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ross</title>
		<link>http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/comment-page-1/#comment-17927</link>
		<dc:creator>Ross</dc:creator>
		<pubDate>Fri, 26 Mar 2010 11:44:28 +0000</pubDate>
		<guid isPermaLink="false">http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/#comment-17927</guid>
		<description>Hej Tom,

I got half excited about your article... hits most of the squares... However your circle shows the servers nicely equadistant on the 360 but if we leave their placement to the hash function then they could actually all appear in a very accute part of the circle so that the services or resources could mostly be directed unneavenly to one server....  

Would it not be best to divide the available resources equally in the pie? (and one could take into account weighting on this also)

If in the case that one server fails, then instead of applying roundrobin, would it not be best to select the best server... i.e. the server with the most currently available processing capability (obtained from server size and current load).

Your comments would be well appreciated.

Slainte //Ross</description>
		<content:encoded><![CDATA[<p>Hej Tom,</p>
<p>I got half excited about your article&#8230; hits most of the squares&#8230; However your circle shows the servers nicely equadistant on the 360 but if we leave their placement to the hash function then they could actually all appear in a very accute part of the circle so that the services or resources could mostly be directed unneavenly to one server&#8230;.  </p>
<p>Would it not be best to divide the available resources equally in the pie? (and one could take into account weighting on this also)</p>
<p>If in the case that one server fails, then instead of applying roundrobin, would it not be best to select the best server&#8230; i.e. the server with the most currently available processing capability (obtained from server size and current load).</p>
<p>Your comments would be well appreciated.</p>
<p>Slainte //Ross</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: diego sevilla&#8217;s weblog &#187; Más de bases de datos NoSQL: Consistent Hashing</title>
		<link>http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/comment-page-1/#comment-17255</link>
		<dc:creator>diego sevilla&#8217;s weblog &#187; Más de bases de datos NoSQL: Consistent Hashing</dc:creator>
		<pubDate>Mon, 01 Mar 2010 12:57:08 +0000</pubDate>
		<guid isPermaLink="false">http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/#comment-17255</guid>
		<description>[...] interna de Amazon, que mueve desde los carros de la compra hasta las bases de datos como S3: Consistent Hashing. Me ha parecido interesante y lo guardo aquí para referencia futura.    Related posts in t8i [...]</description>
		<content:encoded><![CDATA[<p>[...] interna de Amazon, que mueve desde los carros de la compra hasta las bases de datos como S3: Consistent Hashing. Me ha parecido interesante y lo guardo aquí para referencia futura.    Related posts in t8i [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Episode 2: A brief introduction to NoSQL databases &#8211; Hacker Medley</title>
		<link>http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/comment-page-1/#comment-15885</link>
		<dc:creator>Episode 2: A brief introduction to NoSQL databases &#8211; Hacker Medley</dc:creator>
		<pubDate>Thu, 21 Jan 2010 01:29:48 +0000</pubDate>
		<guid isPermaLink="false">http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/#comment-15885</guid>
		<description>[...] Consistent Hashing. [...]</description>
		<content:encoded><![CDATA[<p>[...] Consistent Hashing. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: OCTO talks ! &#187; Consistent Hashing ou l’art de distribuer les données</title>
		<link>http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/comment-page-1/#comment-13294</link>
		<dc:creator>OCTO talks ! &#187; Consistent Hashing ou l’art de distribuer les données</dc:creator>
		<pubDate>Fri, 06 Nov 2009 18:09:04 +0000</pubDate>
		<guid isPermaLink="false">http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/#comment-13294</guid>
		<description>[...] Ces articles expliquent à merveille l’algorithme de Consistent Hashing. En substance, il s’appuie sue les deux principes suivants : [...]</description>
		<content:encoded><![CDATA[<p>[...] Ces articles expliquent à merveille l’algorithme de Consistent Hashing. En substance, il s’appuie sue les deux principes suivants : [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sean Neakums (sneakums) 's status on Sunday, 18-Oct-09 09:25:42 UTC - Identi.ca</title>
		<link>http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/comment-page-1/#comment-12760</link>
		<dc:creator>Sean Neakums (sneakums) 's status on Sunday, 18-Oct-09 09:25:42 UTC - Identi.ca</dc:creator>
		<pubDate>Sun, 18 Oct 2009 09:25:46 +0000</pubDate>
		<guid isPermaLink="false">http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/#comment-12760</guid>
		<description>[...]  http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/  [...]</description>
		<content:encoded><![CDATA[<p>[...]  <a href="http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/" rel="nofollow">http://www.spiteful.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/</a>  [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

