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

Analysis of parallel algorithms

Known as: Brent's law, Analysis of PRAM algorithms, Critical path length 
This article discusses the analysis of parallel algorithms. Like in the analysis of "ordinary", sequential, algorithms, one is typically interested… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Many applications are inherently error tolerant. Approximate Computing is an emerging design paradigm, which gives the… Expand
  • table I
  • table II
  • figure 1
2011
2011
Complex “fat operators” are important contributors to the efficiency of specialized hardware. This paper introduces two new… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Highly Cited
2002
Highly Cited
2002
  • Huapeng Wu
  • IEEE Trans. Computers
  • 2002
  • Corpus ID: 7838255
Bit-parallel finite field multiplication using polynomial basis can be realized in two steps: polynomial multiplication and… Expand
Highly Cited
1999
Highly Cited
1999
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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
1991
Highly Cited
1991
It has been argued for many years that functional programs are well suited to parallel evaluation. This thesis investigates this… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 6.1
  • figure 6.2
Highly Cited
1990
Highly Cited
1990
A simple and efficient method for evaluating the performance of an algorithm, rendered as a directed acyclic graph, on any… Expand
Highly Cited
1990
Highly Cited
1990
Abstract Various heuristic procedures have been proposed to solve the well known NP-hard, resource-constrained project scheduling… Expand
Highly Cited
1988
Highly Cited
1988
Harnessing the massively parallel architectures soon to become available into efficient algorithmic cooperation is one of the… Expand
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… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5