Graduate Project
 

Task Grapher : task graph scheduling in multiprocessor computer systems

Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/graduate_projects/w95057477

Descriptions

Attribute NameValues
Creator
Abstract
  • This report presents a graphical tool for implementation of the scheduling heuristics provided by Kruatrachue. The input of scheduling is a task graph and the output is a schedule in the form of a Gantt chart. The implemented scheduling heuristics are: 1) Hu's HLF (highest level first) algorithm. 2) Yu's heuristic, 3) Kruatrachue's ISH (insertion scheduling heuristic), and 4) Kruatrachue's DSH (duplication scheduling heuristic). From the Gantt chart, it is clear that Kruatrachue's DSH offers the best contribution of balanced communication delays and parallel execution.
Resource Type
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Rights Statement
Publisher
Peer Reviewed
Language

Relationships

Parents:

This work has no parents.

Items