The Expressive Power and Complexity of Dynamic Process Graphs

@inproceedings{Jakoby2000TheEP,
  title={The Expressive Power and Complexity of Dynamic Process Graphs},
  author={Andreas Jakoby and Maciej Liskiewicz and R{\"u}diger Reischuk},
  booktitle={WG},
  year={2000}
}
A model for parallel and distributed programs, the dynamic process graph, is investigated under graph-theoretic and complexity aspects. Such graphs are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation is small - in many cases only logarithmic with respect to the size of any execution of the program. An important feature of this model is that the encoded executions are directed acyclic graphs with a… 
Approximating schedules for dynamic process graphs efficiently
The Complexity of Some Basic Problems for Dynamic Process Graphs
TLDR
In this paper dynamic process graph (DPG) will be used to represent the set of all possible executions of a given program and approximations of the computational complexity of some variants of scheduling problems are obtained.
A Flexible Hierarchical Approach for Controlling the System-Level Design Complexity of Embedded Systems
TLDR
A hierarchical, task-based design approach and two algorithms are developed, which allow to derive dynamically partial specification models for design space exploration on different levels of detail as well as task descriptions for IP encapsulation, which reduces the descriptive complexity of specifications and the execution time of system-level synthesis algorithm can be adopted to the current requirements of the designer.

References

SHOWING 1-8 OF 8 REFERENCES
Scheduling Dynamic Graphs
TLDR
A new model for parallel and distributed programs, the dynamic process graph, is introduced, which represents all possible executions of a program in a compact way and investigates the complexity of different aspects of the scheduling problem: the question whether a legal schedule exists at all and how to find an optimal schedule.
Compile-Time Scheduling and Assignment of Data-Flow Program Graphs with Data-Dependent Iteration
Four scheduling strategies for dataflow graphs onto parallel processors are classified: (1) fully dynamic, (2) static-assignment, (3) self-timed, and (4) fully static. Scheduling techniques valid for
Succinct Representations of Graphs
A Note on Succinct Representations of Graphs
Scheduling Dynamic Graphs, in Proc
  • ubeck,
  • 1999
Towards an Architecture-Independent Analysis of Parallel Algorithms
  • SIAM J. Comput.
  • 1990
Succinct Representations of Graphs, Information and Control
  • 1983