Sciweavers

115 search results - page 11 / 23
» Scheduling The Can Bus With Earliest Deadline Techniques
Sort
View
INFOCOM
1995
IEEE
13 years 11 months ago
A Service with Bounded Degradation in Quality-of-Service Networks
Many network applications that require Quality-ofService QoS support, such as transmission of digital voice and video, tolerate a certain level of service degradation. In this s...
Jörg Liebeherr, Dongwei Liao
RTS
2006
115views more  RTS 2006»
13 years 7 months ago
Resource access control for dynamic priority distributed real-time systems
Many of today's complex computer applications are being modeled and constructed using the principles inherent to real-time distributed object systems. In response to this dem...
Chen Zhang, David Cordes
RTSS
2009
IEEE
14 years 2 months ago
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
Recently, there have been several promising techniques developed for schedulability analysis and response time analysis for multiprocessor systems based on over-approximation. Thi...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
ECRTS
2008
IEEE
14 years 1 months ago
A Gravitational Task Model for Target Sensitive Real-Time Applications
The commonly used task models for real-time systems focus on execution windows expressing earliest start times and deadlines of tasks for feasibility. Within these windows, execut...
Raphael Guerra, Gerhard Fohler
DATE
2004
IEEE
151views Hardware» more  DATE 2004»
13 years 11 months ago
Dynamic Voltage and Cache Reconfiguration for Low Power
Given a set of real-time tasks scheduled using the earliest deadline first (EDF) algorithm, we discuss two techniques for reducing power consumption while meeting all timing requi...
André C. Nácul, Tony Givargis