Link Details

This is the last in a series of posts on evolving a single producer/consumer queue from 10M TPS to this final result of 400M TPS using a selection of techniques to improve mechanical sympathy and reduce contention. This last instalment introduces a twist on the original Lamport algorithm and using sparse data in the queue buffer.

Posted by nitsanw  |   Oct 14 2013 / 09:45

Add your comment

Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Recommended Links

Written by: Ryan Knight
Featured Refcardz: Top Refcardz:
  1. Apache Hadoop
  2. Play
  3. Akka
  4. Debugging JavaScript
  5. Design Patterns
  1. Apache Hadoop
  2. REST
  3. Java
  4. Git
  5. Java Performance
Connect with DZone