How deeply does Grokking Concurrency cover task mapping?

Compares parallel placement with locality, notes their tradeoffs, and defers detailed mapping algorithms.

Task mapping

Task mapping is the assignment of computational tasks to processors or other processing resources.

Task mapping assigns computational tasks to processors. Like giving different road-trip responsibilities to different people, it aims to ensure every resource has useful work while keeping the overall job moving efficiently. section 13.2

A good mapping balances two goals that can compete:

Place tasks that can run in parallel on different processors to increase concurrency. section 13.7
Keep tasks that interact often on the same processor to improve locality and reduce communication costs. section 13.7
Assign tasks statically or determine their placement at runtime with load-balancing algorithms. section 13.2

Matrix multiplication

A matrix-multiplication example leaves task mapping and scheduling to the operating system. For large tasks on distributed systems or specialized hardware, choosing an effective mapping matters more. section 13.7

How Grokking Concurrency covers it

liveBook manning.com

Read Grokking Concurrency on liveBook Get the book at manning.com

Related concepts

substitution cipherincludes · A substitution cipher encrypts text by replacing each plaintext symbol with a corresponding ciphertext symbol according to a fixed mapping.
algorithmkind of · An algorithm is a finite, precisely specified procedure for performing a computation, transforming inputs into outputs, or solving a problem.
CPUconfigures · A central processing unit (CPU) is a general-purpose processor that executes computer instructions and performs computational operations.
Foster’s design methodologypart of · Foster’s design methodology is a four-step approach to designing parallel algorithms through partitioning, communication, agglomeration, and mapping.
resource utilizationaddresses · Resource utilization is the amount or proportion of a system's available computing or physical capacity occupied or consumed by a workload.
localitycontrasts with · Locality is a property of limiting interactions, accesses, decisions, representations, or code relationships to nearby elements or local context.

This explainer was generated by Manning's knowledge graph from the text of Grokking Concurrency. The section links point to the parts of the book it draws on.