PARAdeg-processor scheduling for acyclic SWITCH-less program nets
This paper deals with multiprocessor scheduling for acyclic SWITCH-less program nets that is a graph representation of a data-flow program. A task graph is a special case of acyclic SWITCH-less net PN and the important difference is that a program net allows nodes to fire more than once while a task...
Saved in:
Published in | Journal of the Franklin Institute Vol. 336; no. 7; pp. 1135 - 1153 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Elsevier Ltd
01.09.1999
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!