WEKO3
アイテム
Priority Enhanced Stride Scheduling
https://ipsj.ixsq.nii.ac.jp/records/17830
https://ipsj.ixsq.nii.ac.jp/records/17830e5c19565-6a85-460c-a2c4-71807f1c25a7
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-THPS4306011.pdf (328.7 kB)
|
Copyright (c) 2002 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Trans(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2002-09-15 | |||||||
| タイトル | ||||||||
| タイトル | Priority Enhanced Stride Scheduling | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Priority Enhanced Stride Scheduling | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | コンパイラとシステムソフトウェア | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Kyoto University/Presently with Systems Development Lab. Hitachi Ltd. | ||||||||
| 著者所属 | ||||||||
| Kyoto University | ||||||||
| 著者所属 | ||||||||
| Kyoto University | ||||||||
| 著者所属 | ||||||||
| Kyoto University | ||||||||
| 著者所属 | ||||||||
| Kyoto University | ||||||||
| 著者所属 | ||||||||
| Kyoto University | ||||||||
| 著者所属 | ||||||||
| Kyoto University | ||||||||
| 著者所属 | ||||||||
| Kyoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Kyoto University/Presently with Systems Development Lab., Hitachi Ltd. | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Kyoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Kyoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Kyoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Kyoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Kyoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Kyoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Kyoto University | ||||||||
| 著者名 |
DamienLeMoal
Masahiro, Ikumo
Tomoaki, Tsumura
Masahiro, Goshima
Shin-ichiroMori
Yasuhiko, Nakashima
Toshiaki, Kitamura
Shinji, Tomita
× DamienLeMoal Masahiro, Ikumo Tomoaki, Tsumura Masahiro, Goshima Shin-ichiroMori Yasuhiko, Nakashima Toshiaki, Kitamura Shinji, Tomita
|
|||||||
| 著者名(英) |
Damien, LeMoal
Masahiro, Ikumo
Tomoaki, Tsumura
Masahiro, Goshima
Shin-Ichiro, Mori
Yasuhiko, Nakashima
Toshiaki, Kitamura
Shinji, Tomita
× Damien, LeMoal Masahiro, Ikumo Tomoaki, Tsumura Masahiro, Goshima Shin-Ichiro, Mori Yasuhiko, Nakashima Toshiaki, Kitamura Shinji, Tomita
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Whereas classical scheduling methods like priority scheduling can efficiently support the execution of various type of applications fair-share scheduling methods do not provide good results for I/O bound and interactive processes execution. This paper presents a novel implementation of the fair-share scheduling method called stride scheduling and its extension using a more classical priority scheduler to support both compute bound and interactive applications. Evaluation results show that it improves fair-share allocation of CPU time among users and processes compared to strict fair-share scheduling methods and that the execution of interactive processes is not degraded. It is also shown that the scheduling overhead is bounded and does not depend on the number of runnable processes. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Whereas classical scheduling methods like priority scheduling can efficiently support the execution of various type of applications, fair-share scheduling methods do not provide good results for I/O bound and interactive processes execution. This paper presents a novel implementation of the fair-share scheduling method called stride scheduling and its extension using a more classical priority scheduler to support both compute bound and interactive applications. Evaluation results show that it improves fair-share allocation of CPU time among users and processes compared to strict fair-share scheduling methods and that the execution of interactive processes is not degraded. It is also shown that the scheduling overhead is bounded and does not depend on the number of runnable processes. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA11560614 | |||||||
| 書誌情報 |
情報処理学会論文誌ハイパフォーマンスコンピューティングシステム（HPS） 巻 43, 号 SIG06(HPS5), p. 99-111, 発行日 2002-09-15 |
|||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
