This book examines real-time systems. These are systems in which the correctness of a task depends on the completion time of that task. The author presents an algorithm he has designed to schedule tasks in such systems when there are more tasks than can be completed. The algorithm ensures that the system will obtain at least one quarter of the possible value that an ideal omniscient scheduling algorithm could obtain. The algorithm can be implemented using balanced search trees and runs at an amortized cost of O(log n) time per task, where n bounds the number of tasks in the system at any instant.
"synopsis" may belong to another edition of this title.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. Print on Demand. This book examines real-time systems. These are systems in which the correctness of a task depends on the completion time of that task. The author presents an algorithm he has designed to schedule tasks in such systems when there are more tasks than can be completed. The algorithm ensures that the system will obtain at least one quarter of the possible value that an ideal omniscient scheduling algorithm could obtain. The algorithm can be implemented using balanced search trees and runs at an amortized cost of O(log n) time per task, where n bounds the number of tasks in the system at any instant. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781528217583_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781528217583
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781528217583
Quantity: 15 available