東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Parallel job scheduling policies on ...

Abawajy, Jemal H.

FindBook

Google Book

Amazon

博客來

Parallel job scheduling policies on cluster computing systems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Parallel job scheduling policies on cluster computing systems./
作者:	Abawajy, Jemal H.
面頁冊數:	202 p.
附註:	Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1393.
Contained By:	Dissertation Abstracts International65-03B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NQ89881
ISBN:	0612898814

Parallel job scheduling policies on cluster computing systems.
Abawajy, Jemal H.

Parallel job scheduling policies on cluster computing systems. - 202 p.

Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1393.

Thesis (Ph.D.)--Carleton University (Canada), 2004.

Cluster computing has come to prominence as a cost-effective parallel processing tool for solving many complex computational problems. The key to making the cluster computing work well is the middleware technologies that can manage the policies, protocols, networks, and job scheduling across the interconnected set of computing resources. The research question addressed in this thesis is the on-line job scheduling problem for multi-cluster systems. We believe that, in order to fully harness the aggregate power of cluster computing systems, an efficient dynamic resource scheduling policy is required. To this end, we propose and experimentally validate several online dynamic scheduling policies that manage multiple job streams across both single and multiple cluster computing systems with the objectives of improving the mean response time and system utilization. Based on hierarchical resource management architecture, we present a dynamic parallel processor scheduling policy. We then extend this policy for dual (i.e., CPU and I/O) resource allocation to competing parallel jobs. Finally, we incorporate a fault-tolerant approach into the proposed job scheduling policy such that both the scheduler and the applications survive compute node and network failures. As part of performance analysis, we also extended several existing scheduling policies to make them suitable for cluster computing environments. We present results of the performance analysis under various system and workload parameters that demonstrate the viability of the proposed scheduling policies.

ISBN: 0612898814Subjects--Topical Terms:

626642
Computer Science.

Parallel job scheduling policies on cluster computing systems.
LDR:02434nmm 2200265 4500 001 1846384
005 20051103093502.5
008 130614s2004 eng d
020 $a 0612898814
035 $a (UnM)AAINQ89881
035 $a AAINQ89881
040 $a UnM $c UnM
100 1 $a Abawajy, Jemal H. $3 1934500
245 1 0 $a Parallel job scheduling policies on cluster computing systems.
300 $a 202 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-03, Section: B, page: 1393.
500 $a Adviser: S. P. Dandamudi.
502 $a Thesis (Ph.D.)--Carleton University (Canada), 2004.
520 $a Cluster computing has come to prominence as a cost-effective parallel processing tool for solving many complex computational problems. The key to making the cluster computing work well is the middleware technologies that can manage the policies, protocols, networks, and job scheduling across the interconnected set of computing resources. The research question addressed in this thesis is the on-line job scheduling problem for multi-cluster systems. We believe that, in order to fully harness the aggregate power of cluster computing systems, an efficient dynamic resource scheduling policy is required. To this end, we propose and experimentally validate several online dynamic scheduling policies that manage multiple job streams across both single and multiple cluster computing systems with the objectives of improving the mean response time and system utilization. Based on hierarchical resource management architecture, we present a dynamic parallel processor scheduling policy. We then extend this policy for dual (i.e., CPU and I/O) resource allocation to competing parallel jobs. Finally, we incorporate a fault-tolerant approach into the proposed job scheduling policy such that both the scheduler and the applications survive compute node and network failures. As part of performance analysis, we also extended several existing scheduling policies to make them suitable for cluster computing environments. We present results of the performance analysis under various system and workload parameters that demonstrate the viability of the proposed scheduling policies.
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 Dissertation Abstracts International $g 65-03B.
790 1 0 $a Dandamudi, S. P., $e advisor
790 $a 0040
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NQ89881