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

learn more… | top users | synonyms

-1
votes
1answer
18 views

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 ...
1
vote
0answers
28 views

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 ...
1
vote
4answers
913 views

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 ...
0
votes
3answers
2k views

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, ...
1
vote
0answers
31 views

How to generate inputs to evaluate the performance of an implementation?

How can we assert that the performance of an implementation matches the expected performance defined in terms of Big-$\mathcal{O}$ and friends by generating best/worst case inputs? I'm thinking of a ...
20
votes
2answers
348 views

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 ...