Systems that admit low-cost implementations of these constructs may be described as “embarrassingly easy.” (10[2]-5[1])Hybrid implementations of these constructs (-5[1])may be described as “M:N” (“M-to-N”) systems, where M is the (10[1])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 (10[1])on two Dutch terms. (-5[1])“Pools” of these constructs consist (10[1])of “workers” waiting (10[1])to be allocated (10[3])to tasks. (10[1]-5[3])Issues of synchronization (10[3])between these constructs (10[2]-5[1])are (10[1])illustrated (10[2]-5[1])by the dining philosophers problem. (10[1])Unlike another construct, these constructs share heap memory, which can cause race conditions when (10[1])modified at different times. (10[3])For 10 points, name these (10[1])smallest units of execution for a process that allow (10[1])for parallel computation. (10[2]0[1])■END■ (10[7]0[17])