Articles liés à An Optimal Scheduling Algorithm with a Competitive...
An Optimal Scheduling Algorithm with a Competitive Factor for Real-Time Systems (Classic Reprint) - Couverture souple
Synopsis
The digital edition of all books may be viewed on our website before purchase. Excerpt from An Optimal Scheduling Algorithm With a Competitive Factor for Real-Time Systems
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books.
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works. This text has been digitally restored from a historical edition. Some errors may persist, however we consider it worth publishing due to the work's historical value.The digital edition of all books may be viewed on our website before purchase.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour An Optimal Scheduling Algorithm with a Competitive...
Image fournie par le vendeur
An Optimal Scheduling Algorithm With a Competitive Factor for Real-Time Systems
impression à la demandeVendeur : Forgotten Books, London, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : 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. N° de réf. du vendeur 9781528217583_0
Acheter neuf
EUR 15,28
Livraison gratuite
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
An Optimal Scheduling Algorithm with a Competitive Factor for Real-Time Systems (Classic Reprint)
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LX-9781528217583
Acheter neuf
EUR 23,98
Livraison gratuite
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 15 disponible(s)
Image d'archives
An Optimal Scheduling Algorithm with a Competitive Factor for Real-Time Systems (Classic Reprint)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LX-9781528217583
Acheter neuf
EUR 24,22
Expédition à EUR 3,84
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : 15 disponible(s)