Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1998
Highly Cited
1998
FOUNDATIONS OF PARALLEL COMPUTING. Elements of Parallel Computing. Data Structures for Parallel Computing. Paradigms for Parallel… Expand
Highly Cited
1993
Highly Cited
1993
Abstract Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed… Expand
  • figure 3
  • figure 4
  • figure 6
  • figure 7
  • figure 9
Highly Cited
1992
Highly Cited
1992
Written by an authority in the field, this book provides an introduction to the design and analysis of parallel algorithms. The… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
1990
Highly Cited
1990
Publisher Summary This chapter discusses parallel algorithms for shared-memory machines. Parallel computation is rapidly… Expand
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… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Highly Cited
1986
Highly Cited
1986
Abstract A simple parallel randomized algorithm to find a maximal independent set in a graph G = ( V , E ) on n vertices is… Expand
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… Expand
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… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 2
  • figure 7
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… Expand
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… Expand
  • figure 2
  • table I
  • figure 3
  • table II
  • figure 1