✦ LIBER ✦

An algorithm for coalescing operations with precedence constraints in real-time systems

✍ Scribed by Lung-Tien Liu; Gen-Huey Chen; Kwei-Jay Lin

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 348 KB
Volume: 46
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90058-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient scheduling algorithm for di

An efficient scheduling algorithm for distributed real-time systems with end-to-end timing constraints

✍ Atsushi Togawa; Eiji Okubo 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

This paper proposes an efficient scheduling algorithm for distributed real-time systems with such timing constraints as jitter and end-to-end timing. Conventionally, backtrack searching and annealing methods have been used for scheduling problems when timing constraints are complicated. These method

New Algorithms for Resource Reclaiming f

New Algorithms for Resource Reclaiming from Precedence Constrained Tasks in Multiprocessor Real-Time Systems

✍ G. Manimaran; C. Siva Ram Murthy; Machiraju Vijay; Krithi Ramamritham 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 208 KB

The scheduling of tasks in multiprocessor real-time systems has attracted many researchers in the recent past. Tasks in these systems have deadlines to be met, and most of the realtime scheduling algorithms use worst case computation times to schedule these tasks. Many resources will be left unused