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...

Full description

Saved in:
Bibliographic Details
Published inJournal of the Franklin Institute Vol. 336; no. 7; pp. 1135 - 1153
Main Author Ge, Qi-Wei
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.09.1999
Subjects
Online AccessGet full text

Cover

Loading…