Sciweavers

ICDCS
1997
IEEE
13 years 8 months ago
Predictable Network Computing
Clusters of networked, off-the-shelf workstations are currently used for computationintensive, parallel applications. However, it is hardly possible to predict the timing behaviou...
Andreas Polze, Gerhard Fohler, Matthias Werner
IPPS
1999
IEEE
13 years 8 months ago
Reducing Parallel Overheads Through Dynamic Serialization
If parallelism can be successfully exploited in a program, significant reductions in execution time can be achieved. However, if sections of the code are dominated by parallel ove...
Michael Voss, Rudolf Eigenmann
ECRTS
2000
IEEE
13 years 9 months ago
Worst-case execution times analysis of MPEG-2 decoding
This work presents the first worst-case execution times (WCET) analysis of MPEG-decoding. Solutions for two scenarios (Video-on-Demand (VoD), live) are presented, serving as exam...
Peter Altenbernd, Lars-Olof Burchard, Friedhelm St...
CDC
2009
IEEE
119views Control Systems» more  CDC 2009»
13 years 9 months ago
Isochronous manifolds in self-triggered control
Abstract— Feedback control laws are predominantly implemented on digital platforms as periodic tasks. Although periodicity simplifies the analysis and design of the implementati...
Adolfo Anta Martinez, Paulo Tabuada
INFOCOM
2002
IEEE
13 years 9 months ago
Scheduling Processing Resources in Programmable Routers
—To provide flexibility in deploying new protocols and services, general-purpose processing engines are being placed in the datapath of routers. Such network processors are typi...
Prashanth Pappu, Tilman Wolf
ISORC
2003
IEEE
13 years 9 months ago
Probabilistic Simulation-Based Analysis of Complex Real-Time Systems
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to predict consequences of adding new functionality by ...
Anders Wall, Johan Andersson, Christer Norströ...
TACAS
2004
Springer
107views Algorithms» more  TACAS 2004»
13 years 10 months ago
Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata
Abstract. We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and...
Pavel Krcál, Wang Yi
SPIN
2004
Springer
13 years 10 months ago
Formal Analysis of Processor Timing Models
Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution
Reinhard Wilhelm
HIPC
2004
Springer
13 years 10 months ago
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
K. Subramani, Kiran Yellajyosula
SC
2004
ACM
13 years 10 months ago
Language and Compiler Support for Adaptive Applications
There exist many application classes for which the users have significant flexibility in the quality of output they desire. At the same time, there are other constraints, such a...
Wei Du, Gagan Agrawal