|
Size: 1394
Comment:
|
Size: 1499
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 4: | Line 4: |
| Add your row to the table below, following the examples already there. In the second column put Saar or !BaWü (put numbers for only one dataset, preferable !BaWü). In the third column, put the average number of access nodes per node. In the fourth column, put the average time (per node) to compute the set of access nodes, in *milli*seconds (rounded to the next integer). In the fifth column, put the put the average query time in *micro*seconds (rounded to the next integer). In the sixth column, put the average shortest path cost (in minutes and seconds). Last two columns as usual, see the result tables for [[EfficientRoutePlanningSS2012/ReadOsmResults|Exercise Sheet 1]], [[EfficientRoutePlanningSS2012/DijkstraResults|Exercise Sheet 2]], [[EfficientRoutePlanningSS2012/AstarResults|Exercise Sheet 3]], [[EfficientRoutePlanningSS2012/ArcFlagsResults|Exercise Sheet 4]], [[EfficientRoutePlanningSS2012/ContractionResults|Exercise Sheet 6]], and [[EfficientRoutePlanningSS2012/ContractionHierarchiesResults|Exercise Sheet 7]]. | Add your row to the table below, following the examples already there. In the second column put Saar or !BaWü (put numbers for only one dataset, preferable !BaWü). In the third column, put the average time (per node) to compute the set of access nodes, in *milli*seconds (rounded to the next integer). In the fourth column, put the average number of access nodes per node. In the fifth column, put the put the average query time in *micro*seconds (rounded to the next integer). In the sixth column, put the average shortest path cost (in minutes and seconds). Last two columns as usual, see the result tables for [[EfficientRoutePlanningSS2012/ReadOsmResults|Exercise Sheet 1]], [[EfficientRoutePlanningSS2012/DijkstraResults|Exercise Sheet 2]], [[EfficientRoutePlanningSS2012/AstarResults|Exercise Sheet 3]], [[EfficientRoutePlanningSS2012/ArcFlagsResults|Exercise Sheet 4]], [[EfficientRoutePlanningSS2012/ContractionResults|Exercise Sheet 6]], and [[EfficientRoutePlanningSS2012/ContractionHierarchiesResults|Exercise Sheet 7]]. |
| Line 6: | Line 6: |
| ||'''Name''' ||'''Dataset'''|| '''#access nodes''' || '''av. time access nodes'''|| '''av. query time'''|| ''' av. SP cost''' || '''Processor / RAM''' ||'''Language''' || ||Example ||!BaWü || 11 || 1ms || 11µs || 111min11sec ||Intel X5560 @ 2.8Ghz / 96 GB ||C++ || |
||'''Name''' ||'''Dataset'''|| '''av. time access nodes'''|| '''#access nodes''' || '''av. query time'''|| ''' av. SP cost''' || '''Processor / RAM''' ||'''Language''' || ||Example ||!BaWü || 1ms|| 11 || 11µs || 111min11sec ||Intel X5560 @ 2.8Ghz / 96 GB ||C++ || ||SE KF ||!BaWü || not yet ms|| not yet || 1.25µs || 93min55sec ||Intel P8600 @ 2.4Ghz / 4 GB ||C++ || |
Results for Exercise Sheet 8 (Transit Node Routing results)
Add your row to the table below, following the examples already there. In the second column put Saar or BaWü (put numbers for only one dataset, preferable BaWü). In the third column, put the average time (per node) to compute the set of access nodes, in *milli*seconds (rounded to the next integer). In the fourth column, put the average number of access nodes per node. In the fifth column, put the put the average query time in *micro*seconds (rounded to the next integer). In the sixth column, put the average shortest path cost (in minutes and seconds). Last two columns as usual, see the result tables for Exercise Sheet 1, Exercise Sheet 2, Exercise Sheet 3, Exercise Sheet 4, Exercise Sheet 6, and Exercise Sheet 7.
Name |
Dataset |
av. time access nodes |
#access nodes |
av. query time |
av. SP cost |
Processor / RAM |
Language |
Example |
BaWü |
1ms |
11 |
11µs |
111min11sec |
Intel X5560 @ 2.8Ghz / 96 GB |
C++ |
SE KF |
BaWü |
not yet ms |
not yet |
1.25µs |
93min55sec |
Intel P8600 @ 2.4Ghz / 4 GB |
C++ |