Ci-dessous, les différences entre deux révisions de la page.
Les deux révisions précédentes Révision précédente Prochaine révision | Révision précédente Prochaine révision Les deux révisions suivantes | ||
muc_2009_2010 [2010/01/20 08:15] tigli |
muc_2009_2010 [2010/01/26 23:43] tigli |
||
---|---|---|---|
Ligne 43: | Ligne 43: | ||
+ | ====Lecture 6 : Tutorial on Aspect of Assembly ==== | ||
- | ==== Student Projects ==== | + | * Date : January, 26th 2010 |
+ | * Instructor : M. Gautier | ||
+ | * Duration : 3h | ||
+ | Ressources : [[MUC_2009_2010_lecture6 | Lecture6 ]] | ||
- | Students must provide : | ||
- | * A Proved Bean Component (lustre checked code, corresponding C code generated, corresponding Bean code) | ||
- | * A sample WComp assembly to illustrate how this proved component works. | ||
- | * A document with all necessary explanations | ||
- | Put all these files and documents on a web site and send the url to JY Tigli (tigli@polytech.unice.fr) before february, the 15th, 2010. | ||
+ | ===== Students Project ===== | ||
+ | [[Student Project Web Page]] | ||
- | **Deadline : february, the 15th, 2010** | + | ===== Final Examination ===== |
- | ^ Student Name ^ Cursus (SI5 / Uibnet) ^ Project Number ^ Project Titlte ^ Subject ^ | + | [[Final Examination Web Page]] |
- | | Remigiusz Modrzejewski | | 0 | Barrier | A barrier is a type of synchronization method. A barrier for a group of event means any event must stop at this point and cannot proceed until all other events reach this barrier | | + | |
- | | Bamba Inza | | 1 | Lock | A lock is a synchronization mechanism for enforcing limits on access to a resource in an environment where there are many threads of execution. Locks are one way of enforcing concurrency control policies. Only one event is emitted at at time | | + | |
- | | leclere - soussi | | 2 | Arbitration | Arbitration between input events | | + | |
- | | Sami Raad | | 3 | Average | Average value is emitted from the values of input events | | + | |
- | | CHOUNGMO FOFACK | | 4 | Moving average | Average value is emitted from the values of input events | | + | |
- | | | | 5* | Function* Allaccess | returned value of one external DLL function is emitted when all value parameters are available (triggered on all input events) | | + | |
- | | | | 6* | Function* Oneaccess | returned value of one external DLL function is emitted as soon as at least on value parameter is available (triggered on one input events) | | + | |
- | | | | 7* | Function* Thisaccess | returned value of one external DLL function is emitted as soon as one specific event arrive (triggered on one specific input events) | | + | |
- | | | | 8* | Function* AllaccessNewvalue | new returned value of one external DLL function is emitted when all value parameters are available (triggered on all input events and state change) | | + | |
- | | | | 9* | Function* OneaccessNewvalue | new returned value of one external DLL function is emitted as soon as at least on value parameter is available (triggered on one input events and state change ) | | + | |
- | | | | 10* | Function* OneaccessNewvalue | new returned value of one external DLL function is emitted as soon as one specific event arrive (triggered on one specific input events and state change) | | + | |
- | | | | 11 | | | | + | |
- | | | | 12 | | | | + | |
- | | | | 13 | | | | + | |
- | | | | 14 | | | | + | |
- | | | | 15 | | | | + | |
- | | | | 16 | | | | + | |
- | | | | 17 | | | | + | |
- | | | | 18 | | | | + | |
- | | | | 19 | | | | + | |
- | | | | 20 | | | | + | |
- | | | | 21 | | | | + | |
- | | | | 22 | | | | + | |
- | | | | 23 | | | | + | |
- | | | | 24 | | | | + | |
- | | | | 25 | | | | + | |
- | | | | 26 | | | | + | |
- | | | | 27 | | | | + | |
- | | | | 28 | | | | + | |
- | | | | 29 | | | | + | |
- | | | | 30 | | | | + | |
- | | | | 31 | | | | + | |
- | | | | 32 | | | | + | |
- | | | | 33 | | | | + | |
- | | | | 34 | | | | + | |
- | | | | 35 | | | | + | |
- | | | | 36 | | | | + | |
- | | | | 37 | | | | + | |
- | | | | 38 | | | | + | |
- | | | | 39 | | | | + | |
- | Function* may be : | ||
- | * MessageBox Function () | ||
- | * DialogBox Function () | ||
- | * TexttoSpeech function () | ||
- | * Beep function () | ||
- | * | ||
- | * ... (you can find other functions in [[http://msdn.microsoft.com/en-us/library/aa383686(VS.85).aspx|Win32 API]]) | ||
- | anykind of function that allows to see and bring to light, the result of your synchronization mecanism | ||
+ | ===== Students List ===== | ||
- | ==== Final Examination ==== | + | * ABDELMOULA Mariem |
- | + | * ARNAOUT Rayan | |
- | + | * BALOUET Thomas | |
- | Students must : | + | * BAMBA Inza |
- | * compose groups of 3 to 4 students | + | * BEN ABU Jeremy |
- | * choose 5 papers in the list below and send to JY Tigli by email (tigli@polytech.unice.fr) the list of the students in the group and the 5 chosen papers, before wenesday the 20th of january, in the evening. | + | * BOUCHEHBOUN Raad |
- | + | * CARMOUCHE Samy | |
- | The 21 th of january, the list below will be completed with one group for each paper. | + | * CARRILLO Oscar |
- | + | * CHEN YanWen | |
- | Then, each group of students must : | + | * CHOUNGMO FOFACK Nicaise Eric |
- | + | * CHOURY Vincent | |
- | * provide an abstract of the read paper (no more than 2 pages, ACM Format). | + | * COLOMBIÉ Steve |
- | * give a talk presentation on their paper during 15 minutes (+5 minutes for questions) on february the 2nd in the morning between 8h30 and 12h45. | + | * DUPIN Stéphane |
- | * put the abstract and the slides of their talk on a web site and send the url to JY Tigli (tigli@polytech.unice.fr) before february, the 2nd, 2010. | + | * FERRARI Martín Hernán |
- | + | * JOUBERT Florent | |
- | + | * LE CLERE Thomas | |
- | **Deadline : february, the 15th, 2010** | + | * MAKKE Ali Hassan |
- | + | * MATRAH Karim | |
- | ^ Student Name ^ Cursus (SI5 / Uibnet) ^ Project Number ^ Project Titlte ^ Subject ^ | + | * MODRZEJEWSKI Remigiusz Jan |
- | | Remigiusz Modrzejewski | | 0 | Barrier | A barrier is a type of synchronization method. A barrier for a group of event means any event must stop at this point and cannot proceed until all other events reach this barrier | | + | * NGUYEN Phuong Thao |
- | | Bamba Inza | | 1 | Lock | A lock is a synchronization mechanism for enforcing limits on access to a resource in an environment where there are many threads of execution. Locks are one way of enforcing concurrency control policies. Only one event is emitted at at time | | + | * NICOLAS Cyprien |
- | | leclere - soussi | | 2 | Arbitration | Arbitration between input events | | + | * RAAD Sami |
- | | Sami Raad | | 3 | Average | Average value is emitted from the values of input events | | + | * REINA Giuseppe |
- | | CHOUNGMO FOFACK | | 4 | Moving average | Average value is emitted from the values of input events | | + | * ROUINI Amine |
- | | | | 5* | Function* Allaccess | returned value of one external DLL function is emitted when all value parameters are available (triggered on all input events) | | + | * SALMIN Claudio |
- | | | | 6* | Function* Oneaccess | returned value of one external DLL function is emitted as soon as at least on value parameter is available (triggered on one input events) | | + | * SOUSSI El Houari |
- | | | | 7* | Function* Thisaccess | returned value of one external DLL function is emitted as soon as one specific event arrive (triggered on one specific input events) | | + | * THEROUDE Nicolas |
- | | | | 8* | Function* AllaccessNewvalue | new returned value of one external DLL function is emitted when all value parameters are available (triggered on all input events and state change) | | + | * THIBAULT Emilie |
- | | | | 9* | Function* OneaccessNewvalue | new returned value of one external DLL function is emitted as soon as at least on value parameter is available (triggered on one input events and state change ) | | + | * TREPIER Stéphane |
- | | | | 10* | Function* OneaccessNewvalue | new returned value of one external DLL function is emitted as soon as one specific event arrive (triggered on one specific input events and state change) | | + | * TRICHET-FOUGERE Laurie |
- | | | | 11 | | | | + | * TROVATO Alexandre |
- | | | | 12 | | | | + | * TUAN Tran Thai |
- | | | | 13 | | | | + | * ZARATI Aymen |
- | | | | 14 | | | | + | |
- | | | | 15 | | | | + | |
- | | | | 16 | | | | + | |
- | | | | 17 | | | | + | |
- | | | | 18 | | | | + | |
- | | | | 19 | | | | + | |
- | | | | 20 | | | | + | |
- | | | | 21 | | | | + | |
- | | | | 22 | | | | + | |
- | | | | 23 | | | | + | |
- | | | | 24 | | | | + | |
- | | | | 25 | | | | + | |
- | | | | 26 | | | | + | |
- | | | | 27 | | | | + | |
- | | | | 28 | | | | + | |
- | | | | 29 | | | | + | |
- | | | | 30 | | | | + | |
- | | | | 31 | | | | + | |
- | | | | 32 | | | | + | |
- | | | | 33 | | | | + | |
- | | | | 34 | | | | + | |
- | | | | 35 | | | | + | |
- | | | | 36 | | | | + | |
- | | | | 37 | | | | + | |
- | | | | 38 | | | | + | |
- | | | | 39 | | | | + | |
- | + | ||
- | Function* may be : | + | |
- | * MessageBox Function () | + | |
- | * DialogBox Function () | + | |
- | * TexttoSpeech function () | + | |
- | * Beep function () | + | |
- | * | + | |
- | * ... (you can find other functions in [[http://msdn.microsoft.com/en-us/library/aa383686(VS.85).aspx|Win32 API]]) | + | |
- | anykind of function that allows to see and bring to light, the result of your synchronization mecanism | + | |