Matrix Multiplication on the Biswapped-Mesh Network

Computational Science – ICCS 2008

Xiao

2008

Self Cite

Abstract. Biswapped network (BSN) is a new topology for interconnection networks in multiprocessor systems. BSN is built of 2n copies of an n-node basic network and total nodes are 2n 2 . Some topological properties of BSN have been investigated, and some algorithms have been developed on the BSN such as sorting and matrix multiplication etc. In this paper, we develop algorithms for some basic communication operations-broadcast, prefix sum and data sum etc.

Section: Introductionmentioning

confidence: 98%

“…BSN is built of 2n copies of an n-node basic network using a simple rule for connectivity that ensures its regularity, modularity, fault tolerance, and algorithmic efficiency. Some topological properties of BSN have been investigated [3], and some algorithms have been developed on the BSN such as sorting and matrix multiplication etc [4].…”

Section: Introductionmentioning

confidence: 99%

Algorithms of Basic Communication Operation on the Biswapped Network

Computational Science – ICCS 2008

Xiao

2008

Self Cite

“…In particular, if the basic network is a Cayley digraph then so is the BSN, thus a systematic construction of large, scalable, modular, and robust parallel architectures are given, while maintaining many desirable attributes of the underlying basic network that comprises its clusters. Similar to OTIS network, some topological properties of BSN have been investigated [6], and lots of algorithms such as basic communication operations algorithms, matrix multiplication algorithm, parallel sorting algorithm and fault tolerance on the BSN have been developed [7][8][9][10].…”

Section: Introductionmentioning

confidence: 99%

Load Balancing on Heterogeneous Biswapped Network

2010 Third International Symposium on Electronic Commerce and Security

2010

Self Cite

At present, several algorithms on load balancing adopt diffusion schemes, but the diffusion schemes are not well adapt to the hierarchical interconnection networks because these networks usually have high order Laplace matrix such that computing its spectrum becomes complicated. Biswapped network is a hierarchical network which is built of 2n copies of an n-node basis network, and its basic network may be hypercube, mesh and other networks, and we have developed algorithm of load balancing on homogeneous Biswapped network. In this paper, we generalized algorithm on load balancing to adapt to heterogeneous Biswapped network. Simulation results show that proposed algorithm has significant promotion in efficiency and stability.

“…In this paper, we first define the single-source-weighted mu lti-level graph model, and then by constructing a vectormatrix mu ltip le model [8] [9], d ividing into parallel tasks and setting data communication's method, we give a parallel algorith m to solve the shortest path problem of the singlesource multi-level g raph. Through pseudo-code, we analyze some impo rtant performance index of parallel algorith m in theory and make lots of experimental validation.…”

Section: Introductionmentioning

confidence: 99%

The Shortest Path Parallel Algorithm on Single Source Weighted Multi-level Graph

Peng

2009 Second International Workshop on Computer Science and Engineering

2009

Self Cite

Aiming at the single source shortest path problem on the single source weighted multi-level graph, this paper brings forward a new and practical parallel algorithm on 2-D mesh network by constructing a model of vector-matrix multiple and choosing the planar evenly partition method. The parallel algorithm is propitious to handle different sizes of multi-level graph structure by the use of its simple and regular characteristic, and our algorithm only needs less computation resources. The parallel algorithm was implemented on MPI. The theoretical analysis and the experimental results prove that the parallel algorithm has the good performances in terms of speed-up ratio and parallel efficiency, and its performance is a little better than the parallel dijkstra algorithm.Keywords-single source weighted multi-level graph; vectormatrix multiple; single source shortest path; parallel algorithm.