Hacker News new | past | comments | ask | show | jobs | submit login

There is a lot of literature on the subject if you want more pragmatic notes. You read Rachel’s blog not only for the tech experience, but for her storytelling skills. I particularly enjoy her blog.



She linked none of that literature, and neither did you.


This might help you, but honestly, if you want literature that will help you arrive at the same conclusions, you should read docs.

https://medium.com/@genchilu/brief-introduction-about-the-ty...

The problem is that a solution for I/O bound workloads has become generalized as the solution for all concurrency needs when in reality, that’s just half the picture.


She mentioned a hell of a lot of googlable terms: epoll_wait, Apache thundering herd, EPOLLONESHOT, EAGAIN, idempotent requests, userspace threads, copy-on-write, queue depth determination, selective LIFO, strongly typed RPC, ...


By the way, what is "selective LIFO"? I googled it and couldn't find it. Also, I couldn't find anything on queue depth determination.


It's a new term to me, but I think “selective LIFO” means switching to LIFO scheduling under overload conditions as a load-shedding measure: https://landing.google.com/sre/sre-book/chapters/addressing-...

Presumably “queue depth determination”, another new term for me, means determining how big the queue of pending requests for a service is allowed to get before further requests are refused (another load shedding measure) rather than being enqueued.




Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: