We present new scheduling techniques for systems of affine recurrence equations. We show that it is possible to extend earlier results on affine scheduling to the case when each variable of the system is scheduled independently of the others by an affine timing-function. This new technique makes it possible to analyze systems of recurrence equations with variables in different index spaces, and multi-step systolic algorithms. We illustrate our method on dynamic programming and LU decomposition
In this report we present a significant extension of the quantified equation based algorithm class o...
AbstractA restructuring transformation is described which can be used to parallelize recurrence rela...
AbstractThis paper describes a new method of automatic generation of concurrent programs which const...
We present new scheduling techniques for systems of affine recurrence equations. We show that it is ...
We present new scheduling techniques for systems of affine recurrence equations. We show that it is ...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1990 ...
Many systematic methods exist for mapping algorithms to processor arrays. The algorithm is usually s...
Graduation date: 1992Many systematic methods exist for mapping algorithms to processor arrays. The\u...
We study scheduling of structured systems of recurrence equations. We first recall the formalism of ...
We study scheduling of structured systems of recurrence equations. We first recall the formalism of ...
Theme 1 - Reseaux et systemes - Projet APISIGLEAvailable from INIST (FR), Document Supply Service, u...
Systematic methods have been proposed for the design of (semi-) systolic arrays. One approach consis...
Introduction This short report is a companion paper of the research report [1]. It cannot be read w...
AbstractWe address the scheduling problem for algorithms which can be described by a system of unifo...
AbstractWe address the scheduling problem for algorithms which can be described by a system of unifo...
In this report we present a significant extension of the quantified equation based algorithm class o...
AbstractA restructuring transformation is described which can be used to parallelize recurrence rela...
AbstractThis paper describes a new method of automatic generation of concurrent programs which const...
We present new scheduling techniques for systems of affine recurrence equations. We show that it is ...
We present new scheduling techniques for systems of affine recurrence equations. We show that it is ...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1990 ...
Many systematic methods exist for mapping algorithms to processor arrays. The algorithm is usually s...
Graduation date: 1992Many systematic methods exist for mapping algorithms to processor arrays. The\u...
We study scheduling of structured systems of recurrence equations. We first recall the formalism of ...
We study scheduling of structured systems of recurrence equations. We first recall the formalism of ...
Theme 1 - Reseaux et systemes - Projet APISIGLEAvailable from INIST (FR), Document Supply Service, u...
Systematic methods have been proposed for the design of (semi-) systolic arrays. One approach consis...
Introduction This short report is a companion paper of the research report [1]. It cannot be read w...
AbstractWe address the scheduling problem for algorithms which can be described by a system of unifo...
AbstractWe address the scheduling problem for algorithms which can be described by a system of unifo...
In this report we present a significant extension of the quantified equation based algorithm class o...
AbstractA restructuring transformation is described which can be used to parallelize recurrence rela...
AbstractThis paper describes a new method of automatic generation of concurrent programs which const...