Go backward to Symmetrical Multiprocessing Go up to Top Go forward to Cache Protocols |
foreach P[i] do in parallel loop forever get job J with higest priority from ready queue execute at most one timeslice of J if J not yet terminated then put J back into queueLoad optimally balanced among processors.