Changeset 300 for anr


Ignore:
Timestamp:
Dec 20, 2010, 2:20:29 AM (14 years ago)
Author:
coach
Message:

1) Ajout des parters entre () pour les sous taches.
2) Ajout des liens sur les livrables dans les taches.
3) Sorties d'un point csv
4) Regrouppement des livrables evaluation
5) Ajout du D840
6) MAJ des effort de l'UPMC

Location:
anr
Files:
10 edited

Legend:

Unmodified
Added
Removed

  • anr/Makefile

    r291 r300  
    3838
    3939anr.pdf: $(SOURCES) gantt
    40         touch gantt1.tex gantt2.tex  $(TABLES)
     40        mkdir -p tmp
     41        touch gantt.tex gantt1.tex gantt2.tex  $(TABLES)
    4142        @echo "Generating pdf file"
    4243        @pdflatex anr.tex || true
    … …  
    5354
    5455clean:
    55         rm -f $(TABLES) anr.aux gantt1.tex gantt2.tex anr.pdf anr.gantt
     56        rm -f $(TABLES) anr.aux gantt.tex gantt1.tex gantt2.tex anr.pdf anr.gantt

  • anr/anr.sty

    r299 r300  
    142142    \global\advance\subtaskcnt1
    143143    \def\subtaskname{S\taskname-\the\subtaskcnt}%
    144     \item[\subtaskname: ##1]\mbox{}\\}}
    145 {\end{description}}
     144    \item[\subtaskname: ##1]%
     145    \IfFileExists{tmp/st\the\taskcnt-\the\subtaskcnt-partner.tex}%
     146      {(\input{tmp/st\the\taskcnt-\the\subtaskcnt-partner.tex})}%
     147      {\message{SKIPPING tmp/st\the\taskcnt-\the\subtaskcnt-partner.tex files}}%
     148  \mbox{}\\%
     149  {%
     150    \let\xcoach\relax%
     151    \let\xcoachplus\relax%
     152    \let\irisa\relax    \let\Sirisa\relax%
     153    \let\lip\relax      \let\Slip\relax%
     154    \let\tima\relax     \let\Stima\relax%
     155    \let\ubs\relax      \let\Subs\relax%
     156    \let\upmc\relax     \let\Supmc\relax%
     157    \let\altera\relax   \let\Saltera\relax%
     158    \let\bull\relax     \let\Sbull\relax%
     159    \let\thales\relax   \let\Sthales\relax%
     160    \let\mds\relax      \let\Smds\relax%
     161    \let\xilinx\relax%
     162    \immediate\write\ganttdata{%
     163        STN=\the\taskcnt\space\the\subtaskcnt\space##1
     164    }%
     165 }}%
     166}{%
     167  \end{description}}
    146168
    147169%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
    … …  
    192214    \def\vers{V\the\verscnt}
    193215    \global\edef\name{D\the\taskcnt\the\subtaskcnt\the\livrablecnt-\vers}%
     216    \hypertarget{\name}{}%
    194217    \writeganttinfo{##1}{##2}{none}{##4}{##3}{##5}
    195218    \\\hline
    … …  
    217240    \def\vers{VF}
    218241    \global\edef\name{D\the\taskcnt\the\subtaskcnt\the\livrablecnt-\vers}%
     242    \hypertarget{\name}{}%
     243    \hypertarget{\expandafter\@@novers\name\eoa}{}%
    219244    \writeganttinfo{##1}{##2}{##6}{##4}{##3}{##5}
    220245    \\\hline

  • anr/gantt.l

    r296 r300  
    4040    0
    4141};
     42char* subtask_names[20][20];
     43char* get_subtask_name(int tn, int stn)
     44{
     45    char* ret=subtask_names[tn][stn];
     46    if (ret==0)  {
     47        fprintf(stderr,"ERROR: no name found for st%d-%d sub-task.\n",tn,stn);
     48        return "";
     49    } else
     50        return ret;
     51}
     52
    4253struct partner_def { char *key, *name, *fnfull, *fnshort; } partner_table[] = {
    4354    { "UNKNOW" ,"relax"  ,0                             ,0                        },
    … …  
    242253        milestones[i] = atoi(yytext+3);
    243254    }
     255STN=.*   {
     256        int nb,tn, stn;
     257        char tmp[1000];
     258        nb=sscanf(yytext+4,"%d%d%s",&tn,&stn,tmp);
     259        if ( nb==3 && 0<=tn && tn<10 && 0<=stn && stn<10 ) {
     260            char* p =strstr(yytext+4,tmp);
     261            subtask_names[tn][stn]=strdup(p);
     262        } else {
     263            fprintf(stderr, "bad formated ST rule (ignored): %s.\n",yytext);
     264        }
     265}
    244266BM=[0-9]+ { bm=atoi(yytext+3); }
    245267EM=[0-9]+ { em=atoi(yytext+3); }
    … …  
    725747                sum2 = lcurr->hman[1]; sum +=sum2;
    726748                sum3 = lcurr->hman[2]; sum +=sum3;
    727                 char label[1000],title[1000];
     749                char label_lnk[1000],label[1000],title[1000];
    728750                gen_label_base(label,leader);
     751                sprintf(label_lnk,"\\hyperlink{%s}{%s}",label,label);
    729752                sprintf(title,"\\resstablestyletitle{%s}",leader->title);
    730753                fprintf(curr->os,"%s & %s & %2.1f & %2.1f & %2.1f & %2.1f \\\\\\hline\n",
    731                    label,title,sum1,sum2,sum3,sum);
     754                   label_lnk,title,sum1,sum2,sum3,sum);
    732755                an1 += sum1 ; tsk1 += sum1 ;
    733756                an2 += sum2 ; tsk2 += sum2 ;
    … …  
    818841                an  += sum  ; tsk  += sum  ;
    819842                newlineadded=0;
    820                 char label[1000];
    821                 gen_label_base(label,leader);
    822843            }
    823844        }
    … …  
    886907            if ( l==0 ) break;
    887908            if ( l->leader==0 ) continue;
    888             char label[1000],resp[100],date[100],kind[100],desc[1000];
     909            char label_lnk[1000],label[1000],resp[100],date[100],kind[100],desc[1000];
    889910            gen_label_full(label,l);
     911            sprintf(label_lnk,"\\hyperlink{%s}{%s}",label,label);
    890912            sprintf(resp,"\\S%s",partner_table[l->partner].key);
    891913            sprintf(date,"\\makebox[2mm][r]{%d}",l->em);
    … …  
    902924                sprintf(desc, "\\\\\\cline{1-4}\n");
    903925
    904              fprintf(curr->os,"%-15s", label);
     926             fprintf(curr->os,"%-15s", label_lnk);
    905927             fprintf(curr->os," & %-10s", resp);
    906928             fprintf(curr->os," & %-30s", date);
    … …  
    913935}
    914936
    915 #if 1
    916937void do_effort_par_livrable(char* filename,int from_task, int to_task)
    917938{
    … …  
    919940    if ( (curr->os=fopen(filename,"w"))==0 ) {
    920941        fprintf(stderr,"can not open %s file for writing.\n",filename);
    921         fprintf(stderr,"generation of %s partner table is skipped.\n",filename);
     942        fprintf(stderr,"generation of %s file is skipped.\n",filename);
    922943        return;
    923944    }
    … …  
    953974                sum2 = lcurr->hman[1]; sum +=sum2;
    954975                sum3 = lcurr->hman[2]; sum +=sum3;
    955                 char label[1000],title[1000];
     976                char label_lnk[1000],label[1000],title[1000];
    956977                gen_label_base(label,lcurr);
     978                sprintf(label_lnk,"\\hyperlink{%s}{%s}",label,label);
    957979                sprintf(title,"\\resstablestyletitle{%s}",top->title);
    958980                fprintf(curr->os,"%10s & %50s & %10s & %2.1f & %2.1f & %2.1f & %2.1f \\\\\\hline\n",
    959                    linenb==0 ? label : "",
     981                   linenb==0 ? label_lnk : "",
    960982                   linenb==0 ? title : "",
    961983                   partner_table[lcurr->partner].key,
    … …  
    9801002                char title[1000];
    9811003                sprintf(name,"st%d-%d",task_n,subtask_n);
    982                 sprintf(title,"\\resstablestyletitle{%s}","");
     1004                sprintf(title,"\\resstablestyletitle{%s}",get_subtask_name(task_n,subtask_n));
    9831005                fprintf(curr->os,"%10s & %50s & %10s & %2.1f & %2.1f & %2.1f & %2.1f \\\\\\hline\n",
    9841006                    name,title,"total",st_sum1,st_sum2,st_sum3,st_sum);
    … …  
    9991021    curr->os=0;
    10001022}
     1023
     1024void do_partner_by_subtask()
     1025{
     1026    char filename[2000];
     1027    int tn,stn,dn,partner;
     1028    for (tn=0 ; tn<T_MAX ; tn++) {
     1029        int livrablenb=0,subtasknb=0;
     1030        int task_n,subtask_n;
     1031        double  t_sum1=0, t_sum2=0, t_sum3=0, t_sum=0;
     1032        double st_sum1=0,st_sum2=0,st_sum3=0,st_sum=0;
     1033        if (curr->ls[tn][0][0][0]==0) break;
     1034        for (stn=0; stn<S_MAX; stn++) {
     1035          int parts[100]; memset(parts,0,sizeof(parts));
     1036          int partnb=0;
     1037          for (dn=0; dn<D_MAX; dn++) {
     1038            int linenb = 0;
     1039            Tlivrable* top=curr->ls[tn][stn][dn][0];
     1040            if ( top==0 ) break;
     1041            double liv1=0,liv2=0,liv3=0,liv=0;
     1042            for (partner=1 ; partner_table[partner].key!=0 ; partner+=1) {
     1043                Tlivrable *lcurr,*leader;
     1044                if ( (lcurr=do_partner_table_getLivrable(&leader,top,partner))==0 ) {
     1045                    continue;
     1046                }
     1047                parts[partner]=1; partnb+=1;
     1048                task_n = top->tn;
     1049                subtask_n = top->stn;
     1050            }
     1051          }
     1052          if (partnb==0) continue;
     1053          sprintf(filename,"tmp/st%d-%d-partner.tex",task_n,subtask_n);
     1054          if ( (curr->os=fopen(filename,"w"))==0 ) {
     1055              fprintf(stderr,"can not open %s file for writing.\n",filename);
     1056              fprintf(stderr,"generation of %s file is skipped.\n",filename);
     1057              continue;
     1058          }
     1059          for ( partner=1 ; partner_table[partner].key!=0 ; partner+=1) {
     1060            if ( parts[partner]==0) continue;
     1061            fprintf(curr->os,"\\S%s\n",partner_table[partner].key);
     1062          }
     1063          fclose(curr->os);
     1064          curr->os=0;
     1065       }
     1066    }
     1067}
     1068
     1069#if 1
     1070void do_effort_par_livrable_xls(char* filename,int from_task, int to_task)
     1071{
     1072    //struct partner_def* part;
     1073    if ( (curr->os=fopen(filename,"w"))==0 ) {
     1074        fprintf(stderr,"can not open %s file for writing.\n",filename);
     1075        fprintf(stderr,"generation of %s file is skipped.\n",filename);
     1076        return;
     1077    }
     1078    int tn,stn,dn,partner;
     1079    fprintf(curr->os,"\"task\";\"sub-task\";\"delivrable\";");
     1080    fprintf(curr->os,"\"cumul\";;;;");
     1081    for ( partner=1 ; partner_table[partner].key!=0 ; partner+=1) {
     1082        fprintf(curr->os,"\"%s\";;;;",partner_table[partner].key);
     1083    }
     1084    fprintf(curr->os,"\"description\";\n");
     1085    fprintf(curr->os,";;;");
     1086    fprintf(curr->os,"\"an 1\";\"an 2\";\"an 3\";\"sum\";");
     1087    for ( partner=1 ; partner_table[partner].key!=0 ; partner+=1) {
     1088        fprintf(curr->os,"\"an 1\";\"an 2\";\"an 3\";\"sum\";");
     1089    }
     1090    fprintf(curr->os,";\n");
     1091    double an1=0,an2=0,an3=0,anA=0;
     1092    double an1p[100], an2p[100], an3p[100], anAp[100];
     1093    memset(an1p,0,sizeof(an1p)); memset(an2p,0,sizeof(an2p));
     1094    memset(an3p,0,sizeof(an3p)); memset(anAp,0,sizeof(anAp));
     1095    for (tn=0 ; tn<T_MAX ; tn++) {
     1096        int livrablenb=0,subtasknb=0;
     1097        int task_n,subtask_n;
     1098        double  t_sum1=0,     t_sum2=0,     t_sum3=0,     t_sumA=0;
     1099        double  t_sum1p[100], t_sum2p[100], t_sum3p[100], t_sumAp[100];
     1100        memset(t_sum1p,0,sizeof(t_sum1p)); memset(t_sum2p,0,sizeof(t_sum2p));
     1101        memset(t_sum3p,0,sizeof(t_sum3p)); memset(t_sumAp,0,sizeof(t_sumAp));
     1102        if (curr->ls[tn][0][0][0]==0) break;
     1103        for (stn=0; stn<S_MAX; stn++) {
     1104          double st_sum1=0,     st_sum2=0,     st_sum3=0,     st_sumA=0;
     1105          double st_sum1p[100], st_sum2p[100], st_sum3p[100], st_sumAp[100];
     1106          memset(st_sum1p,0,sizeof(st_sum1p)); memset(st_sum2p,0,sizeof(st_sum2p));
     1107          memset(st_sum3p,0,sizeof(st_sum3p)); memset(st_sumAp,0,sizeof(st_sumAp));
     1108         
     1109          livrablenb=0;
     1110          for (dn=0; dn<D_MAX; dn++) {
     1111            int linenb = 0;
     1112            Tlivrable* top=curr->ls[tn][stn][dn][0];
     1113            if ( top==0 ) break;
     1114            if ( !( from_task<=top->tn &&  top->tn<=to_task ) ) break;
     1115            double liv1=0,liv2=0,liv3=0,liv=0;
     1116            char label_lnk[1000],label[1000],title[1000];
     1117            gen_label_base(label,top);
     1118            sprintf(label_lnk,"\\hyperlink{%s}{%s}",label,label);
     1119            sprintf(title,"%s",top->title);
     1120            double sum1p[20], sum2p[20], sum3p[20], sumAp[20];
     1121            memset(sum1p,0,sizeof(sum1p)); memset(sum2p,0,sizeof(sum2p));
     1122            memset(sum3p,0,sizeof(sum3p)); memset(sumAp,0,sizeof(sumAp));
     1123            task_n=top->tn;
     1124            subtask_n=top->stn;
     1125            for (partner=1 ; partner_table[partner].key!=0 ; partner+=1) {
     1126                Tlivrable *lcurr,*leader;
     1127                if ( (lcurr=do_partner_table_getLivrable(&leader,top,partner))==0 )
     1128                    continue;
     1129                double sum1,sum2,sum3,sum=0;
     1130                sum1 = lcurr->hman[0]; sum +=sum1;
     1131                sum2 = lcurr->hman[1]; sum +=sum2;
     1132                sum3 = lcurr->hman[2]; sum +=sum3;
     1133                linenb += 1;
     1134                liv1 += sum1 ; st_sum1 += sum1 ; t_sum1 += sum1 ; an1 += sum1 ;
     1135                liv2 += sum2 ; st_sum2 += sum2 ; t_sum2 += sum2 ; an2 += sum2 ;
     1136                liv3 += sum3 ; st_sum3 += sum3 ; t_sum3 += sum3 ; an3 += sum3 ;
     1137                liv  += sum  ; st_sumA += sum  ; t_sumA += sum  ; anA += sum  ;
     1138                sum1p[partner] += sum1 ; st_sum1p[partner] += sum1 ; t_sum1p[partner] += sum1 ; an1p[partner] += sum1 ;
     1139                sum2p[partner] += sum2 ; st_sum2p[partner] += sum2 ; t_sum2p[partner] += sum2 ; an2p[partner] += sum2 ;
     1140                sum3p[partner] += sum3 ; st_sum3p[partner] += sum3 ; t_sum3p[partner] += sum3 ; an3p[partner] += sum3 ;
     1141                sumAp[partner] += sum  ; st_sumAp[partner] += sum  ; t_sumAp[partner] += sum  ; anAp[partner] += sum  ;
     1142            }
     1143            if (linenb>=1) {
     1144                livrablenb+=1;
     1145                fprintf(curr->os,";;\"%s\";",label);
     1146                fprintf(curr->os,"%2.1f;%2.1f;%2.1f;%2.1f;",liv1,liv2,liv3,liv);
     1147                for ( partner=1 ; partner_table[partner].key!=0 ; partner+=1) {
     1148                    fprintf(curr->os,"%2.1f;%2.1f;%2.1f;%2.1f;",
     1149                        sum1p[partner],sum2p[partner],sum3p[partner],sumAp[partner]);
     1150                }
     1151                fprintf(curr->os,"\"%s\";",title);
     1152                fprintf(curr->os,"\n");
     1153            }
     1154          }
     1155          if ( livrablenb>0) {
     1156                subtasknb += 1;
     1157                char name[100];
     1158                char title[1000];
     1159                sprintf(name,"st%d-%d",task_n,subtask_n);
     1160                sprintf(title,"%s",get_subtask_name(task_n,subtask_n));
     1161                fprintf(curr->os,";\"%s\";;",name);
     1162                fprintf(curr->os,"%2.1f;%2.1f;%2.1f;%2.1f;",st_sum1,st_sum2,st_sum3,st_sumA);
     1163                for ( partner=1 ; partner_table[partner].key!=0 ; partner+=1) {
     1164                    fprintf(curr->os,"%2.1f;%2.1f;%2.1f;%2.1f;",
     1165                        st_sum1p[partner],st_sum2p[partner],st_sum3p[partner],st_sumAp[partner]);
     1166                }
     1167                fprintf(curr->os,"\"%s\";",title);
     1168                fprintf(curr->os,"\n");
     1169          }
     1170       }
     1171       if ( subtasknb>0 ) {
     1172                char name[100];
     1173                char title[1000];
     1174                sprintf(name,"task-%d",task_n);
     1175                sprintf(title,"%s",task_names[task_n]);
     1176                fprintf(curr->os,"\"%s\";;;",name);
     1177                fprintf(curr->os,"%2.1f;%2.1f;%2.1f;%2.1f;",t_sum1,t_sum2,t_sum3,t_sumA);
     1178                for ( partner=1 ; partner_table[partner].key!=0 ; partner+=1) {
     1179                    fprintf(curr->os,"%2.1f;%2.1f;%2.1f;%2.1f;",
     1180                        t_sum1p[partner],t_sum2p[partner],t_sum3p[partner],t_sumAp[partner]);
     1181                }
     1182                fprintf(curr->os,"\"%s\";",title);
     1183                fprintf(curr->os,"\n");
     1184       }
     1185    }
     1186                char name[100];
     1187                char title[1000];
     1188                sprintf(name,"total");
     1189                sprintf(title,"%s","");
     1190                fprintf(curr->os,"\"%s\";;;",name);
     1191                fprintf(curr->os,"%2.1f;%2.1f;%2.1f;%2.1f;",an1,an2,an3,anA);
     1192                for ( partner=1 ; partner_table[partner].key!=0 ; partner+=1) {
     1193                    fprintf(curr->os,"%2.1f;%2.1f;%2.1f;%2.1f;",
     1194                        an1p[partner],an2p[partner],an3p[partner],anAp[partner]);
     1195                }
     1196                fprintf(curr->os,"\"%s\";",title);
     1197                fprintf(curr->os,"\n");
     1198    fclose(curr->os);
     1199    curr->os=0;
     1200}
    10011201#endif
    10021202
    … …  
    10301230    prepare2(curr);
    10311231    prepare3(curr);
    1032     do_livrable_tables(40);
     1232    do_livrable_tables(44);
    10331233
    10341234    curr = data_new(0,0);
    … …  
    10401240    do_effort_par_livrable("effort-par-livrable-2.tex",4,7);
    10411241    do_effort_par_livrable("effort-par-livrable-3.tex",8,8);
     1242    do_effort_par_livrable_xls("tmp/effort-par-livrable.csv",1,8);
     1243
     1244    curr = data_new(0,0);
     1245    prepare0(curr);
     1246    prepare1(curr);
     1247    prepare2(curr);
     1248    prepare3(curr);
     1249    do_partner_by_subtask();
    10421250    return 0;
    10431251}

  • anr/section-project-task-schedule.tex

    r295 r300  
    1515\definecolor{gtcMilestone}{rgb}{0.9,0.4,0.4}
    1616\immediate\write\ganttdata{ML=6 ML=12 ML=18 ML=24}
    17 \def\ganttlabelstyle#1{\begin{small}#1\end{small}}
     17%\def\ganttlabelstyle#1{\begin{small}#1\end{small}}
     18\def\ganttlabelstyle#1{\begin{small}\hyperlink{#1}{#1}\end{small}}
    1819\def\gantttitlestyle#1{\begin{scriptsize}\textit{#1}\end{scriptsize}}
    1920
    2021\begin{figure}\leavevmode\center
     22\hypersetup{
     23    %backref=true,
     24    %pagebackref=true,
     25    %hyperindex=true,
     26    colorlinks=true, %colorise les liens
     27    breaklinks=true, %permet le retour à la ligne dans les lien
     28    urlcolor= blue,  %couleur des hyperliens
     29    linkcolor= black  %couleur des liens internes
     30}
    2131\hspace*{-.6cm}
    2232\input{gantt.tex}

  • anr/task-backbone.tex

    r298 r300  
    4545            Magillem and the core engine.
    4646        \end{description}
    47     \itemL{6}{12}{d}{\Supmc}{Use model specification}{3:0:0}
     47    \itemL{6}{12}{d}{\Supmc}{Use model specification}{2:0:0}
    4848        \setMacroInAuxFile{useModelSpecification}
    4949        The final version of the Use model specification enhanced
    5050        with the feed-backs of the demonstrator \STs.
    51         \OtherPartner{0}{12}{\Slip}   {2:0:0}
    52         \OtherPartner{0}{12}{\Sirisa} {2:0:0}
    53         \OtherPartner{0}{12}{\Stima}  {3:0:0}
    54         \OtherPartner{0}{12}{\Subs}   {3:0:0}
    55         \OtherPartner{0}{12}{\Sbull}  {2:0:0}
    56         \OtherPartner{0}{12}{\Sthales}{2:0:0}
     51        \OtherPartner{0}{12}{\Slip}   {1:0:0}
     52        \OtherPartner{0}{12}{\Sirisa} {1:0:0}
     53        \OtherPartner{0}{12}{\Stima}  {2:0:0}
     54        \OtherPartner{0}{12}{\Subs}   {2:0:0}
     55        \OtherPartner{0}{12}{\Sbull}  {1:0:0}
     56        \OtherPartner{0}{12}{\Sthales}{1:0:0}
    5757        \OtherPartner{0}{12}{\Smds}   {2:0:0}
    5858    \end{livrable}
    … …  
    8080        developers of HAS tools suggested.
    8181    \itemL{12}{18}{d+x}{\Slip}{\xcoach format specification}{7:3:0}
    82         \OtherPartner{0}{18}{\Supmc}  {.5:.5:0}
    83         \OtherPartner{0}{18}{\Stima}  {.5:.5:0}
     82        \OtherPartner{0}{18}{\Supmc}  {.5:0:0}
     83        \OtherPartner{0}{18}{\Stima}  {.5:0:0}
    8484        \setMacroInAuxFile{specXcoachDoc}
    8585        Last release of XML specification of the \xcoach format enhanced with
    … …  
    101101        The first release of the software tool X2SC  that translates \xcoachplus
    102102        description to CABA and TLM-DT SystemC module.
    103     \itemL{18}{24}{x}{\Supmc}{X2SC tool}{0:2:0}
     103    \itemL{18}{24}{x}{\Supmc}{X2SC tool}{0:1.5:0}
    104104        \setMacroInAuxFile{specXcoachToSystemC}
    105105        Final release of the former software (\specXcoachToSystemCI).

  • anr/task-backend.tex

    r295 r300  
    4141    \itemV{18}{24}{x}{\Supmc}{UGH integration}
    4242        UGH release that writes \xcoachplus format.
    43     \itemL{24}{36}{x}{\Stima}{UGH integration}{12:4:3}
    44         \OtherPartner{0}{12}{\Supmc}{1:6:3}
     43    \itemL{24}{36}{x}{\Stima}{UGH integration}{3:3:1}
     44        \OtherPartner{0}{12}{\Supmc}{1:3:1}
    4545        UGH release taking into account demonstrator's feedback.
    4646%
    … …  
    7070    \itemV{12}{24}{x}{\Supmc}{Frequency calibration}
    7171        A VHDL description of hardware added to the coprocessor to enable the calibration.
    72     \itemL{24}{33}{x}{\Supmc}{Frequency calibration}{2:.5:3.5}
     72    \itemL{24}{33}{x}{\Supmc}{Frequency calibration}{1:1:4}
    7373        \setMacroInAuxFile{freqCalibrationVhdl}
    7474        The frequency calibration software consists of a driver in the FPGA-SoC operating

  • anr/task-csg.tex

    r298 r300  
    2626        the connection of the coprocessors on the platform bus.
    2727    \begin{livrable}
    28     \itemL{9}{18}{h}{\Stima}{HPC hardware \xilinx}{2:7:0}
     28    \itemL{18}{30}{h}{\Stima}{HPC hardware \xilinx}{0:2:5}
    2929        \setMacroInAuxFile{hpcPlbBridge}
    3030        The synthesizable VHDL description of a PLB/VCI bridge.
    31     \itemL{9}{18}{h}{\Supmc}{HPC hardware \altera}{2:7:0}
     31    \itemL{18}{30}{h}{\Supmc}{HPC hardware \altera}{0:2:5}
    3232        \setMacroInAuxFile{hpcAvalonBridge}
    3333        The synthesizable VHDL description of an AVALON/VCI bridge.
    … …  
    4444        The drivers required for the second CSG milestone.
    4545    \itemL{18}{33}{x}{\Stima}{DNA OS drivers for SoCLib}{6:2:2}
    46         \OtherPartner{6}{33}{\Supmc}  {2:1:1}
     46        \OtherPartner{6}{33}{\Supmc}  {.5:.5:.5}
    4747        \mustbecompleted{TIMA : ajouter des précisions sur le travail et ce
    4848        que fait upmc}
    4949        Final release of the DNA OS drivers.
    50     \itemL{6}{18}{x}{\Stima}{Driver ports}{3:1:0}
     50    \itemL{12}{18}{x}{\Stima}{Driver ports}{0:2:0}
     51        \OtherPartner{6}{33}{\Supmc}  {0:2:0}
    5152    \mustbecompleted{TIMA: tima sur Microblaze, UPMC sur Nios}
    5253        Porting of DNA OS on the NIOS2 and MICROBLAZE processors.
    … …  
    6465        This release extends CSG to FPGA-SoC generation for the \xilinx and
    6566                \altera architectural template.
    66     \itemL{24}{36}{x}{\Supmc}{CSG tool}{6:5.5:5.5}
     67    \itemL{24}{36}{x}{\Supmc}{CSG tool}{5:3:2}
    6768        \OtherPartner{0}{36}{\Stima}{0:6:0}
    68         \mustbecompleted{TIMA : integration d'OS dans CSG, en
    69         particulier DNA}
     69        \OtherPartner{0}{36}{\Smds}{0:6:0}
    7070                \setMacroInAuxFile{csgImplementation}
     71        \mustbecompleted{TIMA : integration d'OS dans CSG, en particulier DNA}
    7172        Final release of CSG enhanced by the demonstrator's feedback.
    7273    \end{livrable}

  • anr/task-demonstrator.tex

    r295 r300  
    8686    3) the design time from a high level description.
    8787    \begin{livrable}
    88       \itemV{24}{30}{d+x}{\Smds}{\mds evaluation}
    89         This deliverable is a document describing the result got for the application
    90         (\mdsAppSpecification) using COACH milestone of T0+24.
    91       \itemL{30}{36}{d+x}{\Smds}{\mds evaluation}{0:5:5}
    92         This deliverable is a document that validates and evaluates COACH (final release)
    93         for the \mds demonstrators (\mdsAppSpecification).
    94 %
    95       \itemV{24}{30}{d+x}{\Sbull}{\bull evaluation}
    96         This deliverable is a document describing the result got for the application
    97         (\bullAppSpecification) using COACH milestone of T0+24.
    98       \itemL{30}{36}{d+x}{\Sbull}{\bull evaluation}{0:5:5}
    99         This deliverable is a document that validates and evaluates COACH (final release)
    100         for the \bull demonstrators (\bullAppSpecification).
    101 %
    102       \itemV{18}{24}{d+x}{\Sthales}{\thales evaluation}
    103         This deliverable is a document describing the result got for the application
    104         (\trtAppSpecification) with SPEAR-DE (\trtSpearde) using COACH milestone of T0+18.
    105         The updated code of the application will be also provide.
    106       \itemV{24}{30}{d+x}{\Sthales}{\thales evaluation}
    107         This deliverable is a document describing the result got for the application
    108         (\trtAppSpecification) with SPEAR-DE (\trtSpearde) using COACH milestone of T0+24.
    109         The updated code of the application will be also provide.
    110       \itemL{30}{36}{d+x}{\Sthales}{\thales evaluation}{0:5:5}
    111         This deliverable is a document that validates and evaluates COACH (final release)
    112         for the \thales demonstrators (\trtAppSpecification).
    113         The updated code of the application will be also provide.
     88      \itemV{18}{24}{d+x}{\Smds}{Evaluation}
     89        This deliverable written by \Smds, \Sbull and \Sthales is a document
     90        that synthesizes the results got for the demonstrators
     91        (\NOVERSbullAppSpecification, \NOVERStrtAppSpecification,
     92        \NOVERStrtSpearde, \NOVERSmdsAppSpecification)
     93        using the COACH milestone of T0+18.
     94      \itemV{24}{30}{d+x}{\Smds}{Evaluation}
     95        Same as former but for the milestone of T0+24.
     96      \itemL{30}{36}{d+x}{\Smds}{Evaluation}{0:5:5}
     97        \OtherPartner{18}{36}{Sbull}{0:5:5}
     98        \OtherPartner{18}{36}{Sthales}{0:5:5}
     99        This deliverable is a document that validates and evaluates the COACH final release
     100        for the demonstrators.
     101        %(\NOVERSbullAppSpecification, \NOVERStrtAppSpecification,
     102        %\NOVERStrtSpearde, \NOVERSmdsAppSpecification).
     103        The final code of the application demonstrators (\NOVERSbullAppSpecification,
     104        \NOVERStrtAppSpecification) will be provide.
    114105    \end{livrable}
     106%% GROUPED ABOVE%%     \begin{livrable}
     107%% GROUPED ABOVE%%       \itemV{24}{30}{d+x}{\Smds}{\mds evaluation}
     108%% GROUPED ABOVE%%         This deliverable is a document describing the result got for the application
     109%% GROUPED ABOVE%%         (\mdsAppSpecification) using COACH milestone of T0+24.
     110%% GROUPED ABOVE%%       \itemL{30}{36}{d+x}{\Smds}{\mds evaluation}{0:5:5}
     111%% GROUPED ABOVE%%         This deliverable is a document that validates and evaluates COACH (final release)
     112%% GROUPED ABOVE%%         for the \mds demonstrators (\mdsAppSpecification).
     113%% GROUPED ABOVE%% %
     114%% GROUPED ABOVE%%       \itemV{24}{30}{d+x}{\Sbull}{\bull evaluation}
     115%% GROUPED ABOVE%%         This deliverable is a document describing the result got for the application
     116%% GROUPED ABOVE%%         (\bullAppSpecification) using COACH milestone of T0+24.
     117%% GROUPED ABOVE%%       \itemL{30}{36}{d+x}{\Sbull}{\bull evaluation}{0:5:5}
     118%% GROUPED ABOVE%%         This deliverable is a document that validates and evaluates COACH (final release)
     119%% GROUPED ABOVE%%         for the \bull demonstrators (\bullAppSpecification).
     120%% GROUPED ABOVE%% %
     121%% GROUPED ABOVE%%       \itemV{18}{24}{d+x}{\Sthales}{\thales evaluation}
     122%% GROUPED ABOVE%%         This deliverable is a document describing the result got for the application
     123%% GROUPED ABOVE%%         (\trtAppSpecification) with SPEAR-DE (\trtSpearde) using COACH milestone of T0+18.
     124%% GROUPED ABOVE%%         The updated code of the application will be also provide.
     125%% GROUPED ABOVE%%       \itemV{24}{30}{d+x}{\Sthales}{\thales evaluation}
     126%% GROUPED ABOVE%%         This deliverable is a document describing the result got for the application
     127%% GROUPED ABOVE%%         (\trtAppSpecification) with SPEAR-DE (\trtSpearde) using COACH milestone of T0+24.
     128%% GROUPED ABOVE%%         The updated code of the application will be also provide.
     129%% GROUPED ABOVE%%       \itemL{30}{36}{d+x}{\Sthales}{\thales evaluation}{0:5:5}
     130%% GROUPED ABOVE%%         This deliverable is a document that validates and evaluates COACH (final release)
     131%% GROUPED ABOVE%%         for the \thales demonstrators (\trtAppSpecification).
     132%% GROUPED ABOVE%%         The updated code of the application will be also provide.
     133%% GROUPED ABOVE%%     \end{livrable}
    115134
    116135\end{workpackage}

  • anr/task-dissemination.tex

    r291 r300  
    66\begin{objectif}
    77This task relates to the diffusion of the project results.
    8 The objective is to ensure the COACH dissemination by publishing on a public WEB site all
    9 the information that a COACH user requires.
    10 Those are:
     8The objective is to ensure the COACH dissemination
     9by writing papers,
     10by presenting COACH in trade shows
     11and by publishing on a public WEB site all the information that a COACH user requires.
     12Those lasts are:
    1113\begin{itemize}
    1214  \item The packaging of COACH milestones and final release and their associated
    … …  
    2325    \begin{livrable}
    2426      \itemL{6}{36}{d+x}{\Supmc}{Open source release}{1:.5:.5}
    25         \OtherPartner{12}{36}{\Stima}{0:2:1}
    2627        This deliverable deals with the packaging of the open sources  milestones and
    2728        final releases with their installation manuals and to publish then into the WEB
    … …  
    4748        task graph can be obtained.
    4849        \end{description}
    49     \itemV{18}{24}{d}{\Supmc}{Tutorial}
    50         \OtherPartner{12}{36}{\Smds}{0:2:2}
    51         It will illustrate the HAS tools and architectural template available in
    52         T0+24 milestone.\par
    53         A section (written by \Supmc) will show how a task can be migrated to
    54         coprocessor using HAS tools and how FPGA-SoC can be generated and run to
    55         FPGA.\par
    56         A section (written by \Smds) will be dedicated to the integration of
    57         COACH generated IP into an IP-XACT based design flow (such as SOCKET).
    58     \itemL{30}{36}{d}{\Supmc}{Tutorial}{2:1:1}
    59         The final release of the tutorial.
     50    \itemL{30}{36}{d}{\Supmc}{Tutorial}{1.5:0.0:1.5}
     51        \OtherPartner{30}{36}{\Smds}{0:0:2}
     52        The final release of the tutorial. It will be completed with sections
     53        that illustrate:
     54        \begin{description}
     55          \item[HAS (\Supmc)] This section shows how a task can be migrated to
     56            coprocessor using HAS tools and how FPGA-SoC can be generated and run to
     57            FPGA.
     58          \item[Inegration (\Smds)] This section is dedicated to the integration of
     59            COACH generated IP into an IP-XACT based design flow such as SOCKET.
     60        \end{description}
    6061    \end{livrable}
    6162%
    … …  
    7475        This user manual describes how to use COACH within the IP-XACT based Magillem tool suite.
    7576   \end{livrable}
     77%
     78  \subtask{Make to know} 
     79   \begin{livrable}
     80   \itemL{12}{36}{d}{\Smds}{Make to know}{0:3:3}
     81        \OtherPartner{12}{36}{\Sirisa} {0:1:1}
     82        \OtherPartner{12}{36}{\Slip}   {0:1:1}
     83        \OtherPartner{12}{36}{\Stima}  {0:1:1}
     84        \OtherPartner{12}{36}{\Subs}   {0:1:1}
     85        \OtherPartner{12}{36}{\Supmc}  {0:1:1}
     86        \OtherPartner{12}{36}{\Sbull}  {0:1:1}
     87        \OtherPartner{12}{36}{\Sthales}{0:1:1}
     88        This deliverable groups the effort to make to know COACH. It consists
     89        mainly in writing/submitting papers and in presenting COACH in to trade
     90        show and workshop and organizing a final white paper.
     91   \end{livrable}
    7692\end{workpackage}

  • anr/task-hpc.tex

    r291 r300  
    4141        A library implementing the communication API defined in the {\hpcCommApi} deliverable.
    4242        This library is dedicated to help the end-user to partition an application for HPC.
    43       \itemL{12}{21}{x}{\Supmc}{HPC API for Linux PC}{0:2.5:0}
     43      \itemL{12}{21}{x}{\Supmc}{HPC API for Linux PC}{0:2:0}
    4444        \setMacroInAuxFile{hpcCommLinux}
    4545        The PC part of the HPC communication API that communicates with the FPGA-SOC, a
    … …  
    5454    required by the neutral architectural template for using the PCI/X IP of \altera and \xilinx.
    5555    \begin{livrable}
    56     \itemL{9}{24}{h}{\Supmc}{PCI/X traffic generator}{1:1:0}
     56    \itemL{12}{24}{h}{\Supmc}{PCI/X traffic generator}{0:1:0}
    5757        The SystemC description of a component that generates PCI/X traffic. It is
    5858        required to prototype FPGA-SoC dedicated to HPC.
Note: See TracChangeset for help on using the changeset viewer.