1. Adelaide Research & Scholarship
  2. Theses
  3. Research Theses
Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/19450
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJames, Heath A. (Heath Alexander)en
dc.date.issued1999en
dc.identifier.urihttp://hdl.handle.net/2440/19450-
dc.descriptionBibliography: leaves 211-234.en
dc.descriptionxiv, 234 p. : ill. ; 30 cm.en
dc.description.abstractThe general problem of scheduling is investigated, with focus on jobs consisting of both independent and dependent programs. Using the constraint of restricted placement of programs, presents a scheduling system that produces heuristically good execution schedules in the absence of complete global system state information.en
dc.format.extent336209 bytesen
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.subject.lcshParallel processing (Electronic computers)en
dc.subject.lcshScheduling (Management)en
dc.subject.lcshComputer capacity Managementen
dc.titleScheduling in metacomputing systems / Heath A. James.en
dc.typeThesisen
dc.contributor.schoolDept. of Computer Scienceen
dc.provenanceThis electronic version is made publicly available by the University of Adelaide in accordance with its open access policy for student theses. Copyright in this thesis remains with the author. This thesis may incorporate third party material which has been used by the author pursuant to Fair Dealing exception. If you are the author of this thesis and do not wish it to be made publicly available or If you are the owner of any included third party copyright material you wish to be removed from this electronic version, please complete the take down form located at: http://www.adelaide.edu.au/legals.en
dc.description.dissertationThesis (Ph.D.)--University of Adelaide, Dept. of Computer Science, 1999en
Appears in Collections:Research Theses

Files in This Item:
File Description SizeFormat 
01front.pdf 328.33 kBAdobe PDFView/Open
02whole.pdf14.84 MBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.