Skip to search formSkip to main contentSkip to account menu

Speedup

Known as: Ideal speedup, Cache effect, Linear speedup 
In computer architecture, speedup is a process for increasing the performance between two systems processing the same problem. More technically, it… 
Wikipedia (opens in a new tab)

Related topics

Related topics

30 relations
Amdahl's lawAutomatic parallelization toolBLASTBacktracking

Broader (1)

Analysis of parallel algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Content adaptive prediction unit size decision algorithm for HEVC intra coding
The quadtree based picture partition scheme in HEVC contributes to significant coding efficiency improvement, especially for high… 
Highly Cited
2010
Highly Cited
2010
Algorithmic Aspects of Hardware/Software Partitioning: 1D Search Algorithms
Hardware/software (HW/SW) partitioning is one of the key challenges in HW/SW codesign. This paper presents efficient algorithms… 
Highly Cited
2010
Highly Cited
2010
Efficient computer implementation of coupled hydro-thermo-mechanical analysis
Highly Cited
2007
Highly Cited
2007
A Fast Algorithm and Its VLSI Architecture for Fractional Motion Estimation for H.264/MPEG-4 AVC Video Coding
This paper presents a fast algorithm and its VLSI architecture for H.264 fractional motion estimation. Motivated by the high… 
Highly Cited
2006
Highly Cited
2006
An FPGA Implementation of the LMS Adaptive Filter for Audio Processing
This paper proposes three different architectures for implementing a least mean square (LMS) adaptive filtering algorithm, using… 
Highly Cited
2004
Highly Cited
2004
Engineering an External Memory Minimum Spanning Tree Algorithm
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than… 
Highly Cited
2004
Highly Cited
2004
Dense stereo using pivoted dynamic programming
Highly Cited
2003
Highly Cited
2003
Enabling the co-allocation of grid data transfers
Data-sharing scientific communities use storage systems as distributed data stores by replicating content. In such highly… 
Highly Cited
1995
Highly Cited
1995
The Effects of Latency, Occupancy, and Bandwidth in Distributed Shared Memory Multiprocessors
Distributed shared memory (DSM) machines can be characterized by four parameters, based on a slightly modified version of the… 
Highly Cited
1987
Highly Cited
1987
Design and evaluation of parallel pipelined join algorithms
The join operation is the most costly operation in relational database management systems. Distributed and parallel processing… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)