Colaborador:
Universidad Carlos III de Madrid. Computer Architecture, Communications and Systems Group (ARCOS)
Editor:
Carretero Pérez, Jesús García Blas, Javier Barbosa, Jorge Morla, Ricardo
Fecha de edición:
2014-11
Cita:
Carretero Pérez, Jesús; et.al. (eds.). (2014) Proceedings of the First International Workshop on Sustainable Ultrascale Computing Systems (NESUS 2014): Porto, Portugal. Universidad Carlos III de Madrid, pp. 13-18.
ISBN:
978-84-617-2251-8
Agradecimientos:
The work presented in this paper has been partially supported by
EU under the COST program Action IC1305, “Network for Sustainable
Ultrascale Computing (NESUS)”.
Palabras clave:
Scheduling
,
Distributed systems
,
Real-time jobs
,
Simulation
,
Performance evaluation
One of the major challenges in ultrascale systems is the effective scheduling of complex jobs within strict timing constraints. The distributed and heterogeneous system resources constitute another critical issue that must be addressed by the employed scheduliOne of the major challenges in ultrascale systems is the effective scheduling of complex jobs within strict timing constraints. The distributed and heterogeneous system resources constitute another critical issue that must be addressed by the employed scheduling strategy. In this paper, we investigate by simulation the performance of various policies for the scheduling of real-time directed acyclic graphs in a heterogeneous distributed environment. We apply bin packing techniques during the processor selection phase of the scheduling process, in order to utilize schedule gaps
and thus enhance existing list scheduling methods. The simulation results show that the proposed policies outperform all of the other examined algorithms.[+][-]
Nota:
Proceedings of: First International Workshop on Sustainable Ultrascale Computing Systems (NESUS 2014). Porto (Portugal), August 27-28, 2014.
