AD Teaching Wiki:

Your experimental results for exercise sheet 1

Please sumarize your results from exercise sheet 1 in a row in the table below. In the first column, write your name (abbreviate if you are in a group, to keep it short). In the second column, put the programming language you used (C++ or Java). In the third column put the average running time (in seconds) for 1000 random queries using Dijkstra's algorithm. In the fourth column put the average running time (in seconds) for 1000 random queries using A-star with the straightline heuristic. In the last column put the name of the dataset you computed these average times on (preferably Ba-Wü, but if that didn't work Saarland).

Note: Saarland has 410K non-isolated nodes, Ba-Wü has 5.2M non-isolated nodes. (K stands for thousand, M stands for million, also in the table below.)

Name

Language

Dijkstra

A-Star

Dataset

# of routes tested

Hardware

Adrian,Kevin,Christoph

C++

0.031s (#settled: 84K)

0.029s (#settled: 45431)

Saarland

1000

Core2Duo P8600 @ 2.4Ghz

Adrian,Kevin,Christoph

C++

0.574s (#settled: 974K)

0.417s (#settled: 484926)

Ba-Wü

500

Core2Duo P8600 @ 2.4Ghz

Michael,Sebastian,Simon

Java

0.018s

0.027s

Saarland

1000

Core i7 920 @ 2.67 GHz

Michael,Sebastian,Simon

Java

0.282s

0.435s

Ba-Wü

1000

Core i7 920 @ 2.67 GHz

Simon,Robin

C++

0.033s (#settled: 94K)

0.017s (#settled: 45165)

Saarland

1000

Intel X5560 @ 2.8 GHz

Simon,Robin

C++

0.518s (#settled: 1.1M)

0.242s (#settled:465038)

Ba-Wü

1000

Intel X5560 @ 2.8 GHz

Hannah

C++

0.034s (#settled: 207K)

Saarland

1000

Hannah

C++

0.677s (#settled: 2.7M)

Ba-Wü

1000

AD Teaching Wiki: EfficientRoutePlanningSS2011/Experiments (last edited 2011-05-19 23:12:35 by Hannah Bast)