Results for Exercise Sheet 3 (Intersect)
Add your row to the table below, following the examples already there. Please write down the time in milliseconds as an integer, and the ratios as floats with exactly two digits of precision. In the first column, write your first name, or name1+name2 if you work in a group. Speedup is always measured as time_for_baseline / time_for_your_version (<1 = slower, >1 faster). In the last column briefly describe the improvements you implemented.
Name |
Average time |
film + 2015 |
film + comedy |
2015 + comedy |
Language |
Machine Spec |
Implementation Summary |
Björn |
27ms |
1.00 |
1.00 |
1.00 |
C++ |
Intel Xeon X5560 @ 2.80GHz - 36GB RAM |
Baseline |
David |
143ms |
1.34 |
8.10 |
1.55 |
Java |
Intel Core i7-2600K @ 3.40GHz - 16 GB RAM |
Gallop-Search(with BS), reduced if-branches |
Heinz |
16 days |
1.36 |
10.09 |
1.61 |
BASIC |
Commodore 64 MOS 6510 @ 1.02 MHz - 64 KB RAM |
|
Marco |
31ms |
2.40 |
2.90 |
1.16 |
Java |
Intel Core i5 @ 2.6 GHz - 8GB RAM |
Sentinel, native Arrays, iterate shorter list, gallop search + reuse last found index |
Matteo |
301ms |
12.5 |
9.16 |
4.50 |
Java 7 |
Intel i7 @ 1.80GHz - 8GB RAM |
native arrays, skip pointers, short list first |
Julian |
14ms |
1.71 |
3.43 |
1.66 |
c++ |
i7-4510U CPU @ 2.00GHz - 8GB RAM |
skip pointers, reduced branches |
Stefan |
? |
1.45 |
3.47 |
1.05 |
c++ |
Virtual box, AMD A10-5750M APU @ 2.5GHz- 4GB RAM |
use pointers, use gallop+binary-Search |
David |
277ms |
1,24 |
1,17 |
1,09 |
Java |
Intel i7 @ 2,8 GHz - 10GB RAM |
native arrays, galloping, reduced if branches |