4 ms·

I responded to a first comment but then read the others... I think you guys are all missing the point: they're talking about crazy high perfomances. They've i

I responded to a first comment but then read the others... I think you guys are all missing the point: they're talking about crazy high perfomances. They've implemented it using non-locking algorithms, like LMAX's disruptor pattern (gigantic primitives arrays, CAS operation). It's not a "joke" to be able to process 12 millions events per second on a single core in Java (that's where the LMAX disruptor patter is at right now, and it shall go higher once Oracle fixes the JVM so that it uses a faster CAS operation when possible [it's possible on many mainstream CPU and there are RFEs for this]). The point here is that it is fast. As in "faster than anyone commenting here that is a joke could have ever build".

seanmcdirmid 14y ago
Why should I take what we all learn in computer architecture 101 seriously? Ya, it's crazy fast, but someone in the 50s or 60s invented it, and we should all know this class of algorithms like the back of our hands. Bloom filters are interesting because they reverse what we typically do, the reverse again is then not that interesting. So I thought this was a joke.
pi18n 14y ago
I hope this won't come off as tactless, but is there something going on in there more significant than CAS and writing to the database if it's a different value? Because I do non-blocking programming as a hobby and I'd love to know.