We extend previous results for optimally scheduling concurrent program modules, called tasks, on a fixed, finite number of parallel processors in two fundamental ways: (1) we introduce a new heuristic which considers the time delay imposed by message transmission among concurrently running tasks; and (2) we introduce a second heuristic...
We extend previous results for optimally scheduling
concurrent program modules, called tasks, on a fixed, finite number
of parallel processors in two fundamental ways: (1) we introduce a
new heuristic which considers the time delay imposed by message
transmission among concurrently running tasks; and (2) we
introduce a second heuristic...