Liste des Groupes | Revenir à cl c++ |
Bonita Montero <Bonita.Montero@gmail.com> writes:Perhaps he does not know about it? Not totally sure.Am 19.04.2025 um 16:55 schrieb Scott Lurndal:Doesn't matter. With broadcast, they're all scheduled and have
>That fails on logical grounds, and is very dependent upon how>
many waiters exist at the time of the broadcast and how many
processing elements are available.
I do that only if the number of waiters is equal or smaller than
the number of enqueued items.
>
you heard the term 'thundering herd'?
N-1 of the waiters will attempt to acquire the mutex and fail;
causing unnecessary coherency traffic and unnecessary context
switches.
Les messages affichés proviennent d'usenet.