Differences between revisions 2 and 32 (spanning 30 versions)

Results for Exercise Sheet 7 (Contraction Hierarchies, precomputation + query 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 update heuristic(s). In the fourth column, put the total precomputation time (in minutes ans seconds). In the fifth column, put the total number of shortcuts added in your precomputation. In the sixth column, put the average query time in milliseconds (precision: exactly one digit after the dot). In the seventh 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, and Exercise Sheet 6.

Name	Dataset	ED update	precomp. time	#shortcuts	av. query time	av. SP cost	Processor / RAM	Language
Example	BaWü	lazy+spatial	11min1sec	111,111	1.1ms	111min11sec	Intel X5560 @ 2.8Ghz / 96 GB	C++
SE KF	BaWü	lazy+neighbour	1min56sec	2,352,648	1.8ms	92min31sec	Intel P8600 @ 2.4Ghz / 4 GB	C++
nils	BaWü	lazy	0min60sec	1,787,945	-	-	AMD X2 BE2350 @ 2.1GHz / 4 GB	C++
Ant-Cyn	Saarland	lazy	0min20sec	91,527	118ms	27min46sec	Intel i5-2410M @ 2.3Ghz / 4 GB	Java
Felix	Saarland	neighbour	0min16sec	62,315	33ms	--min--sec	Intel i5-2410M @ 2.3GHz / 4 GB	Java
Viktor	Saarland	lazy+periodic	1min11sec	181,677	0.5ms	22min55sec	Intel T9300 @ 2.5GHz / 6 GB	Java
Stefan	Saarland	lazy+periodic	0min13sec	192,085	2.0ms	22min35sec	Intel 2670QM @ 2.2Ghz / 6 GB	Java
SG CB	Saarland	periodic	0min48sec	343,730	--min--sec	--min--sec	Intel T5870 @ 2.0GHz / 4GB	Java
niklas	Saarland	lazy	0min08sec	208,956	0.9ms	23min10sec	Intel 2410M @ 2.3GHz / 4 GB	C++
Diego	Saarland	lazy	0min50sec	1,438,110	TODO	TODO	Intel T5450 @ 1.7GHz / 2 GB	C++
Tobias	Saarland	lazy	1min19sec	210,908	14.7 ms	33min11sec	Intel N450 @ 1.66GHz / 2 GB	C++

-  ⇤ ← Revision 2 as of 2012-06-12 21:53:38 → 
  Size: 1299
  Editor: Hannah Bast
  Comment:
+   ← Revision 32 as of 2017-01-17 12:42:18 → ⇥
  Size: 2572
  Editor: mail2
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 2:
-= Results for Exercise Sheet 6 (Contraction Hierarchies, precomputation + query results) =
+= Results for Exercise Sheet 7 (Contraction Hierarchies, precomputation + query results) =
 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 total precomputation time (in minutes ans seconds). In the fourth column, put the total number of shortcuts added in your precomputation. In the fifth column, put the average query time in milliseconds (precision: exactly one digit after the dot). 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]].
+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 update heuristic(s). In the fourth column, put the total precomputation time (in minutes ans seconds). In the fifth column, put the total number of shortcuts added in your precomputation. In the sixth column, put the average query time in milliseconds (precision: exactly one digit after the dot). In the seventh 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]], and [[EfficientRoutePlanningSS2012/ContractionResults|Exercise Sheet 6]].
 Line 6:
-||'''Name''' ||'''Dataset'''|| '''precomp time''' || '''#shortcuts''' || '''av. query time'''|| ''' av. SP cost''' || '''Processor / RAM''' ||'''Language''' ||
||Example ||!BaWü || 11min1sec || 111,111 || 1.1ms || 111min11sec ||Intel X5560 @ 2.8Ghz / 96 GB ||C++ ||
+||'''Name''' ||'''Dataset'''|| '''ED update'''|| '''precomp. time''' || '''#shortcuts''' || '''av. query time'''|| ''' av. SP cost''' || '''Processor / RAM''' ||'''Language''' ||
||Example ||!BaWü || lazy+spatial || 11min1sec || 111,111 || 1.1ms || 111min11sec ||Intel X5560 @ 2.8Ghz / 96 GB ||C++ ||
||SE KF ||!BaWü || lazy+neighbour || 1min56sec || 2,352,648 || 1.8ms || 92min31sec ||Intel P8600 @ 2.4Ghz / 4 GB ||C++ ||
||nils ||!BaWü || lazy || 0min60sec || 1,787,945 || - || - ||AMD X2 BE2350 @ 2.1GHz / 4 GB ||C++ ||
||Ant-Cyn ||Saarland || lazy || 0min20sec || 91,527 || 118ms || 27min46sec ||Intel i5-2410M @ 2.3Ghz / 4 GB ||Java ||
||Felix ||Saarland || neighbour || 0min16sec || 62,315 || 33ms || --min--sec ||Intel i5-2410M @ 2.3GHz / 4 GB ||Java ||
||Viktor ||Saarland || lazy+periodic || 1min11sec || 181,677 || 0.5ms || 22min55sec ||Intel T9300 @ 2.5GHz / 6 GB  ||Java ||
||Stefan ||Saarland || lazy+periodic || 0min13sec || 192,085 || 2.0ms || 22min35sec ||Intel 2670QM @ 2.2Ghz / 6 GB  ||Java ||
||SG CB || Saarland || periodic || 0min48sec || 343,730 || --min--sec || --min--sec || Intel T5870 @ 2.0GHz / 4GB || Java ||
||niklas|| Saarland || lazy || 0min08sec|| 208,956 || 0.9ms ||23min10sec || Intel 2410M @ 2.3GHz / 4 GB||C++||
||Diego|| Saarland || lazy || 0min50sec|| 1,438,110 || TODO || TODO || Intel T5450 @ 1.7GHz / 2 GB ||C++||
||Tobias|| Saarland || lazy || 1min19sec || 210,908 || 14.7 ms || 33min11sec || Intel N450 @ 1.66GHz / 2 GB ||C++||