From ebb2b7f2d165c20bbf271b53c959b981ed0a90e3 Mon Sep 17 00:00:00 2001 From: Mike Voss Date: Wed, 4 Dec 2024 17:17:46 -0600 Subject: [PATCH] Update rfcs/proposed/task_group_dynamic_dependencies/README.md Co-authored-by: Aleksei Fedotov --- rfcs/proposed/task_group_dynamic_dependencies/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/rfcs/proposed/task_group_dynamic_dependencies/README.md b/rfcs/proposed/task_group_dynamic_dependencies/README.md index 2e62fa345e..86dd6e28b5 100755 --- a/rfcs/proposed/task_group_dynamic_dependencies/README.md +++ b/rfcs/proposed/task_group_dynamic_dependencies/README.md @@ -167,7 +167,7 @@ users. Recursive parallel algorithms are one of the primary cases that we want our task_group extension to cover. The key capability required for recursive decomposition is the ability to -create work while executing a task and insert this newly create work before +create work while executing a task and insert this newly created work before the (perhaps already submitted) successors of the currently executing task. As a simple example, consider a merge sort. As shown in the figure that follows, the top-level algorithm breaks a collection into two pieces and