|
Size: 821
Comment:
|
Size: 1123
Comment: Add dk295's results
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 7: | Line 7: |
| As mentioned in the lecture, repeat each measurement '''5 times''' and take the average! |
|
| Line 9: | Line 11: |
| ||dk295 || 1099µs (baseline 1455µs)|| 184/118=1.56 || 1213/745=1.63 || 2968/2433=1.22 ||C++||Intel Core i7-5600U CPU @ 2.60GHz - 12 GB RAM|| binary search @ small k, zipper with non-algorithmic optim else|| |
Results for Exercise Sheet 3 (Intersect)
Add your row to the table below, following the examples already there. Please write down the time in microseconds 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.
As mentioned in the lecture, repeat each measurement 5 times and take the average!
Name |
Average time |
existence + bielefeld |
them + bielefeld |
them + existence |
Language |
Machine Spec |
Implementation Summary |
Patrick |
1698µs |
1.00 |
1.00 |
1.00 |
C++ |
Intel i5-3320M @ 2.60GH - 8 GB RAM |
None (Baseline) |
dk295 |
1099µs (baseline 1455µs) |
184/118=1.56 |
1213/745=1.63 |
2968/2433=1.22 |
C++ |
Intel Core i7-5600U CPU @ 2.60GHz - 12 GB RAM |
binary search @ small k, zipper with non-algorithmic optim else |