CM:data:45741e3fbcf4024b:1db78910464c9d05 - Revision history

Gfursin at 13:23, 4 September 2014

2014-09-04T13:23:08Z

Gfursin at 13:21, 4 September 2014

2014-09-04T13:21:32Z

Gfursin at 13:19, 4 September 2014

2014-09-04T13:19:17Z

Gfursin at 13:17, 4 September 2014

2014-09-04T13:17:44Z

Gfursin at 13:14, 4 September 2014

2014-09-04T13:14:52Z

Gfursin at 13:13, 4 September 2014

2014-09-04T13:13:58Z

Gfursin at 13:11, 4 September 2014

2014-09-04T13:11:18Z

Gfursin at 12:57, 4 September 2014

2014-09-04T12:57:52Z

Gfursin at 02:26, 24 August 2014

2014-08-24T02:26:52Z

Gfursin at 17:30, 23 August 2014

2014-08-23T17:30:07Z

@@ Line 96: / Line 96: @@
 def advice(i):
 :if i['usage_scenario']['need_fastest_code']=='yes':
 ::if i['cost']['can_afford_specialized_hardware']=='yes':
@@ Line 129: / Line 130: @@
 ::i['advice']='Solution 9'
 :elif i['usage_scenario']['need_fastest_compilation_and_good_speed']=='yes':
-::i['advice']='X4'
+::i['advice']='X4'<br/>
 return i
 == Notes ==

@@ Line 102: / Line 102: @@
 :::else:
 ::::i['advice']='P4'
 :::else:
-::::if i['resources']['p1']['available']=='yes':
+::::i['advice']='Ask for more resources'
-:::::             if i['resources']['p1']['cores']=='1':
+:elif i['usage_scenario']['need_most_energy_efficient_code']=='yes':
-::::::                if i['cost']['can_afford_auto_tuning']=='yes':
+::if i['cost']['can_afford_specialized_hardware']=='yes':
-:::::::                   if i['dataset']['feature']=='D2':
+:::i['advice']='P4'
-::::::::                      i['advice']='Solution 11'
+::else:
-:::::::                   else:
+:::i['advice']='P2'
-::::::::                      i['advice']='Solution 4'
+:elif i['usage_scenario']['need_cheapest_hardware']=='yes':
-::::::                else:
+::i['advice']='P3'
-:::::::                   i['advice']='Solution 5'
+:elif i['usage_scenario']['need_smallest_code']=='yes':
-:::::             elif i['resources']['p1']['cores']=='2':
+::i['advice']='Solution 9'
-::::::                if i['cost']['can_afford_auto_tuning']=='yes':
+:elif i['usage_scenario']['need_fastest_compilation_and_good_speed']=='yes':
-:::::::                   i['advice']='Solution 7'
+::i['advice']='X4'
-::::::                else:
+return i
-:::::::                   i['advice']='Solution 6'
-::::          else:
-             i['advice']='Ask for more resources'
-    elif i['usage_scenario']['need_most_energy_efficient_code']=='yes':
-       if i['cost']['can_afford_specialized_hardware']=='yes':
-          i['advice']='P4'
-       else:
-          i['advice']='P2'
-    elif i['usage_scenario']['need_cheapest_hardware']=='yes':
-       i['advice']='P3'
-    elif i['usage_scenario']['need_smallest_code']=='yes':
-       i['advice']='Solution 9'
-    elif i['usage_scenario']['need_fastest_compilation_and_good_speed']=='yes':
-       i['advice']='X4'
-    return i
 == Notes ==

@@ Line 95: / Line 95: @@
 == Example of continuosly evolving advice (combination of decision trees and models)<br/> ==
- def advice(i):
+def advice(i):
-:     if i['usage_scenario']['need_fastest_code']=='yes':
+:if i['usage_scenario']['need_fastest_code']=='yes':
-::        if i['cost']['can_afford_specialized_hardware']=='yes':
+::if i['cost']['can_afford_specialized_hardware']=='yes':
-:::           if i['cost']['can_afford_specialized_hardware']=='yes':
+:::if i['cost']['can_afford_specialized_hardware']=='yes':
-::::             i['advice']='S4'
+::::i['advice']='S4'
-:::           else:
+:::else:
-::::              i['advice']='P4'
+::::i['advice']='P4'
-:::        else:
+:::else:
-           if i['resources']['p1']['available']=='yes':
+::::if i['resources']['p1']['available']=='yes':
-              if i['resources']['p1']['cores']=='1':
+:::::             if i['resources']['p1']['cores']=='1':
-                 if i['cost']['can_afford_auto_tuning']=='yes':
+::::::                if i['cost']['can_afford_auto_tuning']=='yes':
-                    if i['dataset']['feature']=='D2':
+:::::::                   if i['dataset']['feature']=='D2':
-                       i['advice']='Solution 11'
+::::::::                      i['advice']='Solution 11'
-                    else:
+:::::::                   else:
-                       i['advice']='Solution 4'
+::::::::                      i['advice']='Solution 4'
-                 else:
+::::::                else:
-                    i['advice']='Solution 5'
+:::::::                   i['advice']='Solution 5'
-              elif i['resources']['p1']['cores']=='2':
+:::::             elif i['resources']['p1']['cores']=='2':
-                 if i['cost']['can_afford_auto_tuning']=='yes':
+::::::                if i['cost']['can_afford_auto_tuning']=='yes':
-                    i['advice']='Solution 7'
+:::::::                   i['advice']='Solution 7'
-                 else:
+::::::                else:
-                    i['advice']='Solution 6'
+:::::::                   i['advice']='Solution 6'
-           else:
+::::          else:
-              i['advice']='Ask for more resources'
+             i['advice']='Ask for more resources'
-     elif i['usage_scenario']['need_most_energy_efficient_code']=='yes':
+    elif i['usage_scenario']['need_most_energy_efficient_code']=='yes':
-        if i['cost']['can_afford_specialized_hardware']=='yes':
+       if i['cost']['can_afford_specialized_hardware']=='yes':
-           i['advice']='P4'
+          i['advice']='P4'
-        else:
+       else:
-           i['advice']='P2'
+          i['advice']='P2'
-     elif i['usage_scenario']['need_cheapest_hardware']=='yes':
+    elif i['usage_scenario']['need_cheapest_hardware']=='yes':
-        i['advice']='P3'
+       i['advice']='P3'
-     elif i['usage_scenario']['need_smallest_code']=='yes':
+    elif i['usage_scenario']['need_smallest_code']=='yes':
-        i['advice']='Solution 9'
+       i['advice']='Solution 9'
-     elif i['usage_scenario']['need_fastest_compilation_and_good_speed']=='yes':
+    elif i['usage_scenario']['need_fastest_compilation_and_good_speed']=='yes':
-        i['advice']='X4'
+       i['advice']='X4'
-     return i
+    return i
 == Notes ==

@@ Line 95: / Line 95: @@
 == Example of continuosly evolving advice (combination of decision trees and models)<br/> ==
   def advice(i):
-     if i['usage_scenario']['need_fastest_code']=='yes':
+:     if i['usage_scenario']['need_fastest_code']=='yes':
-        if i['cost']['can_afford_specialized_hardware']=='yes':
+::        if i['cost']['can_afford_specialized_hardware']=='yes':
-           if i['cost']['can_afford_specialized_hardware']=='yes':
+:::           if i['cost']['can_afford_specialized_hardware']=='yes':
-              i['advice']='S4'
+::::             i['advice']='S4'
-           else:
+:::           else:
-              i['advice']='P4'
+::::              i['advice']='P4'
-        else:
+:::        else:
             if i['resources']['p1']['available']=='yes':
                if i['resources']['p1']['cores']=='1':
@@ Line 132: / Line 131: @@
          i['advice']='X4'
       return i
 == Notes ==

@@ Line 95: / Line 95: @@
 == Example of continuosly evolving advice (combination of decision trees and models)<br/> ==
   def advice(i):
       if i['usage_scenario']['need_fastest_code']=='yes':
@@ Line 130: / Line 131: @@
       elif i['usage_scenario']['need_fastest_compilation_and_good_speed']=='yes':
          i['advice']='X4'
       return i
 == Notes ==

← Older revision		Revision as of 12:57, 4 September 2014
Line 96:		Line 96:

	TBA		TBA
−
−	~~== <br/> ==~~

	== Notes ==		== Notes ==

@@ Line 27: / Line 27: @@
 === Processors ===
 *P1 = Intel Core i5-2540M, 2.60GHz, 2 cores ({{CREF|54cd38490124ef51:425ae4e3483c82e8}})
 *P2 = Qualcomm MSM7625A FFA, ARM Cortex A5, ARMv7, 1 GHz, 1 core({{CREF|54cd38490124ef51:ae17889f40209ae7}})
 *P3 = Allwinner A20 (sun7i), Dual-Core ARM Cortex A7, ARMv7, 1.6GHz, Mali400 GPU, 2 core ({{CREF|54cd38490124ef51:fc020ce2e4d44f3d}})
-*P4 = NVidia Quadro NVS 135M, 16 cores, 400MHz (TBD)
+*P4 = NVidia Quadro NVS 135M, 16 cores, 400MHz, 10Watt, 210 Million transistors (TBD)
 === Processor mode ===

@@ Line 9: / Line 9: @@
 cM repositories online:
-*Part1: [https://github.com/gfursin/cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-1 download repo from github] , [http://c-mind.org/repo/?cm_menu=browse&browse_module_uoa=ctuning.scenario.compiler.optimizations&browse_repo_uoa=cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-1 browse repo at cMind] , [http://c-mind.org/repo/?cm_menu=scenarios&cm_submenu=ctuning_space_visualize&ct_module_uoa=ctuning.scenario.compiler.optimizations&ct_repo_uoa=cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-1 interactive graphs at cMind]
+*Part1: [https://github.com/gfursin/cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-1 download repo from github] , [http://c-mind.org/repo/?cm_menu=browse&browse_module_uoa=ctuning.scenario.compiler.optimizations&browse_repo_uoa=cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-1 browse repo at cMind] , [http://c-mind.org/repo/?cm_menu=scenarios&cm_submenu=ctuning_space_visualize&ct_module_uoa=ctuning.scenario.compiler.optimizations&ct_repo_uoa=cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-1 view nteractive graphs at cMind]
-*Part2: [https://github.com/gfursin/cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-2 download repo from github] , [http://c-mind.org/repo/?cm_menu=browse&browse_module_uoa=ctuning.scenario.compiler.optimizations&browse_repo_uoa=cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-2 browse repo at cMind] , [http://c-mind.org/repo/?cm_menu=scenarios&cm_submenu=ctuning_space_visualize&ct_module_uoa=ctuning.scenario.compiler.optimizations&ct_repo_uoa=cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-2 interactive graphs at cMind]
+*Part2: [https://github.com/gfursin/cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-2 download repo from github] , [http://c-mind.org/repo/?cm_menu=browse&browse_module_uoa=ctuning.scenario.compiler.optimizations&browse_repo_uoa=cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-2 browse repo at cMind] , [http://c-mind.org/repo/?cm_menu=scenarios&cm_submenu=ctuning_space_visualize&ct_module_uoa=ctuning.scenario.compiler.optimizations&ct_repo_uoa=cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-2 view interactive graphs at cMind]
-*Part3: [https://github.com/gfursin/cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-3 download repo from github] , [http://c-mind.org/repo/?cm_menu=browse&browse_module_uoa=ctuning.scenario.compiler.optimizations&browse_repo_uoa=cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-3 browse repo at cMind] , [http://c-mind.org/repo/?cm_menu=scenarios&cm_submenu=ctuning_space_visualize&ct_module_uoa=ctuning.scenario.compiler.optimizations&ct_repo_uoa=cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-3 interactive graphs at cMind]
+*Part3: [https://github.com/gfursin/cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-3 download repo from github] , [http://c-mind.org/repo/?cm_menu=browse&browse_module_uoa=ctuning.scenario.compiler.optimizations&browse_repo_uoa=cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-3 browse repo at cMind] , [http://c-mind.org/repo/?cm_menu=scenarios&cm_submenu=ctuning_space_visualize&ct_module_uoa=ctuning.scenario.compiler.optimizations&ct_repo_uoa=cm-experiments-201408xx-fgg-motivation-compiler-flag-tuning-mess-3 view interactive graphs at cMind]
 == Used artifacts<br/> ==