|
Size: 1133
Comment:
|
Size: 1363
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 12: | Line 12: |
| ||jk544|| 1993µs || 1.65 || 2.31 || 1.32 || C++ || Intel Core i3-5005U CPU @ 2.00GHz - 4GB RAM || Galloping search for big len diff, simple skipping of 30 elements for medium diff, non-alg improved zipper for small len diff || |
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 |
bin search for big list len diff, zipper else. mult non-algorithmic optim |
jk544 |
1993µs |
1.65 |
2.31 |
1.32 |
C++ |
Intel Core i3-5005U CPU @ 2.00GHz - 4GB RAM |
Galloping search for big len diff, simple skipping of 30 elements for medium diff, non-alg improved zipper for small len diff |