<?xml version="1.0" encoding="UTF-8"?><!-- generator="WordPress/2.9.2" -->
<rss version="0.92">
<channel>
	<title>keeping simple</title>
	<link>http://www.yodaiken.com</link>
	<description>Systems software technology and business</description>
	<lastBuildDate>Fri, 05 Mar 2010 14:45:01 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	
	<item>
		<title>Shape of the internet</title>
		<description><![CDATA[“When we started releasing data publicly, we measured it in petabytes of traffic,” said Doug Webster, a Cisco Systems market executive who is responsible for an annual report by the firm that charts changes in the Internet. “Then a couple of years ago we had to start measuring them in zettabytes, and now we’re measuring [...]]]></description>
		<link>http://www.yodaiken.com/2010/03/shape-of-the-internet/</link>
			</item>
	<item>
		<title>Power savings via software</title>
		<description><![CDATA[This press release is particularly fluffy, but whatever the reality of this very vaguely defined algorithmic development the basic message is correct
to validate nine terabytes of data (nine million million or a number with 12 zeros) in less than 20 minutes, without compromising accuracy.  Ordinarily, using the same system, this would take more than a [...]]]></description>
		<link>http://www.yodaiken.com/2010/03/power-savings-via-software/</link>
			</item>
	<item>
		<title>Queues and algebra</title>
		<description><![CDATA[Suppose we have a state machine Q, that implements a common first in first out queue. The input alphabet of Q consists of &#8220;Deq&#8221; and &#8220;Enq x&#8221; where &#8220;x&#8221; ranges over a set of values, say, V. Let&#8217;s fix the max length of Q at some constant k. As usual, given a sequence of events [...]]]></description>
		<link>http://www.yodaiken.com/2010/02/queues-and-algebra/</link>
			</item>
	<item>
		<title>simple lemma about pipelines</title>
		<description><![CDATA[
The connection between group structure and pipeline design seems like it merits a lot more attention than it gets. It&#8217;s not too hard to show that in a pipeline like the one to the right, the induced monoid of M1 must be a homomorphic image of the composite state machine. This immediately brings in the [...]]]></description>
		<link>http://www.yodaiken.com/2010/02/simple-lemma-about-pipelines/</link>
			</item>
	<item>
		<title>The Amory Lovins bottleneck</title>
		<description><![CDATA[Lovins observes that power inputs in many industrial processes go into a bottleneck that makes power conservation hard if you start at the wrong end.  The power goes into a long pipeline of process that emerges on the other end with some useful (in theory) work. If you start on the power input end, then [...]]]></description>
		<link>http://www.yodaiken.com/2010/02/the-amory-lovins-bottleneck/</link>
			</item>
	<item>
		<title>An interesting article in ACM communications: is the world ending?</title>
		<description><![CDATA[Coverity has a program that reads other programs looking for errors. The company started as a research project from Stanford (how unusual!)  and the  Communications article is really about what they found in commercial world. One thing they found was a lot of crappy programmers.
Upon seeing an error report saying the following loop body was [...]]]></description>
		<link>http://www.yodaiken.com/2010/02/an-interesting-article-in-acm-communications-is-the-world-ending/</link>
			</item>
	<item>
		<title>Toyota&#8217;s problem: hardware weenies and poor accounting practices [updated]</title>
		<description><![CDATA[Jamie Kitman&#8217;s look at the twisted path Toyota followed to it&#8217;s current difficulties inspired me to think about software and money &#8211; two topics I spend way too much time thinking about. As a purely disinterested observer (ahem) it has come to my attention, repeatedly, that manufacturing companies undervalue, underinvest in, and undertest software.  On [...]]]></description>
		<link>http://www.yodaiken.com/2010/02/toyotas-problem-hardware-weenies-and-poor-accounting-practices/</link>
			</item>
	<item>
		<title>Recursion and state update</title>
		<description><![CDATA[Please see this ever modifying page which seeks to demonstrate in a poorly organized, yet humorous manner, what the hell I&#8217;m trying to accomplish with this primitive recursive state machine stuff.
And as an added bonus &#8211; the great &#8220;Recursive Functions&#8221; book by Rozsa Peters contains the following remarkable note that has nothing to do with [...]]]></description>
		<link>http://www.yodaiken.com/2010/02/recursion-and-state-update/</link>
			</item>
	<item>
		<title>Instructions per joule &#8211; a good start</title>
		<description><![CDATA[&#8230; multi-GHz superscalar quad-core processors can execute approximately 100 million instructions per Joule, assuming all cores are active and avoid stalls or mispredictions. Lower-frequency in-order CPUs, in contrast, can provide over 1 billion instructions per Joule—an order of magnitude more efficient while still running at 1/3rd the frequency. Worse yet, running fast processors below their [...]]]></description>
		<link>http://www.yodaiken.com/2010/02/instructions-per-joule-a-good-start/</link>
			</item>
	<item>
		<title>sequential and combinational state machines</title>
		<description><![CDATA[There&#8217;s a correspondence between the notions of &#8220;combinational&#8221; and &#8220;sequential&#8221; in digital circuit engineering and some structure in state machines (and therefore monoids)  that seems interesting.
In digital logic, a &#8220;combinational&#8221; circuit like a logic gate has can be associated with a time T so that the output depends only on input signals applied over the [...]]]></description>
		<link>http://www.yodaiken.com/2010/02/sequential-and-combinational-state-machines/</link>
			</item>
</channel>
</rss>
