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

Dynamic hard-real-time scheduling using genetic algorithm for multiprocessor task with resource and timing constraints

โœ Scribed by Shu-Chen Cheng; Der-Fang Shiau; Yueh-Min Huang; Yen-Ting Lin

Book ID
108127963
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
172 KB
Volume
36
Category
Article
ISSN
0957-4174

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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