| English | French |
| partitioned table parallelism | parallélisme de tableau partitionné (The parallel execution strategy for queries that select from partitioned objects. As part of the execution strategy, the query processor determines the table partitions that are required for the query and the proportion of threads to allocate to each partition. In most cases, the query processor allocates an equal or almost equal number of threads to each partition, and then executes the query in parallel across the partitions) |
| structured parallelism | parallélisme structuré (In the Concurrency Runtime, parallel code that is scheduled and finished in the lexical scope from which it starts. Under the structured parallelism model, a task does not finish until its child tasks finish) |
| unstructured parallelism | parallélisme non structuré (In the Concurrency Runtime, parallel code that can start in one context and finish in a different context. For example, a set of tasks in a task group can start in one context, and then finish in a different context) |
