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 of the proof and simulation shown that LSTF outperforms other established heuristic algorithms (such as earliest-deadline-first) in the sense that it minimizes the maximum tardiness of a set of tasks. LSTF can gracefully incorporate some realistic overhead assumptions, such as context switch.
Keywords for this software
References in zbMATH (referenced in 2 articles , 1 standard article )
Showing results 1 to 2 of 2.
- Bürgy, Reinhard; Bülbül, Kerem: The job shop scheduling problem with convex costs (2018)
- Cheng, Bo-Chao; Stoyenko, Alexander D.; Marlowe, Thomas J.; Baruah, Sanjoy K.: LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems (1997)