In this paper, the problem of spatial mapping is defined. Reasons are presented to show why performing spatial mappings at run-time is both necessary and desirable and criteria for the qualitative comparisson of spatial mappings are introduced. An algorithm is described that implements a preliminary spatial mapper. The methods used in the algorithm are demonstrated with an illustrative example.
In this work, we investigate the problem of automatically mapping applications onto a coarse-grained...
National audienceThe increasing real-time processing requirements have lead to the significant use o...
International audienceWe aim at finding optimal mappings for concurrent streaming applications. Each...
In this paper, we define the problem of spatial mapping. We present reasons why performing spatial m...
In this paper, we present an algorithm for run-time al-location of hardware resources to software ap...
In this paper, we present an algorithm for run-time allocation of hardware resources to software app...
In this paper, the problem of spatial mapping is defined. Reasons are presented to show why performi...
In this paper, the problem of spatial mapping is defined. Reasons are presented to show why performi...
Abstract — This paper describes the implementation and evaluation of an algorithm that maps a number...
This paper evaluates an algorithm that maps a number of communicating processes to a heterogeneous t...
The types of data available have changed in the last decade. While, historically, data were gathered...
The types of data available have changed in the last decade. While, historically, data were gathered...
Real-time streaming signal processing systems typically desire high throughput and low latency. Many...
A mapping algorithm for heterogeneous computing sys-tems is proposed in this paper. This algorithm u...
The `free' speed-up stemming from ever increasing processor speed is over. Performance increase in ...
In this work, we investigate the problem of automatically mapping applications onto a coarse-grained...
National audienceThe increasing real-time processing requirements have lead to the significant use o...
International audienceWe aim at finding optimal mappings for concurrent streaming applications. Each...
In this paper, we define the problem of spatial mapping. We present reasons why performing spatial m...
In this paper, we present an algorithm for run-time al-location of hardware resources to software ap...
In this paper, we present an algorithm for run-time allocation of hardware resources to software app...
In this paper, the problem of spatial mapping is defined. Reasons are presented to show why performi...
In this paper, the problem of spatial mapping is defined. Reasons are presented to show why performi...
Abstract — This paper describes the implementation and evaluation of an algorithm that maps a number...
This paper evaluates an algorithm that maps a number of communicating processes to a heterogeneous t...
The types of data available have changed in the last decade. While, historically, data were gathered...
The types of data available have changed in the last decade. While, historically, data were gathered...
Real-time streaming signal processing systems typically desire high throughput and low latency. Many...
A mapping algorithm for heterogeneous computing sys-tems is proposed in this paper. This algorithm u...
The `free' speed-up stemming from ever increasing processor speed is over. Performance increase in ...
In this work, we investigate the problem of automatically mapping applications onto a coarse-grained...
National audienceThe increasing real-time processing requirements have lead to the significant use o...
International audienceWe aim at finding optimal mappings for concurrent streaming applications. Each...