An array processor design methodology suitable for hard real-time systems is presented. Scheduling and projection of the dependence graph (DG) are solved using integer programming. By exploring the regularity of the DG it is possible to solve the necessary IP problems in an efficient manner. This methodology provides a unified approach for linear and nonlinear projection of regular and partially regular DG
A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expresse...
The production of regular computations using algorithmic engineering techniques is beginning to play...
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedence-c...
Many techniques and design tools have been developed for mapping algorithms to array processors. Lin...
Three related problems, among others, are faced when trying to execute an algorithm on a parallel ma...
[[abstract]]The data dependence graph is very useful to parallel algorithm design. In this paper, ap...
With the continuing growth of VLSI technology, special-purpose parallel processors have become a pro...
(eng) We deal with the problem of partitioning and mapping uniform loop nests onto physical processo...
The highly structured nature of many digital signal processing operations allows these to be directl...
Abstract: The modeling of processing elements (PEs) in dependence graphs (DGs), defined on 2 and 3 l...
We deal with the problem of partitioning and mapping uniform loop nests onto physical processor arra...
AbstractThis paper describes a new method of automatic generation of concurrent programs which const...
In the directed acyclic graph (dag) model of algorithms, consider the following problem for preceden...
A formal approach for the transformation of computation intensive digital signal processing algorith...
A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expresse...
A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expresse...
The production of regular computations using algorithmic engineering techniques is beginning to play...
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedence-c...
Many techniques and design tools have been developed for mapping algorithms to array processors. Lin...
Three related problems, among others, are faced when trying to execute an algorithm on a parallel ma...
[[abstract]]The data dependence graph is very useful to parallel algorithm design. In this paper, ap...
With the continuing growth of VLSI technology, special-purpose parallel processors have become a pro...
(eng) We deal with the problem of partitioning and mapping uniform loop nests onto physical processo...
The highly structured nature of many digital signal processing operations allows these to be directl...
Abstract: The modeling of processing elements (PEs) in dependence graphs (DGs), defined on 2 and 3 l...
We deal with the problem of partitioning and mapping uniform loop nests onto physical processor arra...
AbstractThis paper describes a new method of automatic generation of concurrent programs which const...
In the directed acyclic graph (dag) model of algorithms, consider the following problem for preceden...
A formal approach for the transformation of computation intensive digital signal processing algorith...
A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expresse...
A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expresse...
The production of regular computations using algorithmic engineering techniques is beginning to play...
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedence-c...