I have in mind something that would be like "pre-emption hierarchy illegibility" where you can only impose a weak partial order on the priorities of a number of threads, all of which have execution constraints (deadlines, varying memory load, etc)
-
-
Show this threadThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
This sounds like "thrashing". Not perfectly analogous but near. https://en.wikipedia.org/wiki/Thrashing_(computer_science) …
-
Yeah I thought of that too. Thrashing might be a special case of what I'm getting at.
End of conversation
New conversation -
-
-
Three layers down, it's called 'Boot Storm'https://searchvirtualdesktop.techtarget.com/definition/boot-storm …
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
This is maybe adjacent to "priority inversion" in scheduling systems. https://en.wikipedia.org/wiki/Priority_inversion … The wiki example is one way, it can also happen if there are a lot of L threads and the overhead of dealing with them prevents H threads from being dispatched.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Do you mean something like: https://en.wikipedia.org/wiki/Thundering_herd_problem … ? At the lower (micro-architecture) level there is something called Replay Tornadoes https://www.jilp.org/vol7/v7paper2.pdf …
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.