LSTF - A NEW SCHEDULING POLICY FOR COMPLEX REAL-TIME TASKS IN MULTIPLE PROCESSOR SYSTEMS

We propose a new algorithm, least space-time first (LSTF), for dealing with the general complex-task-multiple-processor model. The results o f the proof and simulation shown that LSTF outperforms other establish ed heuristic algorithms (such as earliest-deadline-first) in the sense that it minimizes the maximum tardiness of a set of tasks. LSTF can g racefully incorporate some realistic overhead assumptions, such as con text switch.