timed_thread_context: destructor latency under concurrent submissions
Maintainer antworten meist innerhalb von 1 Tag
Dieses Issue hat noch niemand übernommen.
Bewertung
- Schwierigkeit
- 4/5
- Geschätzter Aufwand
- 3-5 Tage
- Anfängerfreundlichkeit
- 15/100
Rechercherichtung
Start with the close sequence in run() in include/exec/timed_thread_scheduler.hpp (around lines 195-205), where the shutdown loop spins on n_submissions_in_flight_, and with the fetch_add in schedule(). Reproduce with the included timing program under concurrent submitters. Done means the destructor's wait is bounded and no command is queued after shutdown commits, but the issue leaves the design choice to maintainers.
Vom Indexierungsmodell aus dem Issue-Text verfasst.
Beschreibung
Summary
timed_thread_context::~timed_thread_context() can take orders of magnitude
longer than expected when other threads submit operations while the context is
shutting down. The close sequence in run()
(include/exec/timed_thread_scheduler.hpp, currently around lines 195–205)
spins on n_submissions_in_flight_ with STDEXEC::__spin_loop_pause() until
it sees 0, and a submitter that is mid-schedule() keeps that counter
non-zero, so shutdown does not complete until every in-flight submission has
been released.
I measured this on macOS (Apple clang 21, arm64, -O2):
with 4 threads submitting schedule_after(300ms) operations in a tight loop
and then stopping, the destructor blocked for about 300 ms while roughly
1.3 million operations were started and stopped during the spin. In a variant
with 50 ms timers the shutdown still cost ~236 ms, i.e. several times the
remaining timer deadline.
This matches the concern raised during the review of #2231, where it was noted
that the shutdown loop "seems like it could spin for an unbounded amount of
time if other threads keep queuing new items onto it". #2231 merged with a
plan to file follow-up issues for the review comments; as far as I can tell
none of the others have been filed yet (approx. 2 months later), so I decided
to write this one up.
One contributing factor worth mentioning in the same discussion: a submitter
that observes n >= 0 right after the close CAS succeeded will still push its
command into command_queue_ (the fetch_add in schedule() is
unconditional), even though run() has already committed to exiting. That
command never gets processed; its set_stopped()/set_value() only happens
because the heap pass and the caller-provided stop callbacks race it. So the
shutdown path isn't just slow under contention, it also leaves a window where
a queued command is handled by nobody.
What I propose to investigate
Two of the alternatives suggested in the #2231 review seem reasonable:
- Keep the current "wait for in-flight submissions to drain" design, but
bound the wait: make the counter CAS into a state where no new
submissions are accepted, not just into a negative sentinel the next
fetch_addhappens to race past. That guarantees shutdown terminates
within at most (number ofschedule()calls currently in progress) steps. - Document a stronger precondition on the destructor — all submissions have
completed before destruction begins — and simplify the shutdown loop to
assume an empty queue. This is the bigger refactor also suggested in the
#2231 review (n_submissions_in_flight_could be deleted entirely).
Option 2 changes public documentation, so it likely needs a maintainer
decision; option 1 is a smaller local change. Happy to put up a PR for
whichever direction you prefer.
Notes
- The reproducer and measurement scripts are straightforward ~60-line
programs; I can attach or paste them if useful. - I ran this against
mainat 5fc945fa (theunless_stop_requestedconsteval
port merge), on commit30bb116directly after the #2231 merge the same
failure mode was already present. - #2334 and #2335 cover a related but distinct failure mode (a stop command
queued during shutdown is never drained, leaving a receiver permanently
incomplete). This issue is about the latency / termination bound of the
same close sequence, plus the queued-command race, not about the lost stop
command's refcount.
Reproducer
#include <exec/timed_thread_scheduler.hpp>
#include <exec/start_detached.hpp>
#include <stdexec/execution.hpp>
#include <atomic>
#include <chrono>
#include <cstdio>
#include <cstdlib>
#include <thread>
#include <vector>
// Measures how long the timed_thread_context destructor takes while other
// threads submit operations concurrently with shutdown.
namespace ex = STDEXEC;
int main(int argc, char** argv) {
const int submitters = argc > 1 ? std::atoi(argv[1]) : 4;
const int millis = argc > 2 ? std::atoi(argv[2]) : 300;
exec::timed_thread_context ctx;
std::atomic<bool> keep_going{true};
std::atomic<long long> completions{0};
std::vector<std::thread> threads;
for (int t = 0; t < submitters; ++t) {
threads.emplace_back([&] {
while (keep_going.load(std::memory_order_relaxed)) {
exec::start_detached(
exec::schedule_after(ctx.get_scheduler(), std::chrono::milliseconds(millis))
| ex::upon_stopped([&completions] {
completions.fetch_add(1, std::memory_order_relaxed);
}));
}
});
}
std::this_thread::sleep_for(std::chrono::milliseconds(millis));
keep_going.store(false, std::memory_order_relaxed);
for (auto& thread : threads) {
thread.join();
}
auto t0 = std::chrono::steady_clock::now();
{
// run the destructor manually, then reconstruct the object so the
// automatic destructor at scope exit is not a double destruction
exec::timed_thread_context* p = &ctx;
p->~timed_thread_context(); // request_stop() + join()
new (p) exec::timed_thread_context();
}
auto t1 = std::chrono::steady_clock::now();
auto us = std::chrono::duration_cast<std::chrono::microseconds>(t1 - t0).count();
std::printf(
"submitters=%d completions=%lld destructor-latency=%lldus\n",
submitters,
completions.load(),
static_cast<long long>(us));
return 0;
}
- Vorherrschende Sprache
- C++
- Sterne
- 2.5k
- Forks
- 281
- Ø Merge
- 1 T. 16 Std.
- Gemergte PRs (30 T.)
- 63
Entwicklungsumgebung
Dieses Projekt bietet weder Dev-Container noch Dockerfile noch Beitragsleitfaden – die Einrichtung liegt bei Ihnen. Beginnen Sie mit der README; die allgemeinen Schritte stehen in unserem Leitfaden für den ersten Beitrag.
Erste Schritte
- Lesen Sie das ganze Issue und danach den Beitragsleitfaden des Projekts.
- Schreiben Sie ins Issue, dass Sie es übernehmen — das erspart doppelte Arbeit.
- Forken Sie das Repository und arbeiten Sie in einem Branch.
- Öffnen Sie einen Pull Request, der die Issue-Nummer nennt.
Mehr aus NVIDIA/stdexec
-
Schwierigkeit 2/5 1-3 Stunden Anfängerfreundlichkeit 65/100
Maintainer antworten meist innerhalb von 1 Tag
-
Schwierigkeit 2/5 1-3 Stunden Anfängerfreundlichkeit 68/100
NVIDIA/stdexec#1751 · 3 Kommentare ·
Maintainer antworten meist innerhalb von 1 Tag
-
Schwierigkeit 5/5 Über eine Woche Anfängerfreundlichkeit 12/100
NVIDIA/stdexec#2344 · 4 Kommentare ·
Maintainer antworten meist innerhalb von 1 Tag
-
Schwierigkeit 1/5 Unter einer Stunde Anfängerfreundlichkeit 15/100
NVIDIA/stdexec#2342 · 2 Kommentare · 2 Reaktionen ·
Maintainer antworten meist innerhalb von 1 Tag
-
Schwierigkeit 3/5 1-2 Tage Anfängerfreundlichkeit 54/100
Maintainer antworten meist innerhalb von 1 Tag
Ähnliche Issues
-
Add string concatenationOffen
Schwierigkeit 2/5 1-3 Stunden Anfängerfreundlichkeit 65/100
Maintainer antworten meist innerhalb von 1 Tag
-
Bug
Schwierigkeit 2/5 1-3 Stunden Anfängerfreundlichkeit 70/100
Maintainer antworten meist innerhalb von 1 Tag
-
Schwierigkeit 2/5 1-3 Stunden Anfängerfreundlichkeit 68/100
Maintainer antworten meist innerhalb von 1 Tag
-
area: ui bug good first issue P2: medium value: medium
Schwierigkeit 2/5 1-3 Stunden Anfängerfreundlichkeit 75/100
patrick-hudson/put.gd-desktop#366 ·
Maintainer antworten meist innerhalb von 1 Tag
-
Schwierigkeit 2/5 1-3 Stunden Anfängerfreundlichkeit 76/100
Niko1221/Strata#3673 · 2 Kommentare ·
Maintainer antworten meist innerhalb von 3 Tagen