Changeset 330 for anr/task-frontend.tex
- Timestamp:
- Jan 26, 2011, 7:29:20 PM (14 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
anr/task-frontend.tex
r328 r330 59 59 60 60 \subtask{Automatic parallelization and memory optimization} 61 62 61 This sub-task aims at providing a source-level optimizer in front the 63 HLS back-end tools. The optimization are twofold:62 HLS back-end tools. The optimizations are threefold: 64 63 \begin{itemize} 65 64 \item Extraction of parallelism in polyhedral loops and conversion … … 70 69 We will design these methods by using polyhedral techniques, as we did 71 70 in the past for pure HPC optimizations. The program model is typically 72 regular programs w ith affine loop bound conditions and array index73 functions. In a second part, we will extend the program model by using 74 conservative approximations.71 regular programs where loop bounds, conditions and array indices are 72 affine functions. In a second part, we will extend the program model 73 by using conservative approximations. 75 74 \begin{livrable} 76 75 \itemV{0}{6}{d}{\Slip}{Method, Preliminary Definition} … … 85 84 \itemV{6}{12}{d}{\Slip} {Arrays and FIFO} 86 85 Description and specification of the FIFO construction method 87 and local memory optimization algorithms.86 and the local memory optimization method. 88 87 \itemV{12}{18}{d+x}{\Slip} {Arrays and FIFO} 89 88 Preliminary implementation in the Bee framework. 90 89 Conversion of the input and output of Bee to the \xcoach format. 91 At this step, only memory optimizationswill be available.90 At this step, only local memory optimization will be available. 92 91 \itemL{18}{30}{d+x}{\Slip}{Arrays and FIFO}{10:0:9} 93 92 Final assessment of the method and improved version of the specification.
Note: See TracChangeset
for help on using the changeset viewer.