Add to ORKGsummary:In this paper we analyze the computational complexity of a processor optimization problem. Given operations with interval times in a branching flow graph, the problem is to find an assignment of the operations to a minimum number of processors. We analyze the complexity of this assignment problem for flow graphs with a constant number of program traces and a constant number of processors
This work explores the fast creation of densely populated conflict graphs at the root node of the se...
We consider the problem of scheduling a sequence of tasks in a multi-processor system with conflicts...
summary:Algorithmic nets (or flow diagrams) are a generalization of logical nets. They are finite, o...
summary:In this paper we analyze the computational complexity of a processor optimization problem. G...
AbstractIn the synthesis of hardware, operations of a scheduled flow graph (acyclic, but with branch...
AbstractThe register allocation problem for an imperative program is often modeled as the coloring p...
The register allocation problem for an imperative program is often modelled as the coloring problem ...
AbstractWe consider four combinatorial optimization problems (independent set, clique, coloring, par...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
AbstractIn this paper partition problems into k independent sets or cliques of bounded size k′ are a...
This paper studies an optimization problem that arises in the context of distributed resource alloca...
In portable multimedia systems a number of communicating tasks has to be performed on a set of heter...
AbstractThis paper studies an optimization problem that arises in the context of distributed resourc...
Conflict graphs impose disjunctive constraints for pairs of jobs, items, edges or other objects in a...
In designing VLSI architectures for a complex computational task, the functional decomposition of th...
This work explores the fast creation of densely populated conflict graphs at the root node of the se...
We consider the problem of scheduling a sequence of tasks in a multi-processor system with conflicts...
summary:Algorithmic nets (or flow diagrams) are a generalization of logical nets. They are finite, o...
summary:In this paper we analyze the computational complexity of a processor optimization problem. G...
AbstractIn the synthesis of hardware, operations of a scheduled flow graph (acyclic, but with branch...
AbstractThe register allocation problem for an imperative program is often modeled as the coloring p...
The register allocation problem for an imperative program is often modelled as the coloring problem ...
AbstractWe consider four combinatorial optimization problems (independent set, clique, coloring, par...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
AbstractIn this paper partition problems into k independent sets or cliques of bounded size k′ are a...
This paper studies an optimization problem that arises in the context of distributed resource alloca...
In portable multimedia systems a number of communicating tasks has to be performed on a set of heter...
AbstractThis paper studies an optimization problem that arises in the context of distributed resourc...
Conflict graphs impose disjunctive constraints for pairs of jobs, items, edges or other objects in a...
In designing VLSI architectures for a complex computational task, the functional decomposition of th...
This work explores the fast creation of densely populated conflict graphs at the root node of the se...
We consider the problem of scheduling a sequence of tasks in a multi-processor system with conflicts...
summary:Algorithmic nets (or flow diagrams) are a generalization of logical nets. They are finite, o...