AD Teaching Wiki:

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++

AD Teaching Wiki: EfficientRoutePlanningSS2012/TransitNodesResults (last edited 2012-06-19 22:20:30 by krlh-5f7210b8)