Here’s some code for lock free queues for a single producer and single consumer. The code is designed for Intel multiprocessors with strong memory model. I don’t know what ARM offers these days. But the strong memory model for x86
The Auragen file system.
This article on the interesting Wave Transactional File System inspired me to look up an earlier file system that also used copy on write semantics. From: Anita Borg, Wolfgang Blau, Wolfgang Graetsch, Ferdinand Herrmann, and Wolfgang Oberle. 1989. Fault tolerance
Paxos and other consensus algorithms and the unaccountable love for asynchrony
I’ve been looking at Paxos and Raft and Zab and other algorithms that can loosely be called “consensus” algorithms because we want to see where we can improve distributed system operation with precision time synchronization or where we can offer novel features
Keynes apology
The composition of this book has been for the author a long struggle of escape, and so must the reading of it be for most readers if the author’s assault upon them is to be successful,—a struggle of escape from
Process algebra is based on a misunderstanding of automata theory
Robin Milner’s book Communication and Concurrency involves a take on state machines that is fundamentally incorrect. “Now in standard automata theory, an automaton is interpreted as a language i.e. as a set of strings over the alphabet.“ That’s not at
More on Fischer, Lynch, Patterson and the parrot theorem.
I’m thinking about distributed consensus algorithms, timestamping, and databases and if you read that literature you will see many references to the Fischer, Lynch, Paterson “theorem”. Google Scholar tells me the paper has been cited more than 4500 times. The theorem
ESMA clarifies time sources for MiFID II
ESMA just released guidelines that reinforce what was already clear in the MiFIDII regulation – that GPS time is a perfectly acceptable source of “traceable” time. There is a lot else that is of interest in this report, but it’s
Practical State Machines for Computer Software and Engineering
Download paper. [gview file=”http://www.yodaiken.com/wp-content/uploads/2016/01/practical.pdf”]
Theories of abstract automata – Arbib
We have said that automata theory deals with the realization of partial functions F: X* —» Y* by some finitely specifiable substrate. Before we specify in more detail the forms (of which the Turing machine is one) of substrate which
MiFID II, GPS and UTC time
I have a post up on FSMLabs web site about the use of GPS and other satellite time for MiFID II timestamp compliance. It’s fascinating how much effort has recently gone into trying to convince people that MiFID II will