Changes between Version 40 and Version 41 of Orio

Timestamp:

06/12/08 01:50:41 (15 years ago)

Author:

hartono

Comment:

--

Orio

@@ -192 +192 @@
 So in this example, the transformed AXPY-4 code is compiled using GCC compiler with the -O3 option to activate all its optimizations. The unroll factor values under consideration extends over integers from 1 to 32, inclusively. The AXPY-4 computation is tuned for two distinct problem sizes: N=1K and N=10M. Also, all scalars and arrays involved in the computation must be declared and initialized in the tuning specifications to enable the performance testing driver to empirically execute the optimized code.  It is to be noted that the ''static'' and ''dynamic'' keywords provide guidance to the performance testing driver as it allocates memory space for the declared arrays.
 
-Because of the huge search space, a proper search heuristic becomes a critical component of an empirical tuning system. Hence, in addition to an exhaustive search and a random search, two effective and practical search heuristic strategies have been developed and integrated into the Orio’s search engine. These include the ''Nelder-Mead Simplex'' method and ''Simulated Annealing'' method.
+Due to the huge search space of the parameter values, a proper search heuristic becomes a critical component of an empirical tuning system. Hence, in addition to an exhaustive search and a random search, two effective and practical search heuristic strategies have been developed and integrated into the Orio’s search engine. These heuristics include the ''Nelder-Mead Simplex'' method and ''Simulated Annealing'' method.
 
 ''Under construction''