✦ LIBER ✦

Preemptive LCFS scheduling in hard real-time applications

✍ Scribed by J Blieberger; U Schmid

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 783 KB
Volume: 15
Category: Article
ISSN: 0166-5316
DOI: 10.1016/0166-5316(92)90035-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rate monotonic scheduling in hard real-t

Rate monotonic scheduling in hard real-time systems

✍ J. Santos; J. Orozco 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 596 KB

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-

Techniques to increase the schedulable u

Techniques to increase the schedulable utilization of cache-based preemptive real-time systems

✍ José V. Busquets-Mataix; Daniel Gil; Pedro Gil; Andy Wellings 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 624 KB

802.5 priority mechanism in hard real-ti

802.5 priority mechanism in hard real-time RMS applications

✍ J Santos; ML Gastaminza; J Orozco; C Matrangolo 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 394 KB

Task scheduling in hard real-time embedd

Task scheduling in hard real-time embedded systems using hardware co-processors

✍ JE Cooling 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 708 KB

Scheduling hard real-time tasks with tol

Scheduling hard real-time tasks with tolerance of multiple processor failures

✍ Yingfeng Oh; Sang H. Son 📂 Article 📅 1994 🏛 Elsevier Science ⚖ 955 KB