Job scheduling policy for high throughput grid computing

Abawajy, Jemal 2005, Job scheduling policy for high throughput grid computing, Lecture notes in computer science, vol. LNCS 3719, pp. 184-192.

Attached Files (Some files may be inaccessible until you login with your DRO credentials)
Name			Description	MIMEType		Size	Downloads

Title	Job scheduling policy for high throughput grid computing
Author(s)	Abawajy, Jemal
Journal name	Lecture notes in computer science
Volume number	LNCS 3719
Start page	184
End page	192
Publisher	Springer-Verlag
Place of publication	Berlin, Germany
Publication date	2005
ISSN	1611-3349 0302-9743
Keyword(s)	grid computing high throughput computing resource management job scheduling opportunistic scheduling
Summary	The growing computational power requirements of grand challenge applications has promoted the need for merging high throughput computing and grid computing principles to harness computational resources distributed across multiple organisations. This paper identifies the issues in resource management and scheduling in the emerging high throughput grid computing context. We also survey and study the performance of several space-sharing and time-sharing opportunistic scheduling policies that have been developed for high throughput computing.
Language	eng
Field of Research	080501 Distributed and Grid Systems
Socio Economic Objective	970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category	C1 Refereed article in a scholarly journal
ERA Research output type	C Journal article
Copyright notice	©2005, Springer-Verlag
Persistent URL	http://hdl.handle.net/10536/DRO/DU:30003059

Document type:	Journal Article
Collection:	School of Information Technology

Citation counts:	Cited 1 times in Scopus Search Google Scholar
Access Statistics:	438 Abstract Views, 1 File Downloads - Detailed Statistics
Created:	Mon, 07 Jul 2008, 08:42:11 EST

Deakin Research Online