Ef¿cient Algorithms for Cyclic Scheduling (Classic Reprint) - Softcover

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.