This paper introduces a technique, called resynchronization, for reducing synchronization overhead in embedded multiprocessor implementations. The technique exploits the well-known observation [35] that in a given multiprocessor implementation, certain synchronization operations may be redundant in the sense that their associated sequencing requirements are ensured by other synchronizations in the system. The goal of resynchronization is to introduce new synchronizations in such a way that the number of additional synchronizations that become redundant exceeds the number of new synchronizations that are added, and thus the net synchronization cost is reduced. Our study is based in the context of self-timed execution of iterative dataflow pr...
Static dataflow graphs are widely used in design of concurrent real-time streaming applications on m...
This paper deals with the scheduling analysis of hard real-time streaming applications. These applic...
Abstract: This paper1 introduces a simple real-time distributed computing model for message-passing ...
This paper is concerned with multiprocessor implementations of embedded applications specified as it...
The limitation of vector supercomputing and of device speed has led to the development of multiproce...
This paper addresses the problem of determining the optimal blocking factor for blocked, non-overlap...
This paper explores the problem of efficiently ordering inter-processor communication operations in ...
Abstract—This article studies the scheduling problem of a set of tasks with time or data constraints...
Synchronous dataflow (SDF) semantics are wellsuited to representing and compiling multirate signal p...
The synchronous dataflow (SDF) programming paradigm has been used extensively in design environments...
This paper explores the problem of efficiently ordering interprocessor communication operations in s...
A new model is presented to describe dataflow algorithms implemented in a multiprocessing system. Ca...
The synchronous dataflow (SDF) programming paradigm has been used extensively in design environments...
This paper presents an exact method and a heuristic method for static rate-optimal multiprocessor sc...
Synchronous dataflow graphs (SDFGs) are widely used to represent digital signal processing algorithm...
Static dataflow graphs are widely used in design of concurrent real-time streaming applications on m...
This paper deals with the scheduling analysis of hard real-time streaming applications. These applic...
Abstract: This paper1 introduces a simple real-time distributed computing model for message-passing ...
This paper is concerned with multiprocessor implementations of embedded applications specified as it...
The limitation of vector supercomputing and of device speed has led to the development of multiproce...
This paper addresses the problem of determining the optimal blocking factor for blocked, non-overlap...
This paper explores the problem of efficiently ordering inter-processor communication operations in ...
Abstract—This article studies the scheduling problem of a set of tasks with time or data constraints...
Synchronous dataflow (SDF) semantics are wellsuited to representing and compiling multirate signal p...
The synchronous dataflow (SDF) programming paradigm has been used extensively in design environments...
This paper explores the problem of efficiently ordering interprocessor communication operations in s...
A new model is presented to describe dataflow algorithms implemented in a multiprocessing system. Ca...
The synchronous dataflow (SDF) programming paradigm has been used extensively in design environments...
This paper presents an exact method and a heuristic method for static rate-optimal multiprocessor sc...
Synchronous dataflow graphs (SDFGs) are widely used to represent digital signal processing algorithm...
Static dataflow graphs are widely used in design of concurrent real-time streaming applications on m...
This paper deals with the scheduling analysis of hard real-time streaming applications. These applic...
Abstract: This paper1 introduces a simple real-time distributed computing model for message-passing ...