Monthly Archives: February 2010

Queues and algebra

Suppose we have a state machine Q, that implements a common first in first out queue. The input alphabet of Q consists of “Deq” and “Enq x” where “x” ranges over a set of values, say, V. Let’s fix the … Continue reading

Posted in architecture, software engineering, theoretical computer science | Tagged , , , | Leave a comment

simple lemma about pipelines

The connection between group structure and pipeline design seems like it merits a lot more attention than it gets. It’s not too hard to show that in a pipeline like the one to the right, the induced monoid of M1 … Continue reading

Posted in software engineering, theoretical computer science | Tagged , | Leave a comment

The Amory Lovins bottleneck

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 … Continue reading

Posted in data center, green power, software engineering | Tagged | Leave a comment