bboreham

There was such a tool, called Purify.

https://web.stanford.edu/class/cs343/resources/purify.pdf

I was choosing what to study at university in 1982, and I was advised not to pick computing since AI was going to take over programming and there would be limited careers for humans.

Particularly the https://en.wikipedia.org/wiki/Fifth_Generation_Computer_Syst... was cited.

I have a copy of The Bell System Technical Journal July-August 1978 (third printing, 1982). This contains "The UNIX Time-Sharing System" by Ritchie and Thompson, plus about 10 other papers about UNIX.

I barely know anyone who would understand why I treasure it, let alone own a copy.

https://archive.org/details/bstj57-6-1905

Two others listed here: https://sre.google/books/, "Building Secure & Reliable Systems" and "The Site Reliability Workbook".

I would also mention "The Datacenter as a Computer: designing warehouse-scale machines". https://research.google/pubs/the-datacenter-as-a-computer-de...

Tommy Flowers is known for Colossus which broke a different code, Lorenz.

https://en.wikipedia.org/wiki/Bombe cites Turing, Welchman and Rejewski.

It’s a 28 year old project.

Some of the same people bounced around implementing it in different places, but they started from scratch each time.

Some things to search for:

JP Morgan Athena BofA Quartz Kirat Singh Mark Higgins

Full respect to this piece for including the phrase “the simplest possible thing”.

I get the following banner:

> This website is produced by BBC Global News Ltd, a commercial company that is part of BBC Studios, owned by the BBC (and just the BBC). No money from the licence fee was used to create this website.

From @patio11 a week ago: https://www.complexsystemspodcast.com/episodes/delve-into-co...

The subject does sometimes come up in my casual conversations, since Robin Milner was my first CS lecturer.

He never actually spoke about type inference in my presence. He did teach me CCS (pi-calculus predecessor) a couple of years later, by which time I could appreciate him.

Why? Bad management. Perhaps even bad leadership.

Amazing achievement.

I did some work for Apricot at their Glenrothes factory around 1985-87. In my memory they went heavier on GEM than Windows. I never saw an Apricot running Windows prior to the PC-compatible models.

Matt Godbolt was saying recently that using tail-calls for an interpreter suits the branch predictor inside the cpu. Compared to a single big switch / computed jump.

Watch at https://youtu.be/-L8OFMTteOo

The famous OSS database patterned after DynamoDB is https://cassandra.apache.org/

(Wondering if you never heard of it or if you don’t consider it commensurate).

FX trading has been completely online for about 20 years.

> Mimir in version 3.0 needs Apache Kafka to work.

I’d like to adjust this understanding. Kafka is the big new thing, but it’s optional. The previous way using gRPC still works.

I work on Mimir and other things at Grafana Labs.

The tool that connects into your container and updates the files was called "Tilt".

Discussed here: https://news.ycombinator.com/item?id=45567241

This is art.

Worth noting that the major clouds will sell this as 24 "vcpus".

Span has a beginning and an end time. Event typically just has a time when it happened.

That is nice. But no detail after gen 5, so mostly historical interest.

You’re right, it’s not guaranteed. Also the hypervisor might lie to you - claiming a single NUMA node but actually crossing two on the VM host.

Whilst you’re right in broad strokes, I would observe that “the garbage-collector” is one of those tight loops. Single-threaded JavaScript is perhaps one of the best defences against NUMA, but anyone running a process on multiple cores and multiple gigabytes should at least know about the problem.

Very detailed and accurate description. The author clearly knows way more than I do, but I would venture a few notes:

1. In the cloud, it can be difficult to know the NUMA characteristics of your VMs. AWS, Google, etc., do not publish it. I found the ‘lscpu’ command helpful.

2. Tools like https://github.com/SoilRos/cpu-latency plot the core-to-core latency on a 2d grid. There are many example visualisations on that page; maybe you can find the chip you are using.

3. If you get to pick VM sizes, pick ones the same size as a NUMA node on the underlying hardware. Eg prefer 64-core m8g.16xlarge over 96-core m8g.24xlarge which will span two nodes.

The Commodore machine contemporaneous with the Apple II was the PET.

    Apple I - July 1976
    Commodore PET - January 1977
    Apple II - June 1977
    C64 - January 1982

(Dates from Wikipedia)

All four used the 6502.

Do note your last example makes a biased, or poorly random, selection.

But it’s also true on the output side. Kubectl doesn’t output yaml unless you ask it to. The APIs only support json and protobuf, not yaml.