Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 24,63
Cantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 23,98
Cantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: Forgotten Books, London, Reino Unido
EUR 15,47
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: 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.