Synopsis
Excerpt from Efficient Algorithms for Cyclic Scheduling
As the previous reduction shows every polynomial time approximation algorithm for the cyclic scheduling problem can be used to approximate optimality in the acyclic case. The best such algorithm for the acyclic case guarantees a factor of (2 1 p) from p - optimality Given a cyclic task system L, the goal of this section will therefore be that of generating a periodic p-schedule a, admissible for L, such that |l||p is, in the worst case, as close as possible to (2 1 p).
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Efficient Algorithms for Cyclic Scheduling (Classic...
Seller Image
Efï cient Algorithms for Cyclic Scheduling (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: New. Print on Demand. This book introduces scheduling algorithms that help make the most of processor time on computers. It provides solutions to cyclical scheduling issues where tasks must be carried out repeatedly in a particular order. First, the author presents an efficient algorithm for generating optimum schedules when there are an unlimited number of processors. The second half of the book addresses the more complex issue of scheduling for a specific number of processors. The author provides an efficient algorithm that guarantees schedules within a small margin of optimality. The book ends with a discussion of how the ideas and algorithms presented can be applied to real-world scheduling problems. 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 # 9781333455910_0
Buy New
£ 13.18
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Efcient Algorithms for Cyclic Scheduling Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333455910
Stock Image
Efcient Algorithms for Cyclic Scheduling Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333455910
Buy New
£ 17.06
£ 3.29 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available