5763

A New Class of Parallel Scheduling Algorithms

Wojciech Bozejko
Oficyna Wydawnicza Politechniki Wroclawskiej, Wroclaw, 2010

@article{bozejko2010new,

   title={A New Class of Parallel Scheduling Algorithms},

   author={Bo{.z}ejko, W.},

   year={2010}

}

Download Download (PDF)   View View   Source Source   

700

views

The main issue discussed in this book is concerned with solving job scheduling problems in parallel calculating environments, such as multiprocessor computers, clusters or distributed calculation nodes in networks, by applying algorithms which use various parallelization technologies starting from multiple calculation threads (multithread technique) up to distributed calculation processes. Strongly sequential character of the scheduling algorithms is considered to be the main obstacle in designing sufficiently effective parallel algorithms. On the one hand, up till now sequential algorithms exhausted the possibilities of significant growth in the power of solution methods. On the other hand, parallel computations offer essential advantages of solving difficult problems of combinatorial optimization, pushing towards theory, methodology and engineering of solution algorithms.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: