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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Motivation In recent years, molecular species delimitation has become a routine approach for quantifying and classifying… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
Highly Cited
2014
Highly Cited
2014
The development of small-scale quantum devices raises the question of how to fairly assess and detect quantum speedup. Here, we… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
[1] Several new data sets reveal that thinning and speedup of Jakobshavn Isbrae continue, following its recent rapid increase in… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We study an acceleration method for point-to-point shortest-path computations in large and sparse directed graphs with given… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The speedup over a microprocessor that can be achieved by implementing some programs on an FPGA has been extensively reported… (More)
  • figure 1
  • figure 2
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We construct a black box graph traversal problem that can be solved exponentially faster on a quantum computer than on a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This article considers the problem of how to prevent the fast RSA signature and decryption computation with residue number system… (More)
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this paper we use fluid model techniques to establish two results concerning the throughput of data switches. For an input… (More)
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We propose a new model for parallel speedup that is based on two parameters, the average parallelism of a program and its… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Let A be a Las Vegas algorithm, i.e., A is a randomized algorithm that always produces the correct answer when it stops but whose… (More)
Is this relevant?