Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
2012
2012
The current multi-core architectures have become popular due to performance, and efficient processing of multiple tasks… 
2011
2011
Complex “fat operators” are important contributors to the efficiency of specialized hardware. This paper introduces two new… 
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… 
Highly Cited
1995
Highly Cited
1995
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for… 
Highly Cited
1992
Highly Cited
1992
Highly Cited
1990
Highly Cited
1990
A new approach to the false path problem in timing verifiers is presented. This approach is based on the modeling of both the… 
Highly Cited
1988
Highly Cited
1988
A simple and efficient method for evaluating the performance of an algorithm, rendered as a directed acyclic graph, on any… 
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…