AD Teaching Wiki:

Results for Exercise Sheet 3 (List Intersection)

Please read the instructions below, before adding something to the table!

1. Add your row to the table below, following the examples already there. Simple = the simple linear-time algorithm. Gallop = the asymptotically optimal galloping-search algorithm.

2. Provide the query times in microseconds (µs), and round them to the next integer.

3. Provide the programming language and the specs of the machine you used in the same way as the examples already there. In particular, specify the processor frequency with exactly one digit after the dot, the amount of RAM as an integer, and don't provide secondary details about the processor.

Name

university german

university berlin

university freiburg

Processor / RAM

Language

simple

gallop

simple

gallop

simple

gallop

Björn

430µs

610µs

134µs

146µs

72µs

21µs

Intel X5560 @ 2.8GHz / 36GB

C++

MartinM

1505µs

1711µs

308µs

318µs

260µs

29µs

Intel i7-3770K @ 3.5GHz / 8GB

Java

DanielL

2071µs

1454µs

595µs

140µs

392µs

44µs

Intel i7-2600 @ 3.4GHz / 16GB

Java

AlexM

6142µs

5751µs

656µs

943µs

416µs

132µs

Intel Core 2 Duo @ 2.0Ghz / 4GB

Java

Oier

5042µs

5926µs

696µs

485µs

927µs

1123µs

AD Teaching Wiki: InformationRetrievalWS1314/ResultsListIntersection (last edited 2013-11-07 20:00:53 by fp-192-52-24-39)