Ashwin Jayaprakash AshwinJay

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns             
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs

	Originally:
	https://gist.github.com/7565976a89d5da1511ce

	Hi Donald (and Martin),

	Thanks for pinging me; it's nice to know Typesafe is keeping tabs on this, and I
	appreciate the tone. This is a Yegge-long response, but given that you and
	Martin are the two people best-situated to do anything about this, I'd rather
	err on the side of giving you too much to think about. I realize I'm being very
	critical of something in which you've invested a great deal (both financially

	public class ApplicationModule extends AbstractModule {
	private final EventBus eventBus = new EventBus("Default EventBus");

	@Override
	protected void configure() {
	bind(EventBus.class).toInstance(eventBus);
	bindListener(Matchers.any(), new TypeListener() {
	public <I> void hear(TypeLiteral<I> typeLiteral, TypeEncounter<I> typeEncounter) {
	typeEncounter.register(new InjectionListener<I>() {
	public void afterInjection(I i) {

	if ($request_uri = /) {
	set $test A;
	}

	if ($host ~* teambox.com) {
	set $test "${test}B";
	}

	if ($http_cookie !~* "auth_token") {
	set $test "${test}C";

	/**
	* A class that calculates the optimal thread pool boundaries. It takes the desired target utilization and the desired
	* work queue memory consumption as input and retuns thread count and work queue capacity.
	*
	* @author Niklas Schlimm
	*
	*/
	public abstract class PoolSizeCalculator {

	/**

	public class MyPoolSizeCalculator extends PoolSizeCalculator {

	public static void main(String[] args) throws InterruptedException,
	InstantiationException,
	IllegalAccessException,
	ClassNotFoundException {
	MyThreadSizeCalculator calculator = new MyThreadSizeCalculator();
	calculator.calculateBoundaries(new BigDecimal(1.0),
	new BigDecimal(100000));
	}

	package com.developerb.dropbot;

	import com.developerb.dropbot.instrumentation.MethodInvocationTimingInterceptor;
	import com.google.inject.AbstractModule;
	import com.yammer.metrics.annotation.Timed;

	import static com.google.inject.matcher.Matchers.annotatedWith;
	import static com.google.inject.matcher.Matchers.any;

	/**

	Latency Comparison Numbers (~2012)
	----------------------------------
	L1 cache reference 0.5 ns
	Branch mispredict 5 ns
	L2 cache reference 7 ns 14x L1 cache
	Mutex lock/unlock 25 ns
	Main memory reference 100 ns 20x L2 cache, 200x L1 cache
	Compress 1K bytes with Zippy 3,000 ns 3 us
	Send 1K bytes over 1 Gbps network 10,000 ns 10 us
	Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD

	/*****************************************************************************
	* QuantCup 1: Price-Time Matching Engine
	*
	* Submitted by: voyager
	*
	* Design Overview:
	* In this implementation, the limit order book is represented using
	* a flat linear array (pricePoints), indexed by the numeric price value.
	* Each entry in this array corresponds to a specific price point and holds
	* an instance of struct pricePoint. This data structure maintains a list

	import java.util.BitSet;

	import redis.clients.jedis.Jedis;

	public class SieveOfEratosthenes {

	private static String sieveSetKeyCorrected = "correct_sieve";
	private static String sieveSetKeyDefaultJava = "wrong_sieve";
	private static String spoolSieve = "sieve_set_bits";