<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Statistics on Brave New Geek</title><link>https://bravenewgeek.com/tag/statistics/</link><description>Recent content in Statistics on Brave New Geek</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 11 Oct 2019 11:58:18 -0600</lastBuildDate><atom:link href="https://bravenewgeek.com/tag/statistics/index.xml" rel="self" type="application/rss+xml"/><item><title>Everything You Know About Latency Is Wrong</title><link>https://bravenewgeek.com/everything-you-know-about-latency-is-wrong/</link><pubDate>Sat, 12 Dec 2015 15:12:12 -0600</pubDate><guid>https://bravenewgeek.com/everything-you-know-about-latency-is-wrong/</guid><description>&lt;p&gt;Okay, maybe not &lt;em&gt;everything&lt;/em&gt; you know about latency is wrong. But now that I have your attention, we can talk about why the tools and methodologies you use to measure and reason about latency are likely horribly flawed. In fact, they’re not just flawed, they’re probably &lt;em&gt;lying to your face.&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;When I went to &lt;a href="http://www.thestrangeloop.com/"&gt;Strange Loop&lt;/a&gt; in September, I attended a workshop called “Understanding Latency and Application Responsiveness” by Gil Tene. Gil is the CTO of Azul Systems, which is most renowned for its C4 pauseless garbage collector and associated Zing Java runtime. While the workshop was four and a half hours long, Gil also gave a 40-minute talk called &lt;a href="https://youtu.be/lJ8ydIuPFeU"&gt;“How NOT to Measure Latency”&lt;/a&gt; which was basically an abbreviated, less interactive version of the workshop. If you ever get the opportunity to see Gil speak or attend his workshop, I recommend you do. At the very least, do yourself a favor and watch one of his recorded talks or find his slide decks online.&lt;/p&gt;</description></item><item><title>Probabilistic algorithms for fun and pseudorandom profit</title><link>https://bravenewgeek.com/probabilistic-algorithms-for-fun-and-pseudorandom-profit/</link><pubDate>Sun, 06 Dec 2015 13:00:19 -0600</pubDate><guid>https://bravenewgeek.com/probabilistic-algorithms-for-fun-and-pseudorandom-profit/</guid><description>&lt;iframe loading="lazy" style="border: 1px solid #CCC; border-width: 1px; margin-bottom: 5px; max-width: 100%;" src="//www.slideshare.net/slideshow/embed_code/key/u8dzHRRAHnnItb" width="595" height="485" frameborder="0" marginwidth="0" marginheight="0" scrolling="no" allowfullscreen="allowfullscreen"&gt;&lt;/iframe&gt;
&lt;p&gt;&lt;strong&gt;&lt;a href="//www.slideshare.net/TylerTreat/probabilistic-algorithms-for-fun-and-pseudorandom-profit" title="Probabilistic algorithms for fun and pseudorandom profit"&gt;Probabilistic algorithms for fun and pseudorandom profit&lt;/a&gt;&lt;/strong&gt; from &lt;strong&gt;&lt;a href="//www.slideshare.net/TylerTreat"&gt;Tyler Treat&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;</description></item><item><title>Stream Processing and Probabilistic Methods: Data at Scale</title><link>https://bravenewgeek.com/stream-processing-and-probabilistic-methods/</link><pubDate>Fri, 13 Feb 2015 10:49:07 -0600</pubDate><guid>https://bravenewgeek.com/stream-processing-and-probabilistic-methods/</guid><description>&lt;p&gt;Stream processing and related abstractions have become all the rage following the rise of systems like Apache Kafka, Samza, and the &lt;a href="http://en.wikipedia.org/wiki/Lambda_architecture"&gt;Lambda architecture&lt;/a&gt;. Applying the idea of immutable, append-only &lt;a href="http://blog.confluent.io/2015/01/29/making-sense-of-stream-processing/"&gt;event sourcing&lt;/a&gt; means we’re storing more data than ever before. However, as the cost of storage continues to decline, it’s becoming more feasible to store more data for longer periods of time. With immutability, how the data &lt;em&gt;lives&lt;/em&gt; isn’t interesting anymore. It’s all about how it &lt;em&gt;moves&lt;/em&gt;.&lt;/p&gt;</description></item><item><title>Benchmark Responsibly</title><link>https://bravenewgeek.com/benchmark-responsibly/</link><pubDate>Fri, 02 Jan 2015 14:53:22 -0600</pubDate><guid>https://bravenewgeek.com/benchmark-responsibly/</guid><description>&lt;p&gt;When I posted my &lt;a href="http://www.bravenewgeek.com/dissecting-message-queues/"&gt;Dissecting Message Queues&lt;/a&gt; article last summer, it understandably caused some controversy.  I received both praise and scathing comments, emails asking why I didn’t benchmark X and pull requests to bump the numbers of Y. To be honest, that analysis was more of a brain dump from my own test driving of various message queues than any sort of authoritative or scientific study—it was &lt;em&gt;far&lt;/em&gt; from the latter, to say the least. The qualitative discussion was pretty innocuous, but the benchmarks and &lt;a href="https://github.com/tylertreat/mq-benchmarking"&gt;supporting code&lt;/a&gt; were the target of a lot of (valid) criticism. In retrospect, it was probably irresponsible to publish them, but I was young and naive back then; now I’m just mostly naive.&lt;/p&gt;</description></item></channel></rss>