In Ptolemy II, models specify computations by composing actors. Many computations,
however, are awkward to specify this way. A common situation is where we wish to evaluate …

The authors present a compile-time scheduling heuristic called dynamic level scheduling,
which accounts for interprocessor communication overhead when mapping precedence …

Techniques for Optimizing Multiprocessor Implementations of Signal Processing
Applications An indispensable component of the information age, signal processing is …

Designers of embedded systems are facing ever tighter constraints on design time, but
computer-aided design tools for embedded systems have not kept pace with these trends …

Most of the hard-real-time scheduling theory for multiprocessor systems assumes
independent periodic or sporadic tasks. Such a simple task model is not directly applicable …

In order to obtain a cost-efficient solution, tasks share resources in a Multi-Processor System-
on-Chip. In our architecture, shared resources are run-time scheduled. We show how the …

Application-specific, parameterized local search algorithms (PLSAs), in which optimization
accuracy can be traded off with run time, arise naturally in many optimization contexts. We …

This paper introduces a novel Real-Time Operating System (RTOS) based on a
parameterized dataflow Model of Computation (MoC). This RTOS, called Synchronous …

The authors present a new compile-time scheduling heuristic called declustering, which
schedules acyclic precedence graphs that fit the synchronous data flow (SDF) model onto …

Design space exploration (DSE) is a critical step in the design process of real-time
multiprocessor systems. Combining a formal base in form of SDF graphs with predictable …