Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
A Scalable Non-blocking Multicast Scheme for Distributed DAG Scheduling
verfasst von : Fengguang Song, Jack Dongarra, Shirley Moore
Erschienen in: Computational Science – ICCS 2009
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper presents an application-level non-blocking multicast scheme for dynamic DAG scheduling on large-scale distributed-memory systems. The multicast scheme takes into account both network topology and space requirement of routing tables to achieve scalability. Specifically, we prove that the scheme is deadlock-free and takes at most
logN
steps to complete. The routing table chooses appropriate neighbors to store based on topology IDs and has a small space of
O
(
logN
). Although built upon MPI point-to-point operations, the experimental results show that our scheme is significantly better than the simple flat-tree method and is comparable to vendor’s collective MPI operations.