Computer Science Stack Exchange
Computer Science Stack Exchange

Questions tagged [benchmarking]

Questions about methods for empirically investigating cost measures of algorithms and data structures.

25 questions
29
votes
2 answers

Where to get graphs to test my search algorithms against?

I am implementing a set of path finding algorithms such as Dijkstra's, Depth First, etc. At first I used a couple of self made graphs, but now I'd like to take the challenge a bit further and thus I'm looking for either graphs used in…
devoured elysium
  • 600
  • 4
  • 14
7
votes
2 answers

Interesting small SAT problems?

I'm noodling around with making a hardware SAT solver on an FPGA, and I'm wondering if there are any interesting SAT problems smaller than, say, 50 variables both to stay within the limits of the FPGA board (namely the number of LEDs) and so I can…
Andrew
  • 347
  • 1
  • 5
5
votes
4 answers

What are flops and how are they benchmarked?

Apple has just proudly stated that their new mac pro will be able to give up to 7 teraflops of computing power. Flops stands for Floating Point Operations Per Second. How exactly is this benchmarked though? Certain floating point operations are much…
Vincent Warmerdam
  • 153
  • 1
  • 5
4
votes
2 answers

Is Knuth's dancing cells XCC solver competitive against SAT/MILP/CSP solvers for exact cover problems?

Knuth's dancing links solver is featured prominently on the Wikipedia page of the Exact Cover Problem. A more recent version for exact cover with colors using Dancing cells was released by Knuth. This was discussed Don Knuth's 27th Annual Christmas…
worldsmithhelper
  • 213
  • 1
  • 6
4
votes
2 answers

Why do benchmark results vary at all?

Benchmarking typically consists of getting the current CPU time, executing test code a large number of times, and then subtracting the new CPU time from the previous one. However when you benchmark code multiple times, the results tend to vary…
CPlus
  • 209
  • 1
  • 10
4
votes
0 answers

Benchmark of SAT solvers on random k-SAT instances at satisfiability threshold

I am looking for a solid reference (peer-reviewed publication) on the design and/or benchmarking of SAT solvers for random k-SAT ($4 \leq k \leq 8$) operating at satisfiability threshold. The majority of published algorithmic works I know on SAT…
sbbn
  • 41
  • 3
3
votes
1 answer

Why do I get really different results with my benchmarking code I made?

I'm doing research work for my last year in high school. My work is about processors and for the experimental part i've coded an app that can mesure how many Floating Point Operation can a processor do in one second. My problem is that i get really…
NaW
  • 31
  • 1
3
votes
0 answers

How are benchmarks created?

Computing equilibria in games and the complexity thereof is imho still quite a young field in which a lot of work still is to be done (especially the former). GAMUT (2004) is a very nice "suite of game generators designated for testing…
Auberon
  • 1,332
  • 7
  • 23
2
votes
3 answers

Calculating Floating point Operations Per Second(FLOPS) and Integer Operations Per Second(IOPS)

I am trying to learn some basic benchmarking. I have a loop in my Java program like, float a=6.5f; int b=3; for(long j=0; j<999999999; j++){ var = a*b+(a/b); }//end of for My processor takes around 0.431635 second to…
Prasanna
  • 123
  • 1
  • 1
  • 3
2
votes
0 answers

Does a PC age in terms of hardware and performance?

Let's say you are using a personal computer for 10 years. Assuming all software things are the same, will the computer get the same scores on benchmarks as 10 years ago? If not, why?
asmani
  • 71
  • 8
2
votes
1 answer

How does the TEPS benchmark work and why is it relevant to real world problems?

Graph500 is a competition for supercomputers that uses a different benchmark "Traversed Edges Per Second", which is supposed to measure some notion of the communication bandwidth ability of the computer. However, I don't understand how this…
user56834
  • 4,244
  • 5
  • 21
  • 35
2
votes
0 answers

Is the data-centric "push" model for SQL evaluation nonsense?

The traditional way to implement a SQL database is to parse the query, create a parse tree, and then evaluate it using the "volcano" model. In this model you call .next() on the root node of the tree to get the next tuple, and each node calls…
ccleve
  • 129
  • 2
1
vote
1 answer

Data normalization when control has multiple values in CS/CE

(This question was originally posted at https://academia.stackexchange.com/questions/68675 but was considered too specific for Academia.) In computer science/engineering research papers relating to performance improvement wherein execution time is…
JAB
  • 113
  • 5
1
vote
2 answers

Relative Importance in Graph Theory

I am working on an algorithm that ranks a set of nodes in a graph with respect to how relative this node is to other predefined nodes (I call them query nodes). The way how the algorithm works is similar to recommendation algorithms. For instance,…
user1894963
  • 121
  • 2
1
vote
0 answers

Explanation of algorithms used by NAS benchmark kernels

I'm not sure if this is the appropriate forum for asking the following question. Please guide me to the right forum. I am trying to understand the algorithms used by kernels(such as Integer Sort) in NAS parallel benchmarks. I could not find any…
Neha Karanjkar
  • 121
  • 3
1
2