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.
2013
2013
The trade-off between throughput and memory constraints is a common design problem in embedded systems, and especially for… 
2012
2012
The current multi-core architectures have become popular due to performance, and efficient processing of multiple tasks… 
2008
2008
In H.264/AVC, the concept of adapting the transform size to the block size of motion-compensated prediction residue has proven to… 
2007
2007
In this paper, we propose a placement method for island-style FPGAs, based on fast yet very good initial placement followed by… 
2007
2007
The complexity of finite impulse response (FIR) filters is dominated by the number of adders (subtractors) used to implement the… 
2007
2007
Effective scheduling is of great importance to parallel programming environments. The aim is to minimize the completion time of… 
2007
2007
Hardware for ambient intelligence needs to achieve extremely high computational efficiency (up to 40GOPS/W). An important way for… 
1997
1997
We present an algorithm called MOVER (Multiple Operating Voltage Energy Reduction) to minimize datapath energy dissipation… 
1995
1995
We investigate parallel algorithms to compute recursively defined functions. Our computational model are parallel random access… 
1994
1994
We implement the NAS parallel benchmark FT, which numerically solves a three dimensional partial diierential equation using…