Parallel computation: Theory and algorithms (review)

\(NC\) class \(P\)-completeness combinatorics computational geometry graph theory integer arithmetic linear algebra parallel algorithms parallel computation parallel processing polynomials reducibility research survey series sorting

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Numerical linear algebra (65Fxx) Parallel numerical computation (65Y05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Discrete mathematics in relation to computer science (68Rxx) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Review text

The paper can be seen as a brief review of some subareas of parallel processing. The first part deals with theoretical models of parallel computation and a description of the \(NC\) class, reducibility, \(P\)- completeness and randomized approach is given as well. The second part of the paper is devoted to techniques for designing parallel algorithms and to references to concrete parallel algorithms of linear algebra, integer arithmetic, series and polynomials, combinatorics, graph theory, computational geometry and sorting.

Recommendations

Cited in

(12)

This page was built for publication: Parallel computation: Theory and algorithms (review)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1183834)