東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Fair-share scheduler for computing a...

Wang, Qi.

FindBook

Google Book

Amazon

博客來

Fair-share scheduler for computing and telecommunication systems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Fair-share scheduler for computing and telecommunication systems./
作者:	Wang, Qi.
面頁冊數:	112 p.
附註:	Source: Masters Abstracts International, Volume: 42-06, page: 2248.
Contained By:	Masters Abstracts International42-06.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MQ89868
ISBN:	0612898687

Fair-share scheduler for computing and telecommunication systems.
Wang, Qi.

Fair-share scheduler for computing and telecommunication systems. - 112 p.

Source: Masters Abstracts International, Volume: 42-06, page: 2248.

Thesis (M.Sc.)--Carleton University (Canada), 2004.

ChorusOS is a real-time operating system. The first part of the thesis focuses on allocating a fair share of the CPU resource to multiple processes that are running concurrently. Based on the native ChorusOS scheduling policies, we examine four different schedulers that distribute the CPU resource to three classes of jobs: the Equal-Priority scheduler, the Static scheduler, the Dynamic-Priority scheduler, and the Adaptive scheduler. The experimental results have shown that in general the Adaptive scheduler performs better than the other three.

ISBN: 0612898687Subjects--Topical Terms:

626642
Computer Science.

Fair-share scheduler for computing and telecommunication systems.
LDR:01975nmm 2200289 4500 001 1846974
005 20051103093607.5
008 130614s2004 eng d
020 $a 0612898687
035 $a (UnM)AAIMQ89868
035 $a AAIMQ89868
040 $a UnM $c UnM
100 1 $a Wang, Qi. $3 818625
245 1 0 $a Fair-share scheduler for computing and telecommunication systems.
300 $a 112 p.
500 $a Source: Masters Abstracts International, Volume: 42-06, page: 2248.
500 $a Advisers: Shikharesh Majumdar; Chung-Horng Lung.
502 $a Thesis (M.Sc.)--Carleton University (Canada), 2004.
520 $a ChorusOS is a real-time operating system. The first part of the thesis focuses on allocating a fair share of the CPU resource to multiple processes that are running concurrently. Based on the native ChorusOS scheduling policies, we examine four different schedulers that distribute the CPU resource to three classes of jobs: the Equal-Priority scheduler, the Static scheduler, the Dynamic-Priority scheduler, and the Adaptive scheduler. The experimental results have shown that in general the Adaptive scheduler performs better than the other three.
520 $a In the second part of the thesis, sharing of both CPU and network resources are investigated. We apply these scheduling schemes to the performance prototype of a network router. In addition to CPU scheduling, three different packet-dropping policies are also examined: the Default-Link, the Fixed-Link, and the Dynamic-Link. The experimental results show that the Adaptive scheduling policy performs reasonably well in terms of fairness, and the Dynamic-Link dropping policy provides more flexibility.
590 $a School code: 0040.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a Carleton University (Canada). $3 1018407
773 0 $t Masters Abstracts International $g 42-06.
790 1 0 $a Majumdar, Shikharesh, $e advisor
790 1 0 $a Lung, Chung-Horng, $e advisor
790 $a 0040
791 $a M.Sc.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MQ89868