| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| JaLC DOI |
|
| 関連DOI |
|
| 関連URI |
|
| 関連情報 |
|
| 概要 |
Conventional process schedulers in operating systems control the sharing of the CPU resources among processes using a fixed scheduling policy, in which the utilization of a computer system (e.g., a re...al-time or a time-sharing system) is a major concern rather than content or behavior of a process. As a result, the CPU resource is likely to be used in an inefficient manner, or the processing time of a process may be extended unnecessarily. Therefore, we proposed a process' behavior-based scheduler in oder to reduce the processing time and the process switching cost. More specifically, our scheduler allows a process to continue its execution even though its time-slice has already expired, when it is predicted from an advanced knowledge called PFS (Program Flow Sequence) that the process needs a little bit more CPU time before it voluntarily relinquishes the CPU. In this paper, we present the experimental evaluation of our proposed scheduler.続きを見る
|
Mendeley出力
