1995•Mathematics of ComputationRequires access

Advances in Parallel Algorithms.

Abhiram Ranade, Lydia Kronsjö, Dean Shumsheruddin

Open publisher page 48 citations

Abstract

Supercomputers, pipelining and farming Parallel computing paradigms Neural network paradigm Parallel task-driven versus process-driven approaches Parallel branch-and-bound method Parallel divide-and-conquer approach Parallel tree and graph searching Parallel algebraic transformation approach Parallel approximate and probabilistic methods Parallel dynamic programming method Parallel exploration of maze Parallel graph reduction algorithms Parallel algorithms for matrix operations Parallel pattern recognition methods Parallel stable marriage problem Parallel travelling salesman problem Neural network approach Computational complexity of parallel algorithms Performance evaluation of parallel algorithms.

About this research paper

What this paper is about

Supercomputers, pipelining and farming Parallel computing paradigms Neural network paradigm Parallel task-driven versus process-driven approaches Parallel branch-and-bound method Parallel divide-and-conquer approach Parallel tree and graph searching Parallel algebraic transformation approach Parallel approximate and probabilistic methods Parallel dynamic programming method Parallel exploration of maze Parallel graph reduction algorithms Parallel algorithms for matrix operations Parallel pattern recognition methods Parallel stable marriage problem Parallel travelling salesman problem Neural network approach Computational complexity of parallel algorithms Performance evaluation of parallel algorithms.

Why it matters

OpenAlex reports 48 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Supercomputers, pipelining and farming Parallel computing paradigms Neural network paradigm Parallel task-driven versus process-driven approaches Parallel branch-and-bound method Parallel divide-and-conquer approach Parallel tree and graph searching Parallel algebraic transformation approach Parallel approximate and probabilistic methods Parallel dynamic programming method Parallel exploration of maze Parallel graph reduction algorithms Parallel algorithms for matrix operations Parallel pattern recognition methods Parallel stable marriage problem Parallel travelling salesman problem Neural network approach Computational complexity of parallel algorithms Performance evaluation of parallel algorithms.

Key concepts: Mathematics, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Advances in Parallel Algorithms. — Research Paper | ScholarLens