An Optimal On Line Scheduling Algorithm for Overloaded Real Time Systems
An Optimal On Line Scheduling Algorithm for Overloaded Real Time Systems
Gilad Koren
The book An Optimal On Line Scheduling Algorithm for Overloaded Real Time Systems was written by author Gilad Koren Here you can read free online of An Optimal On Line Scheduling Algorithm for Overloaded Real Time Systems book, rate and share your impressions in comments. If you don't know what to write, just answer the question: Why is An Optimal On Line Scheduling Algorithm for Overloaded Real Time Systems a good or bad book?
What reading level is An Optimal On Line Scheduling Algorithm for Overloaded Real Time Systems book?
To quickly assess the difficulty of the text, read a short excerpt:
This means that the index of the last deadline after which the tasks has zero value is [log2{imp{Ti))\ - 1 = [/off2(^)J - 1- For notational convenience any task T, will have associated descending tasks denoted by rpO rpl rp2 rp\log2(imp(Ti))\-l where the release times and the computation times of all these tasks are equal to the release time and the computation time of T, . Tf has a firm deadline at 'i) '" section 5 42 • Every other task, T, where j L — e ■ V, , by assumption 3. 2 c, ,mar X -... e • (1 + y/k) • achievedvalue(/), by lemma 5. 4 ^ (l+>/fc) achieved value (/) — k The "loss" from scheduling T. During BUSY is at least k ■ (i+>/fc)achievedvalue(/) ^j^^ value obtained by scheduling T, is at most (1 + \/k) ■ achievedvalue(/) (lemma 5. 4). Hence the net gain is less than or equal to zero.
You can download books for free in various formats, such as epub, pdf, azw, mobi, txt and others on book networks site. Additionally, the entire text is available for online reading through our e-reader. Our site is not responsible for the performance of third-party products (sites).
User Reviews: