In this paper we present an approach for quantitative analysis of application-specific
dataflow architectures. The approach allows the designer to rate design alternatives in a …

The widespread use of object-oriented languages and Internet security concerns are just the
beginning. Add embedded systems, multiple memory banks, highly pipelined units …

A relatively new trend in parallel programming scheduling is the so-called mixed task and
data scheduling. It has been shown that mixing task and data parallelism to solve large …

It is well-known that mixing task and data parallelism to solve large computational
applications often yields better speedups compared to either applying pure task parallelism …

Traditionally, software pipelining is applied either to the innermost loop of a given loop nest
or from the innermost loop to outer loops. This paper proposes a three-step approach, called …

LooPo is a new loop parallelizing framework developed at the University of Passau to aid us
in research on the space-time map** of loop nests. LooPo is available on the Web [11] …

We propose a novel system-level error tolerance approach specifically targeted for
multimedia compression algorithms. In particular, we focus on the motion estimation process …

This paper presents an optimal algorithm for detecting line or medium grain parallelism in
nested loops whose dependences are described by an approximation of distance vectors by …

This paper deals with parallel scheduling techniques for uniform and affine loop nests. We
deal with affine-by-statement scheduling, a powerful extension of Lamport′ s hyperplane …

A single integer linear programming model for optimally scheduling partitioned regular
algorithms is presented. The herein presented methodology differs from existing methods in …