nick0garvey

Awesome. If you are not in touch with Maker Nexus (based out of Sunnyvale) already, please reach out! Would love to put you in touch with the administrators there on what they learned about successfully running a non-profit maker space.

The final Greenhouse link doesn't work in this listing

> Pipelined replication: the sequencer assigns a sequence number immediately and ships the event to replicas in parallel. Matching doesn't wait for the replicas to acknowledge.

How is this avoiding data loss if the lead sequencer goes down after acking but without the replica receiving the write?

It says "PAID ONLY BY A RELATED FOR-PROFIT", which looks to be the Mozilla Corporation. Donations are not directly paying the CEO, although I agree more of the profits from the Corporation could flow into the non-profit.

Hold the lock and write a row with timestamp at the time you read.

That row indicates you are the one processing the data and no one else should. When reading, abort the read if someone else wrote that row first.

When you are finished processing, hold the lock and update the row you added before to indicate processing is complete.

The timestamp can be used to timeout the request.

I'm not quite following. His argument appears to be: The replication system requires a backwards seek, Postgres does not support that operation, things break when that operation is attempted.

I don't understand why replication would need a backwards seek - are you saying it doesn't and he is mistaken on that?

Morphy, one of the greatest players of all time, is famous for this.

"The ability to play chess is the sign of a gentleman. The ability to play chess well is the sign of a wasted life."

I use this for everything at my house. I haven't add any issues.

I use NetworkX to build the graphs and Gephi to visualize them. No need to pick a single tool.

I also started to write a finite state machine for part 2 but found it too tedious to craft by hand. How did you do it?

This isn't unreasonable. ML workloads benefit from more computational time per request. Lower QPS = better results.