Systems that admit low-cost implementations of these constructs may be described as “embarrassingly easy.” Hybrid implementations of these constructs may be described as “M:N” (“M-to-N”) systems, where M is the number of these constructs being mapped and N is the number of virtual processors. Two operations commonly used when implementing these constructs are denoted P and V, based on two Dutch terms. “Pools” of these constructs consist (10[1])of “workers” waiting to be allocated (10[1])to tasks. Issues of synchronization between these constructs are illustrated by the dining philosophers problem. Unlike another construct, these constructs share heap memory, which can cause race conditions when modified at different times. For 10 points, name these smallest units of execution for a process that allow for parallel computation. ■END■ (10[1])