๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximation algorithms for scheduling real-time jobs with multiple feasible intervals

โœ Scribed by Jian-Jia Chen; Jun Wu; Chi-Sheng Shih

Publisher
Springer US
Year
2006
Tongue
English
Weight
579 KB
Volume
34
Category
Article
ISSN
0922-6443

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Online real-time preemptive scheduling o
Online real-time preemptive scheduling of jobs with deadlines on multiple machines
โœ Bhaskar Das Gupta; Michael A. Palis ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Springer US ๐ŸŒ English โš– 139 KB

In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor (or, equivalently, their maximum execution rate r = 1= ). We consider two well-

Minimal schedulability interval for real
Minimal schedulability interval for real-time systems of periodic tasks with offsets
โœ Annie Choquet-Geniet; Emmanuel Grolleau ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 286 KB

We consider real-time systems in highly safety context where tasks have to meet strict deadlines. Tasks are periodic, may have o sets, share critical resources and be precedence constrained. O -line scheduling should be of great help for such systems, but methods proposed in the literature cannot de

Scheduling Algorithms with Fault Detecti
Scheduling Algorithms with Fault Detection and Location Capabilities for Real-Time Multiprocessor Systems
โœ K. Mahesh; G. Manimaran; C.Siva Ram Murthy; Arun K. Somani ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 444 KB

Several schemes for detecting and locating faulty processors through self-diagnosis in multiprocessor systems have been discussed in the past. These schemes attempt to start multiple copies (versions) of the tasks on available idle processors simultaneously and compare the results generated by the c