| Goal |
|
|
|
|
|
|
|
|
|
|
|
| l | Design and
implement a dynamic processor- |
|||||||||
| allocation system
for adaptively parallel jobs (jobs |
||||||||||
| for which the
number of processors that can be used |
||||||||||
| without waste
varies during execution) |
||||||||||
| l | The problem of
allocating processors to adaptively |
|||||||||
| parallel jobs is
called the adaptively parallel |
||||||||||
| processor-allocation
problem [2]. |
||||||||||
| l | At any
given time, each job j has a desire dj and
an |
|||||||||
| allotment mj |
||||||||||