Outils pour utilisateurs
muc_2009_2010_lecture3
Différences
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 | ||
|
muc_2009_2010_lecture3 [2010/01/04 17:53] tigli |
muc_2009_2010_lecture3 [2010/01/05 08:25] (Version actuelle) tigli |
||
|---|---|---|---|
| Ligne 40: | Ligne 40: | ||
| * Documentation for the tutorial 2 "Creating an advanced Component in WComp 2.0" : [[http://rainbow.i3s.unice.fr/~tigli/cours/MUC/Lecture2/Tutorial2_MUC_Ubinet_2010_Doc.pdf|Tutorial 2, Creating an advanced Component in WComp 2.0]] | * Documentation for the tutorial 2 "Creating an advanced Component in WComp 2.0" : [[http://rainbow.i3s.unice.fr/~tigli/cours/MUC/Lecture2/Tutorial2_MUC_Ubinet_2010_Doc.pdf|Tutorial 2, Creating an advanced Component in WComp 2.0]] | ||
| - | ===== Student Projects ===== | + | ===== Part 3 : Student Projects ===== |
| - | ^ Heading 1 ^ Heading 2 ^ Heading 3 ^ | + | Students must provide : |
| - | | Row 1 Col 1 | Row 1 Col 2 | Row 1 Col 3 | | + | * A Proved Bean Component (lustre checked code, corresponding C code generated, corresponding Bean code) |
| - | | Row 2 Col 1 | some colspan (note the double pipe) || | + | * A sample WComp assembly to illustrate how this proved component works. |
| - | | Row 3 Col 1 | Row 2 Col 2 | Row 2 Col 3 | | + | * A document with all necessary explanations |
| + | |||
| + | Put all these files and documents on a web site and send them to JY Tigli before february, the 1st, 2010. | ||
| + | |||
| + | |||
| + | Deadline : february, the 1st, 2010 | ||
| + | |||
| + | ^ Student Name ^ Cursus (SI5 / Uibnet) ^ Project Number ^ Project Titlte ^ Subject ^ | ||
| + | | | | 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 | | ||
| + | | | | 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 | | ||
| + | | | | 2 | Arbitration | Arbitration between input events | | ||
| + | | | | 3 | Average | Average value is emitted from the values of input events | | ||
| + | | | | 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 | | | | ||
muc_2009_2010_lecture3.1262624016.txt.gz · Dernière modification: 2010/01/04 17:53 par tigli
Outils de la page
Sauf mention contraire, le contenu de ce wiki est placé sous les termes de la licence suivante : CC Attribution-Noncommercial-Share Alike 4.0 International
