Avoiding an NP-Complete Problem by Recycling Multics’ Answer

Go can be trapped into an NP-complete problem, that of handing mutually contradictory library dependencies, if we fail to render the problem impossible. Multics started in a world where such contradictions could exist, but refused to stay there. The Multicians responded by making the problem impossible by construction. This wheel was re-invented in Solaris, and… Continue reading Avoiding an NP-Complete Problem by Recycling Multics’ Answer

Advertisements

A different dimension for time series plots

Bill Duncan, in a blog on event-pair latency, Deep Dive, ETL Dotplots, showed a different way to look at a time series that includes latency or response times. When I'm doing load tests (and I did a lot last year) I normally take a pair of plots like these as my raw data. These are from… Continue reading A different dimension for time series plots