Numerical methods for shared memory parallel computing (2008)
This report discusses shared memory parallel algorithms. It explains the benefits and difficulties of parallelizing algorithms by means of some examples. The main examples are parallel algorithms for calculating a Cholesky decomposition, performing forward and back substitution and adaptively building binary triangle trees.
ANZSRC Fields of Research08 - Information and Computing Sciences::0802 - Computation Theory and Mathematics::080201 - Analysis of Algorithms and Complexity
RightsCopyright T. A. Steinke
Showing items related by title, author, creator and subject.
Oo, C. H. (University of Canterbury. Computer Science, 1978)The Dantzig-Wolfe decomposition (linear programming) principle published in 1960 involves the solving of large-scale mathematical programming problems of particular structure. Large practical problems of this type typically ...
Xu, R.; Morris, K.A.; Woodward, G.K.; Kocak, T. (University of Canterbury. Electrical and Computer Engineering, 2012)Sequential decoding can achieve a very low computational complexity and short decoding delay when the signal- to-noise ratio (SNR) is relatively high. In this paper, a low-complexity high-throughput decoding architecture ...
Loader, Lynn (University of Canterbury. Computer Science, 1983)John H. Reif has recently developed an algorithm which finds the minimum cut of a planar network. This is a modification of an earlier algorithm presented by Itai and Shiloach and has a lower theoretical time bound than ...