I see so it seems that there is a curve of load handling behavior per language/lib/framework. As the load increase you enter the territory of queueing (add lat

I see so it seems that there is a curve of load handling behavior per language/lib/framework. As the load increase you enter the territory of queueing (add latenxy) up to a point. Then reject/drop requests. If the rejection is slower than the OS/hardware can provide the software crashes. For Go it appears that the curve is an almost straight vertical line to oblivion. But of course if you plan to scale and use a dedicated software to pace requests, there is no point into adding this complexity to the Go libraries. Maybe what I lament here. Is that this tradeof made by Go is not more advertised. Such that when the day comes that the dreaded out of memory killer shows up, you are ready to fight back.