\"\" \"\" \"\"
Go backward to Symmetrical Multiprocessing
Go up to Top
Go forward to Cache Protocols
RISC-Linz logo

Symmetrical Multiprocessing

Scheduling algorithm
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 queue
Load optimally balanced among processors.
Author: Wolfgang Schreiner
Last modification: November 15, 1996