Name
Title | ||
|---|---|---|
Parallel algorithms for computing the smallest binary tree size in unit simplex refinement. |
Abstract | ||
|---|---|---|
Refinement of the unit simplex by iterative longest edge bisection (LEB) up to sub-simplices have a size smaller or equal to a given accuracy, generates a binary tree. For a dimension higher than three, the size of the generated tree depends on the bisected LE. There may exist more than one selection sequence of LE that solves the Smallest Binary Tree Size Problem (SBTSP). Solving SBTSP by full enumeration requires considering every possible LE bisection in each sub-simplex. This is an irregular Combinatorial Optimization problem with an increasing computational burden in the dimension and the stopping criterion. Therefore, parallel computing is appealing to find the minimum size for hard instances in a reasonable time. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.jpdc.2017.05.016 | Journal of Parallel and Distributed Computing |
Keywords | Field | DocType |
Regular simplex,Longest edge bisection,Binary tree,TBB,Pthreads,Dynamic number of threads,Shared memory | Shared memory,Computer science,Parallel algorithm,Parallel computing,Enumeration,Binary tree,Algorithm,POSIX Threads,Thread (computing),Simplex,Memory footprint,Distributed computing | Journal |
Volume | Issue | ISSN |
112 | P2 | 0743-7315 |
Citations | PageRank | References |
1 | 0.40 | 18 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guillermo Aparicio | 1 | 7 | 1.64 |
| Jose M. G. Salmerón | 2 | 3 | 1.45 |
| L. G. Casado | 3 | 127 | 13.85 |
| Rafael Asenjo | 4 | 140 | 22.13 |
| Eligius M. T. Hendrix | 5 | 139 | 26.97 |