Betriebssysteme · Institut für Systemarchitektur · Fakultät Informatik · TU Dresden |
|
01. 06. 2015Simulation of a Scheduling Algorithm for DAG-based Task ModelsMaksym PlanetaTU DresdenSondertermin: 13:30 Uhr, APB 3105
Directed acyclic graph (DAG) is a typical instrument to model structure of a parallel application, which is used by full-ahead algorithms. DAGs show dependencies between sequential parts of an application and communication between them. This thesis presents a Horizon algorithm class for scheduling DAG-based parallel applications. The Horizon algorithm extends a JIT algorithm class by providing some restricted knowledge about parallel program structure. With this new knowledge the Horizon algorithm manages to outperform a JIT algorithm. To the best of my knowledge this is the first attempt to fill the niche between full-ahead and JIT algorithms. |
28. Oct 2020
|
|
· Copyright © 2001-2022 Operating Systems Group, TU Dresden | Impressum · |