Sciweavers

115 search results - page 12 / 23
» Scheduling The Can Bus With Earliest Deadline Techniques
Sort
View
ITCC
2003
IEEE
14 years 20 days ago
A New Quality of Service Metric for Hard/Soft Real-Time Applications
Real-time applications often have mixed hard and soft deadlines, can be preempted subject to the cost of context switching or the restart of computation, and have various data dep...
Shaoxiong Hua, Gang Qu
RTSS
1995
IEEE
13 years 11 months ago
Enhancing Real-Time Schedules to Tolerate Transient Faults
We present a scheme to guarantee that the execution of real-time tasks can tolerate transient and intermittent faults assuming any queue- based scheduling technique. The scheme is...
Sunondo Ghosh, Rami G. Melhem, Daniel Mossé
ICIP
2003
IEEE
14 years 9 months ago
On the scalability of an image transcoding proxy server
Image transcoding proxies are used to improve Web browsing over low bandwidth networks by adapting content-rich web images to bandwidth-constrained clients. Such transcoding proxi...
Anubhav Savant, Nasir D. Memon, Torsten Suel
EDBT
2008
ACM
85views Database» more  EDBT 2008»
14 years 7 months ago
Optimizing on-demand data broadcast scheduling in pervasive environments
Data dissemination in pervasive environments is often accomplished by on-demand broadcasting. The time critical nature of the data requests plays an important role in scheduling t...
Rinku Dewri, Indrakshi Ray, Indrajit Ray, Darrell ...
TON
2002
102views more  TON 2002»
13 years 7 months ago
A min, + system theory for constrained traffic regulation and dynamic service guarantees
By extending the system theory under the (min, +) algebra to the time-varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic ser...
Cheng-Shang Chang, Rene L. Cruz, Jean-Yves Le Boud...