Skip to search formSkip to main contentSkip to account menu

Parallel algorithm

Known as: Inherently serial problem, Parallel, Parallel algorithms 
In computer science, a parallel algorithm, as opposed to a traditional serial algorithm, is an algorithm which can be executed a piece at a time on… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
We present scalable algorithms for parallel adaptive mesh refinement and coarsening (AMR), partitioning, and 2:1 balancing on… 
Highly Cited
1996
Highly Cited
1996
In the past 20 years there has been treftlen-dous progress in developing and analyzing parallel algorithftls. Researchers have… 
Highly Cited
1993
Highly Cited
1993
Abstract Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed… 
Review
1991
Review
1991
Preface Acknowledgments Notation 1 Arrays and Trees 1.1 Elementary Sorting and Counting 1.1.1 Sorting on a Linear Array Assessing… 
Highly Cited
1986
Highly Cited
1986
Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the… 
Highly Cited
1985
Highly Cited
1985
  • M. Luby
  • STOC '85
  • 1985
  • Corpus ID: 1126858
Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo… 
Highly Cited
1985
Highly Cited
1985
Kurskod: 5DV050 Inrättad: 2008-03-31 Inrättad av: teknisk-naturvetenskapliga fakultetsnämnden Reviderad: 2012-02-29 Reviderad av… 
Highly Cited
1984
Highly Cited
1984
A fast parallel thinning algorithm is proposed in this paper. It consists of two subiterations: one aimed at deleting the south… 
Highly Cited
1981
Highly Cited
1981
  • N. Megiddo
  • 22nd Annual Symposium on Foundations of Computer…
  • 1981
  • Corpus ID: 2212007
The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications even… 
Highly Cited
1973
Highly Cited
1973
An mth-order recurrence problem is defined as the computation of the series x<inf>1</inf>, x<inf>2</inf>, ..., X<inf>N</inf…