Task Grapher: A Tool for Scheduling Parallel Program Tasks

Task Grapher is a tool for studying optimal liarallel program task scheduling on arbitrarily intercor iected parallel processors. Given a parallel prl )gram represented as a precedence-constrained task gra] h, and an interconnect topology of a target machine Task Grapher produces the following displays: 1) Gantt Chart Schedule, 2) Speed-up Line Graph, 3) ( 'ritical Path In Task Graph, 4) Processor Utilization C1 art, 5 ) Processor Efficiency Chart, 6 ) Dynamic A :tivity Display. Task Grapher currently incorporates seven scheduling heuristics which consider variabl : task execution times, variable communication lelays between processors, and target machine interconi ection topology. Task duplication heuristics allow tri de-off between space and time when running the parallel program.