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.
2015
2015
Design space exploration of microprocessor is still a challenging task for processor designers. Due to the huge design space, it… 
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
Effective scheduling is of great importance to parallel programming environments. The aim is to minimize the completion time of… 
2007
2007
The complexity of finite impulse response (FIR) filters is dominated by the number of adders (subtractors) used to implement the… 
2006
2006
performance metric FP PERCLOCK 4 LATENCY 375 (cycles) BANDWIDTH 5.3 (bytes/cycle) Computation Cost (Class S) 3,272,372(cycles… 
2005
2005
The main reason of parallelization a sequential program is to run the program faster. When running a parallel program on a real… 
1999
1999
Memory references in an instruction stream often pose a challenge for performance improvements on high-performance… 
1999
1999
We present a new approach to direct mapping of arbitrary combinational RTL (Register Transfer Level) components onto SRAM-based… 
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…