Fast Approximate Evaluation of Parallel Overhead from a Minimal Set of Measured Execution Times.
- Published in:
- Parallel Processing Letters, 2018, v. 28, n. 1, p. -1, doi. 10.1142/S0129626418500032
- By:
- Publication type:
- Article
Works matching IS 01296264 AND DT 2018 AND VI 28 AND IP 1
Results: 5
1
2
Scaling Up Parallel Computation of Tiled QR Factorizations by a Distributed Scheduling Runtime System and Analytical Modeling.
- Published in:
- Parallel Processing Letters, 2018, v. 28, n. 1, p. -1, doi. 10.1142/S0129626418500044
- By:
- Publication type:
- Article
3
Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees.
- Published in:
- Parallel Processing Letters, 2018, v. 28, n. 1, p. -1, doi. 10.1142/S0129626418500020
- By:
- Publication type:
- Article
4
The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks.
- Published in:
- Parallel Processing Letters, 2018, v. 28, n. 1, p. -1, doi. 10.1142/S0129626418500019
- By:
- Publication type:
- Article
5
Algorithmic Complexity and Reprogrammability of Chemical Structure Networks.
- Published in:
- Parallel Processing Letters, 2018, v. 28, n. 1, p. -1, doi. 10.1142/S0129626418500056
- By:
- Publication type:
- Article