Differences between revisions 3 and 37 (spanning 34 versions)

Results for Exercise Sheet 2 (Dijkstra results)

Add your row to the table below, following the examples already there. LCC refers to the largest connected components. In columns 4 - 6 enter the averages (= total / number of queries) for the execution time of Dijkstra's algorithm (in seconds, with exactly two digits after the fraction point), number of nodes settled, and cost of the shortest path (in minutes + seconds). If possible, provide the figures for columns 2 - 6 for both Saarland and Ba-Wü (Saarland / Ba-Wü). Last two columns as usual, see the result table for Exercise Sheet 1.

Name	#nodes LCC	#arcs LCC	av. query time	av. #settled nodes	av. SP cost	Processor / RAM	Language
Example	1,111,111 / 11,111,111	1,111,111 / 11,111,111	1.11s / 11.11s	111,111 / 1,111,111	11m01s / 111m11s	Intel X5560 @ 2.8Ghz / 96 GB	C++
SE KF	213,567 / 2,458,230	225,506 / 2,613,338	0.03s / 0.54s	111,639 / 1,210,910	28m46s / 88m15s	Intel P8600 @ 2.4Ghz / 4 GB	C++
Jens S	213,567 / 2,458,230	225,506 / 2,613,338	0.04s / 0.66s	100,854 / 1,231,154	2006m31s / 6830m04s (möööp.TODO!)	AMD X2 250 @ 3.0Ghz / 4GB	C++
viktor	213,567 / 2,458,230	225,506 / 2,613,338	0.15s / 58.44s	111,607 / 1,301,940	22m49s / 80m45s	Intel T9300 @ 2.5GHz / 4 GB	Java
niklas	213,567 / 2,458,230	225,506 / 2,613,338	0.07s / 0.90s	113,016 / 1,140,220	24m02s / 77m17s	Intel 2410M @ 2.3GHz / 4 GB	C++
Stefan W	213,567 / 2,458,230	225,506 / 2,613,338	0.86s / 48.02s	118,024 / 1,245,194	24m12s / 80m18s	Intel 2670QM @ 2.2GHz / 4 GB	Java
K.R	213,567 / TODO	225,506 / TODO	0.17s / TODO	111,055 / TODO	22m36s / TODO	Intel M430 @ 2.3Ghz / 4 GB	Java
nils	213,567 / 2,458,230	225,506 / 2,613,338	0.10s / 0.71s	110,698 / 1,267,278	22m42s / 80m26s	AMD X2 BE2350 @ 2.1GHz / 4 GB	C++
Felix	213,567 / TODO	225,508 / TODO	0.14s / TODO	99,182 / TODO	??? / TODO	Intel i5-2410M @ 2.3GHz / 4 GB	Java

$/!\$ Edit conflict - other version:

Tobias	213,567 /	225,506 /	0.07s /	107,832 /	2m50s /	Intel N450 @ 1,7GHz / 2 GB	C++
CB SG	213,567 / TODO	227,826 / TODO	0.37s / TODO	TODO / TODO	TODO / TODO	Intel U4100 @ 1.3GHz / 4 GB	Java

$/!\$ Edit conflict - your version:

Tobias	213,567 / 1,102,453	225,506 / 1,163,108	0.07s / 0,33s	107,832 / 536,537	2m50s / 65m2s	Intel N450 @ 1,66GHz / 2 GB	C++
CB SG	213,567 / TODO	227,826 / TODO	0.37s / TODO	TODO / TODO	TODO / TODO	Intel U4100 @ 1.3GHz / 4 GB	Java

$/!\$ End of edit conflict

-  ⇤ ← Revision 3 as of 2012-05-04 17:59:05 → 
  Size: 976
  Editor: Hannah Bast
  Comment:
+   ← Revision 37 as of 2012-05-08 23:05:43 → ⇥
  Size: 2787
  Editor: HSI-KBW-085-216-106-124
  Comment: bw ergänzung
-Deletions are marked like this.
+Additions are marked like this.
 Line 2:
+= Results for Exercise Sheet 2 (Dijkstra results) =
Add your row to the table below, following the examples already there. LCC refers to the largest connected components. In columns 4 - 6 enter the averages (= total / number of queries) for the execution time of Dijkstra's algorithm (__in seconds, with exactly two digits after the fraction point__), number of nodes settled, and cost of the shortest path (__in minutes + seconds__). If possible, provide the figures for columns 2 - 6 for both Saarland and Ba-Wü (Saarland / Ba-Wü). Last two columns as usual, see the [[EfficientRoutePlanningSS2012/ReadOsmResults|result table for Exercise Sheet 1]].
||'''Name''' ||'''#nodes LCC''' ||'''#arcs LCC''' ||'''av. query time''' ||'''av. #settled nodes''' ||'''av. SP cost''' ||'''Processor / RAM''' ||'''Language''' ||
||Example ||1,111,111 / 11,111,111 ||1,111,111 / 11,111,111 ||1.11s / 11.11s ||111,111 / 1,111,111 ||11m01s / 111m11s ||Intel X5560 @ 2.8Ghz / 96 GB ||C++ ||
||SE KF ||213,567 / 2,458,230 ||225,506 / 2,613,338 ||0.03s / 0.54s ||111,639 / 1,210,910 ||28m46s / 88m15s ||Intel P8600 @ 2.4Ghz / 4 GB ||C++ ||
||Jens S ||213,567 / 2,458,230 ||225,506 / 2,613,338 ||0.04s / 0.66s ||100,854 /  1,231,154 ||2006m31s / 6830m04s (möööp.TODO!) ||AMD X2 250 @ 3.0Ghz / 4GB ||C++ ||
||viktor ||213,567 / 2,458,230 ||225,506 / 2,613,338 ||0.15s / 58.44s ||111,607 / 1,301,940 ||22m49s / 80m45s ||Intel T9300 @ 2.5GHz / 4 GB ||Java ||
||niklas ||213,567 / 2,458,230 ||225,506 / 2,613,338 ||0.07s / 0.90s ||113,016 / 1,140,220 ||24m02s / 77m17s ||Intel 2410M @ 2.3GHz / 4 GB ||C++ ||
||Stefan W ||213,567 / 2,458,230 ||225,506 / 2,613,338 ||0.86s / 48.02s ||118,024 / 1,245,194 ||24m12s / 80m18s ||Intel 2670QM @ 2.2GHz / 4 GB ||Java ||
||K.R||213,567 / TODO ||225,506 / TODO ||0.17s / TODO||111,055 / TODO||22m36s / TODO ||Intel M430 @ 2.3Ghz / 4 GB||Java||
||nils||213,567 / 2,458,230||225,506 / 2,613,338||0.10s / 0.71s||110,698 / 1,267,278||22m42s / 80m26s||AMD X2 BE2350 @ 2.1GHz / 4 GB||C++||
||Felix||213,567 / TODO||225,508 / TODO||0.14s / TODO||99,182 / TODO||??? / TODO||Intel i5-2410M @ 2.3GHz / 4 GB||Java||
-Line 3:
+Line 15:
-= Results for Exercise Sheet 1 (OSM file -> graph) =
+---- /!\ '''Edit conflict - other version:''' ----
||Tobias||213,567 / ||225,506 / ||0.07s / ||107,832 / ||2m50s / ||Intel N450 @ 1,7GHz / 2 GB||C++||
||CB SG||213,567 / TODO||227,826 / TODO||0.37s / TODO||TODO / TODO||TODO / TODO||Intel U4100 @ 1.3GHz / 4 GB||Java||
-Line 5:
+Line 19:
-Add your row to the table below, following the examples already there. LCC refers to the largest connected components. In columns 4 - 6 enter the averages (= total / number of queries) for the execution time of Dijkstra's algorithm in seconds (precision: two digits after the fraction point), number of nodes settled, and cost of the shortest path in seconds. If possible, provide the figures for columns 2 - 6 for both Saarland and !BaWü (separately). Last two columns as usual, see the [[EfficientRoutePlanningSS2012/ReadOsmResults|result table for Exercise Sheet 1]].
+---- /!\ '''Edit conflict - your version:''' ----
||Tobias||213,567 / 1,102,453||225,506 / 1,163,108 || 0.07s / 0,33s ||107,832 / 536,537 ||2m50s / 65m2s||Intel N450 @ 1,66GHz / 2 GB||C++||
||CB SG||213,567 / TODO||227,826 / TODO||0.37s / TODO||TODO / TODO||TODO / TODO||Intel U4100 @ 1.3GHz / 4 GB||Java||
-Line 7:
+Line 23:
-||'''Name''' ||'''#nodes LCC''' ||'''#arcs LCC''' ||'''av. query time'''||'''av. #settled nodes'''||'''av. SP cost'''||'''Processor / RAM''' ||'''Language''' ||
|| Example ||1,111,111 / 11,111,111 ||1,111,111 / 11,111,111||1.11 / 11.11 || 111,111 / 1,111,111|| 11,1111 / 111,111||Intel X5560 @ 2.8Ghz / 96 GB || C++||
+---- /!\ '''End of edit conflict''' ----