1.1 Binary file 0__Papers/Holistic_Model/Perf_Tune/latex/Holistic_Perf_Tuning.pdf has changed

     2.1 --- a/0__Papers/Holistic_Model/Perf_Tune/latex/Holistic_Perf_Tuning.tex	Wed May 16 06:32:02 2012 -0700
     2.2 +++ b/0__Papers/Holistic_Model/Perf_Tune/latex/Holistic_Perf_Tuning.tex	Wed May 16 15:38:44 2012 +0200
     2.3 @@ -435,7 +435,7 @@
     2.4  A second visualization, seen in Figure X, depicts the constraints on the scheduling decisions, which limit the choices the runtime is allowed to make. We call this the Unit \& Constraint Collection, or UCC. This shows only application-derived information. 
     2.5  
     2.6  \subsection{Walk through}
     2.7 -After functional debugging, the first run produces the visualization seen in Fig \ref{fig:figure1}. This is what we refer to as a scheduling consequence graph. It depicts all the scheduling operations performed by the runtime, along with the consequent usage of the cores. 
     2.8 +After functional debugging, the first run produces the visualization seen in Fig \ref{story}. This is what we refer to as a scheduling consequence graph. It depicts all the scheduling operations performed by the runtime, along with the consequent usage of the cores. 
     2.9  
    2.10  Each column is associated with one core. 
    2.11  A blue vertical block represents the time the core spends doing the actual work of one work-unit, the height being proportional to the number of cycles taken for execution. Just above each, in light blue, is the runtime overhead spent on that work-unit, which can be broken into pieces representing acquisition of the lock on the shared semantic state, time spent performing the semantics of the parallelism construct, time spent deciding which ready task to execute next, and time spent switching from virtual processor, to the runtime, and back. 
    2.12 @@ -878,4 +878,4 @@
    2.13  %% EOF ieeepes_skel.tex
    2.14  %%----------------------------------------------------------------------
    2.15  
    2.16 - destroying virtutal processors, and three kinds of send-receive pairs. The 
    2.17 \ No newline at end of file
    2.18 + destroying virtutal processors, and three kinds of send-receive pairs. The