Tossup

Systems that admit low-cost implementations of these constructs may be described as “embarrassingly easy.” (10[1])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. (-5[1])“Pools” of these constructs consist of “workers” waiting to be allocated to tasks. Issues of synchronization between these constructs are illustrated 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[2])For 10 points, name these smallest units of execution for a process that allow for parallel computation. ■END■ (0[8])

Back to tossups

Buzzes

Summary