Name
Abstract | ||
|---|---|---|
Biswapped network (BSN) is a recently proposed network model of parallel computing, which is built of 2n copies of an n-node basic network, and its basic network may be hypercube, mesh and other networks, hence we can construct BSN-Hypercube and BSN-Mesh by using hypercube and mesh as basic network. BSN uses a simple rule for connectivity to ensure its regularity and some topological properties of BSN have been investigated. In this paper, we present sorting algorithm on the n processors BSN whose basic network has Hamiltonian path, and if the basic network of BSN is mesh, sorting n unordered elements will complete in time (2n)^1(1/2)+O(n^(3/4)). |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ICIS.2008.62 | ACIS-ICIS |
Keywords | DocType | Citations |
network model,topological property,biswapped network,n unordered element,n processor,basic network,simple rule,parallel computing,n-node basic network,hamiltonian path,computational complexity,computer science,bipartite graph,parallel processing,computer networks,information science,time complexity,network topology,parallel algorithms,clustering algorithms,concurrent computing,parallel computer,sorting algorithm,directed graphs,sorting,fault tolerance,hypercubes | Conference | 0 |
PageRank | References | Authors |
0.34 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenhong Wei | 1 | 93 | 14.13 |
| Wenjun Xiao | 2 | 218 | 25.54 |
| Zhen Zhang | 3 | 0 | 0.34 |