A Sub-Optimal On-Line Scheduling Algorithm with Scheduling Window

Jae-Hong SHIM  Gihyun JUNG  Kyunghee CHOI  

IEICE TRANSACTIONS on Communications   Vol.E86-B   No.7   pp.2232-2236
Publication Date: 2003/07/01
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Software Platform
real-time system,  on-line scheduling,  maximizing total reward,  scheduling window,  

Full Text: PDF(433.8KB)>>
Buy this Article

The complexities of many previous scheduling algorithms for IRIS tasks are too high to apply them to practical systems handling many tasks. The high complexities stem from the fact that the algorithms perform scheduling on all tasks in a system, producing an optimal solution. As a way to reduce the complexity of scheduling, we propose a heuristic on-line scheduling algorithm that schedules the IRIS tasks only in a scheduling window, producing a sub-optimal solution. A scheduling window contains W important tasks determined by a selection policy. The performance of the proposed algorithm is verified by simulation.