• Publications
  • Influence
Graph Partitioning with Acyclicity Constraints
TLDR
Graphs are widely used to model execution dependencies in applications. Expand
  • 11
  • 3
  • PDF
Evolutionary multi-level acyclic graph partitioning
TLDR
We introduce a novel multi-level algorithm for the acyclic graph partitioning problem that achieves a 9% reduction of the edge cut compared to the state of the art. Expand
  • 7
  • 3
  • PDF
Evolutionary Acyclic Graph Partitioning
TLDR
We introduce a novel multi-level algorithm as well as the first evolutionary algorithm for the acyclic graph partitioning problem. Expand
  • 3
  • PDF
Automatic HAL generation for embedded multiprocessor systems
TLDR
We show how a Hardware Abstraction Layer (HAL) for device addresses and properties can be automatically generated from a formal system description while providing sufficient abstraction from hardware details. Expand
  • 3
Automatic Control Flow Generation for OpenVX Graphs
TLDR
We present a heuristic to reduce communication among PEs and to external memory by aggregating inter-process communication and pipelining image processing functions. Expand
  • 1
Multilevel Acyclic Hypergraph Partitioning
TLDR
We engineer the first n-level algorithm for the acyclic hypergraph partitioning problem. Expand
  • 1
  • PDF
Evolutionary multi-level acyclic graph partitioning
30 : 2 Graph Partitioning with Acyclicity Constraints
Graphs are widely used to model execution dependencies in applications. In particular, the NP-complete problem of partitioning a graph under constraints receives enormous attention by researchersExpand