A Sub-Optimal On-Line Scheduling Algorithm with Scheduling Window(Sofware Platform)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2003-07-01

著者

• Shim Jae-hong

  School Of Internet Software Engineering Chosun University

• JUNG Gihyun

  School of E.E., Ajou University

• CHOI Kyunghee

  Grad. School of IC., Ajou Univ.

• Jung Gihyun

  School Of E.e. Ajou Univ.

• Jung Gihyun

  School Of E.e. Ajou University

• Choi Kyunghee

  Grad. School Of Ic. Ajou Univ.

関連論文

• A Sub-Optimal On-Line Scheduling Algorithm with Scheduling Window(Sofware Platform)
• A Feedback Controller for Overloaded Web Requests(Multimedia Systems for Communications)
• Pairwise Test Case Generation Based on Module Dependency(Software Engineering)
• A Heuristic Session Distribution Algorithm for Switch with Multiple Output Links(Internet)

スポンサーリンク