Advertisement
Published in:
2009 | OriginalPaper | Chapter
A Scalable Non-blocking Multicast Scheme for Distributed DAG Scheduling
Authors : Fengguang Song, Jack Dongarra, Shirley Moore
Published in: Computational Science – ICCS 2009
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.