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
\u3cp\u3eWe focus on an extension of the assignment problem with additional conflict (pair) constrai...
Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: ...
In designing VLSI architectures for a complex computational task, the functional decomposition of th...
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...
In portable multimedia systems a number of communicating tasks has to be performed on a set of heter...
We consider the problem of scheduling a sequence of tasks in a multi-processor system with conflicts...
AbstractThe register allocation problem for an imperative program is often modeled as the coloring p...
The ordering of operations in a data flow program is not specified by the programmer, but is implied...
Conflict graphs impose disjunctive constraints for pairs of jobs, items, edges or other objects in a...
(eng) Mapping applications onto parallel platforms is a challenging problem, even for simple applica...
Compiling for extensible processors includes searching the application’s data-flow graphs for code s...
Tech ReportThe problem of determining an optimal dynamic assignment of a modular program in a loosel...
As parallel processing became ubiquitous in modern computing systems, parallel task models have been...
Complexities of applications implemented on embedded and programmable systems grow with the advances...
\u3cp\u3eWe focus on an extension of the assignment problem with additional conflict (pair) constrai...
Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: ...
In designing VLSI architectures for a complex computational task, the functional decomposition of th...
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...
In portable multimedia systems a number of communicating tasks has to be performed on a set of heter...
We consider the problem of scheduling a sequence of tasks in a multi-processor system with conflicts...
AbstractThe register allocation problem for an imperative program is often modeled as the coloring p...
The ordering of operations in a data flow program is not specified by the programmer, but is implied...
Conflict graphs impose disjunctive constraints for pairs of jobs, items, edges or other objects in a...
(eng) Mapping applications onto parallel platforms is a challenging problem, even for simple applica...
Compiling for extensible processors includes searching the application’s data-flow graphs for code s...
Tech ReportThe problem of determining an optimal dynamic assignment of a modular program in a loosel...
As parallel processing became ubiquitous in modern computing systems, parallel task models have been...
Complexities of applications implemented on embedded and programmable systems grow with the advances...
\u3cp\u3eWe focus on an extension of the assignment problem with additional conflict (pair) constrai...
Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: ...
In designing VLSI architectures for a complex computational task, the functional decomposition of th...