Changeset 356 for anr/task-frontend.tex

Timestamp:

Feb 6, 2011, 2:29:09 PM (14 years ago)

Author:

coach

Message:

1ere Pre-release

File:

• anr/task-frontend.tex (modified) (4 diffs)

anr/task-frontend.tex

@@ -12 +12 @@
 (C/C++) with as few constraints as possible, into a form suitable for
 the HLS tools (i.e. HAS back-end tools of the COACH project). If the 
-target is an ASIP, the frontend has to extract 
+target is an ASIP, the front-end has to extract 
 patterns from the source code and convert them into the definition
 of an extensible processor. If the target is a process network, the
@@ -36 +36 @@
         instructions.  
     \end{livrable}
- 
+% 
  \subtask{Micro-architectural template models for ASIP}
  In this sub-task, we provide micro-architectural template models for the two target
@@ -57 +57 @@
       the different approaches}
     \end{livrable}
-
+%
  \subtask{Automatic parallelization and memory optimization}
-This sub-task aims at providing a source-level optimizer in front the
-HLS back-end tools. The optimizations are threefold:
-\begin{itemize}
-\item Extraction of parallelism in polyhedral loops and conversion
-  into a process network.
-\item Minimization of intra-process local memory
-\item Construction of inter-process FIFOs
-\end{itemize}
-We will design these methods by using polyhedral techniques, as we did
-in the past for pure HPC optimizations. The program model is typically
-regular programs where loop bounds, conditions and array indices are
-affine functions. In a second part, we will extend the program model
-by using conservative approximations.
+ This sub-task aims at providing a source-level optimizer in front the
+ HLS back-end tools. The optimizations are threefold:
+    \begin{itemize}
+    \item Extraction of parallelism in polyhedral loops and conversion
+      into a process network.
+    \item Minimization of intra-process local memory
+    \item Construction of inter-process FIFOs
+    \end{itemize}
+    We will design these methods by using polyhedral techniques, as we did
+    in the past for pure HPC optimizations. The program model is typically
+    regular programs where loop bounds, conditions and array indices are
+    affine functions. In a second part, we will extend the program model
+    by using conservative approximations.
    \begin{livrable}
     \itemV{0}{6}{d}{\Slip}{Method, Preliminary Definition}
@@ -99 +99 @@
       demonstrator \STs.
    \end{livrable}
-
+%
 \end{workpackage}