A New Class of Parallel Scheduling Algorithms

Elektronika / Informatyka

The book contains a wealth of information for a wide body of readers, including advanced students, researchers and professionals working in the field of discrete optimization and management. A new methodology of solving strongly NP-hard real-world job scheduling problems is presented here. It allows us to design very efficient and fast approximate and exact algorithms for solving a wide class of discrete optimization problems, not only scheduling problems. Efficiency of the present research has been proved by comprehensive computational experiments conducted in parallel processing environments such as supercomputers, clusters of workstations, multi-core CPUs and GPUs.

Cena: 42 zł
Liczba stron: 280 • Rok wydania: 2010
ISBN 978-83-7493-564-7