Name
Abstract | ||
|---|---|---|
Abstract The Reflecting and Gr owing mappings have been proposed to map parallel divide - and - conquer algorithms onto two - dimensional meshes The performance properties of these mappings have been analysed under the assumption that the parallel algorithm is initiated always at the same fixed node of the mesh In this scenario, the Reflecting mapping is optimal for meshes with wormhole r outing and the Growing mapping is very close to the optimal for meshes with store - and - forward routing In this paper we consider a more general scenario in which the parallel divide - and - conquer algorithm can be started from an arbitrary node of the mesh It is shown that, in this new scenario, while the Reflecting mapping is still optimal for a wormhole mesh, the performance of the Growing mapping in store - and - forward meshes decreases very quickly when the mesh size increases An alternative approach is proposed which, besides being simpler than both the Reflecting and Gr owing mappings, is also optimal for wormhole meshes and better than the Growing mapping for store - and - forward meshes |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/BFb0057966 | Euro-Par |
Keywords | Field | DocType |
hypercube,wormhole,index terms: divide-and-conquer,two-dimensional meshes,divide-and-conquer algorithms,store-and-forward.,binomial tree,embedding,parallel algorithm,divide and conquer | Binomial options pricing model,Polygon mesh,Computer science,Parallel algorithm,Parallel computing,Volume mesh,Algorithm,Divide and conquer algorithms,Wormhole,Static mesh | Conference |
Volume | ISSN | ISBN |
1470 | 0302-9743 | 3-540-64952-2 |
Citations | PageRank | References |
3 | 0.40 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Miguel Valero-García | 1 | 59 | 9.01 |
| Antonio González | 2 | 3178 | 229.66 |
| Luis Díaz de Cerio | 3 | 31 | 5.53 |
| Dolors Royo Valles | 4 | 60 | 7.20 |