Sciweavers

Share
ICCS
2009
Springer

A Scalable Non-blocking Multicast Scheme for Distributed DAG Scheduling

9 years 10 months ago
A Scalable Non-blocking Multicast Scheme for Distributed DAG Scheduling
Abstract. This paper presents an application-level non-blocking multicast scheme for dynamic DAG scheduling on large-scale distributedmemory 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 flattree method and is comparable to vendor’s collective MPI operations.
Fengguang Song, Jack Dongarra, Shirley Moore
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where ICCS
Authors Fengguang Song, Jack Dongarra, Shirley Moore
Comments (0)
books