The Complexity of Some Basic Problems for Dynamic Process Graphs

@inproceedings{Jakoby2001TheCO,
  title={The Complexity of Some Basic Problems for Dynamic Process Graphs},
  author={Andreas Jakoby and Maciej Liskiewicz},
  booktitle={ISAAC},
  year={2001}
}
A fundamental problem in programming multiprocessors is scheduling elementary tasks on the available hardware efficiently. Traditionally, one represents tasks and precedence constraints by a data-flow graph. This representation requires that the set of tasks is known beforehand. Such an approach is not appropriate in situations where the set of tasks is not known exactly in advance, for example, when different options how to continue a program are possible. In this paper dynamic process graph… CONTINUE READING

Figures and Topics from this paper.