The document describes an algorithm called HK scheduling for scheduling real-time tasks on multiprocessors. It aims to combine the advantages of list scheduling and H scheduling. HK scheduling maintains a variable tCK that divides the schedule into two parts - the first part tries to keep at least k processors busy, while the second part uses highest priority scheduling. The analysis shows H2 scheduling produces better worst-case lengths than H scheduling, while remaining feasible like H scheduling.

1. The Limited Preemption Uniprocessor Scheduling of Sporadic Task Systems Sanjoy Baruah - 2005

7. Deadline Fair Scheduling: Bridging the Theory and Practice of Proportionate Fair Scheduling in Multiprocessor Systems Abhishek Chandra, Micah Adler and Prashant Shenoy - 2001

12. Early Release Fair Scheduling James H Anderson and Anand Srinivasan - 2000

18. Bounds on the Performance of Heuristic Algorithm for Multiprocessor Scheduling of Hard-Real Time Tasks Fuxing Wang, Krithi Ramamritham and John A Stankovic - 1992