enum Packing

Ways to allocate processors

[more] AGGRESSIVE
Backfilling only - assign guaranteed time to only one queued process
[more] CONSERVATIVE
Backfilling only - assign guaranteed time to every queued process
[more] FIRSTFIT
Pack the job into the first timeslot found with sufficient PEs
[more] BESTFIT
Pack the job into the timeslot that has the smallest sufficient number of PEs
[more] WORSTFIT
Pack the job into the timeslot that has the most available sufficient PEs
[more] LRSIZE
pack from left or right based on the job's size
[more] LRSLOT
pack from left or right based on slot number
[more] DHC
Distributed hierarchical control
[more] MIGRATION
Use migration
[more] ROUNDROBIN
Use round robin
[more] RAND
Randomly pack jobs

Documentation

Ways to allocate processors
o AGGRESSIVE
Backfilling only - assign guaranteed time to only one queued process

o CONSERVATIVE
Backfilling only - assign guaranteed time to every queued process

o FIRSTFIT
Pack the job into the first timeslot found with sufficient PEs

o BESTFIT
Pack the job into the timeslot that has the smallest sufficient number of PEs

o WORSTFIT
Pack the job into the timeslot that has the most available sufficient PEs

o LRSIZE
pack from left or right based on the job's size

o LRSLOT
pack from left or right based on slot number

o DHC
Distributed hierarchical control

o MIGRATION
Use migration

o ROUNDROBIN
Use round robin

o RAND
Randomly pack jobs

Alphabetic index HTML hierarchy of classes or Java


This page was generated with the help of DOC++.