In this paper, we define the problem of spatial mapping. We present reasons why performing spatial mappings at run-time is both necessary and desirable. We propose what is—to our knowledge—the first attempt at a formal description of spatial mappings for the embedded real-time streaming application domain. Thereby, we introduce criteria for a qualitative comparison of these spatial mappings. As an illustration of how our formalization relates to practice, we relate our own spatial mapping algorithm to the formal model
We aim at finding optimal mappings for concurrent streaming applications. Each application consists ...
Embedded streaming applications specified using parallel Models of Computation (MoC) often contain a...
We study the timing behaviour of streaming applications running on a multiprocessor architecture. De...
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...
In this paper, the problem of spatial mapping is defined. Reasons are presented to show why performi...
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...
The `free' speed-up stemming from ever increasing processor speed is over. Performance increase in ...
Real-time streaming signal processing systems typically desire high throughput and low latency. Many...
This paper describes the implementation and evaluation of an algorithm that maps a number of communi...
International audienceWe aim at mapping streaming applications that can be modeled by a series-paral...
This work evaluates an algorithm that maps a number of communicating processes to a heterogeneous ti...
Design-time application mapping is limited to a predefined set of applications and a static platform...
Tato diplomová práce se zabývá problematikou mapování a rozvrhování aplikací provádených v reálném c...
We aim at finding optimal mappings for concurrent streaming applications. Each application consists ...
Embedded streaming applications specified using parallel Models of Computation (MoC) often contain a...
We study the timing behaviour of streaming applications running on a multiprocessor architecture. De...
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...
In this paper, the problem of spatial mapping is defined. Reasons are presented to show why performi...
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...
The `free' speed-up stemming from ever increasing processor speed is over. Performance increase in ...
Real-time streaming signal processing systems typically desire high throughput and low latency. Many...
This paper describes the implementation and evaluation of an algorithm that maps a number of communi...
International audienceWe aim at mapping streaming applications that can be modeled by a series-paral...
This work evaluates an algorithm that maps a number of communicating processes to a heterogeneous ti...
Design-time application mapping is limited to a predefined set of applications and a static platform...
Tato diplomová práce se zabývá problematikou mapování a rozvrhování aplikací provádených v reálném c...
We aim at finding optimal mappings for concurrent streaming applications. Each application consists ...
Embedded streaming applications specified using parallel Models of Computation (MoC) often contain a...
We study the timing behaviour of streaming applications running on a multiprocessor architecture. De...