P/monitor
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Compare commits

base: P:c4e189e3706a9b87961a488e8b10c170bd8dd0c9
Branches Tags
P:master
...
compare: P:de9e1319699a3fcd4b5e49c1ba43530dd6173cea
Branches Tags
P:master

4 Commits
c4e189e370 ... de9e131969

Author SHA1 Message Date
s03529
de9e131969 pre aggiunta parte del doc 2025-04-03 16:10:46 +02:00
s03529
318c15cb8a aggiunta parte di nanuel 2025-04-03 15:31:30 +02:00
s03529
78bbc1db41 Riorganizzato slide e ottimizzato il loro caricamento 2025-04-03 14:23:52 +02:00
s03529
908c02775a Sistema ; erroneamente all'interno di un tag 2025-04-03 13:56:25 +02:00
17 changed files with 135 additions and 25 deletions
Show Stats Expand all files Collapse all files

43
script.js
View File

@ -1,20 +1,38 @@
var counter = 0;
var counter = -1;
var slides = [];
async function reloadSlide() {
const req = await fetch(`./slide/${counter}.html`)
if(req.status != 200) return false;
container.innerHTML = await req.text();
return true;
async function loadSlides() {
var slidei = 1;
var sectioni = 1;
sectionloop: while(true) {
slidei = 1;
slideloop: while(true) {
const req = await fetch(`./slide/${sectioni}/${slidei}.html`);
if(req.status != 200) {
if(slidei == 1) break sectionloop;
break slideloop;
}
slides.push(await req.text());
slidei++;
}
sectioni++;
}
nextSlide();
}
async function nextSlide() {
counter++;
if(!await reloadSlide()) counter--;
loadSlides();
function nextSlide() {
if(counter >= slides.length - 1) return;
container.innerHTML = slides[++counter];
}
async function previousSlide() {
counter--;
if(!await reloadSlide()) counter++;
function previousSlide() {
if(counter <= 0) return;
container.innerHTML = slides[--counter];
}
document.body.addEventListener('click', nextSlide);
@ -34,4 +52,3 @@ document.addEventListener(
false,
);
nextSlide();

9
slide/1.html
View File

@ -1,9 +0,0 @@
<corpo>
<h1>I monitor</h1>
<small>
<p>Pietro Tessarolo</p>
<p>Enrico Vrabie</p>
<p>Manuel Nichele</p>
<p>Lorenzo Viola</p>
</small>
</corpo>

9
slide/1/1.html Normal file
View File

@ -0,0 +1,9 @@
<corpo>
<h1>I monitor</h1>
<ul>
<li>Pietro Tessarolo</li>
<li>Enrico Vrabie</li>
<li>Manuel Nichele</li>
<li>Lorenzo Viola</li>
</ul>
</corpo>

0
slide/2.html → slide/2/1.html
View File

0
slide/3.html → slide/2/2.html
View File

0
slide/4.html → slide/2/3.html
View File

0
slide/5.html → slide/2/4.html
View File

0
slide/6.html → slide/2/5.html
View File

2
slide/7.html → slide/2/6.html
View File

@ -14,7 +14,7 @@
<idt></idt><idt></idt><kw>begin</kw><br />
<idt></idt><idt></idt><idt></idt><name>busy</name> := <value>false</value>;<br />
<idt></idt><idt></idt><idt></idt><name>nonbusy</name>.<call>signal</call><br />
<idt></idt><idt></idt><kw>end;</kw><br />
<idt></idt><idt></idt><kw>end</kw>;<br />
<idt></idt><name>busy</name> := <value>false</value>;<br />
<kw>end</kw> <name>single resource</name>
</codeblock>

5
slide/3/1.html Normal file
View File

@ -0,0 +1,5 @@
<titolo>Parte mancante</titolo>
<corpo>
<p>perché quando mi mancano le parti io inizio a schizzare</p>
</corpo>
<autore>Enrico Vrabie</autore>

7
slide/4/1.html Normal file
View File

@ -0,0 +1,7 @@
<titolo>Monitor e semafori</titolo>
<corpo>
<p>I monitor e i semafori sono due meccanismi di sincronizzazione utilizzati nella programmazione concorrente, e
sono strettamente correlati perché entrambi servono a gestire l'accesso a risorse condivise tra thread o processi.
Tuttavia, hanno approcci e livelli di astrazione diversi.</p>
</corpo>
<autore>Manuel Nichele</autore>

10
slide/4/2.html Normal file
View File

@ -0,0 +1,10 @@
<titolo>Monitor e semafori</titolo>
<corpo>
<p>I monitor si possono implementare con l'utilizzo dei semafori</p>
<ul>
<li>Semaforo binario (mutex)</li>
<li>Semaforo urgent e contatori urgentcount, condsem e condcount</li>
<li>Semafori aggiuntivi (variabili condizione)</li>
</ul>
</corpo>
<autore>Manuel Nichele</autore>

10
slide/4/3.html Normal file
View File

@ -0,0 +1,10 @@
<titolo>Differenze</titolo>
<corpo>
<ul>
<li>Livello di astrazione</li>
<li>Implementazione</li>
<li>Flessibilità</li>
<li>Deadlock avoidance</li>
</ul>
</corpo>
<autore>Manuel Nichele</autore>

10
slide/4/4.html Normal file
View File

@ -0,0 +1,10 @@
<titolo>Esempio codice</titolo>
<corpo>
<codeblock>
<name>condcount</name> := <name>condcount</name> + <value>1</value>;<br />
<kw>if</kw> <name>urgentcount</name> &gt; <value>0</value> <kw>then</kw> <call>V</call>(<name>urgent</name>) <kw>else</kw> <call>V</call>(<name>mutex</name>);<br />
<call>P</call>(<name>condsem</name>);<br />
<name>condcount</name> := <name>condcount</name> - <value>1</value>;
</codeblock>
</corpo>
<autore>Manuel Nichele</autore>

9
slide/4/5.html Normal file
View File

@ -0,0 +1,9 @@
<titolo>Sintesi</titolo>
<corpo>
<ul>
<li>I monitor vengono spesso implementati con i semafori</li>
<li>I semafori vengono usati per costruire meccanismi come i monitor o per risolvere i problemi in maniera personalizzata</li>
<li>I monitor sono più sicuri e semplici, i semafori offrono maggiore controllo da parte del programmatore</li>
</ul>
</corpo>
<autore>Manuel Nichele</autore>

42
slide/5/1.html Normal file
View File

@ -0,0 +1,42 @@
<corpo>
<small>
<codeblock>
<name>readers and writers</name>: <kw>monitor</kw><br />
<idt></idt><kw>begin</kw> <name>readercount</name> : integer;<br />
<idt></idt><idt></idt><name>busy</name>: Boolean;<br />
<idt></idt><idt></idt><name>OKtoread</name>, <name>OKtowrite</name>:condition;<br />
<br />
<idt></idt><idt></idt><kw>procedure</kw> <name>startread</name>;<br />
<idt></idt><idt></idt><idt></idt><kw>begin</kw><br />
<idt></idt><idt></idt><idt></idt><idt></idt><kw>if</kw> <name>busy</name> V <name>OKtowrite</name>.queue <kw>then</kw> <name>OKtoread</name>.wait;<br />
<idt></idt><idt></idt><idt></idt><idt></idt><name>readercount</name> := <name>readercount</name> + 1;<br />
<idt></idt><idt></idt><idt></idt><idt></idt><name>OKtoread</name>.signal;<br />
<idt></idt><idt></idt><idt></idt><idt></idt><comment>// Quando un lettore può iniziare, tutti possono</comment><br />
<idt></idt><idt></idt><idt></idt><kw>end</kw> <name>startread</name>;<br />
<br />
<idt></idt><idt></idt><kw>procedure</kw> <name>endread</name>;<br />
<idt></idt><idt></idt><idt></idt><kw>begin</kw><br />
<idt></idt><idt></idt><idt></idt><idt></idt><name>readercount</name> := <name>readercount</name> -- 1 ;<br />
<idt></idt><idt></idt><idt></idt><idt></idt><kw>if</kw> <name>readercount</name> = 0 <kw>then</kw> <name>OKtowrite</name>.signal<br />
<idt></idt><idt></idt><idt></idt><kw>end</kw> <name>endread</name>;<br />
<br />
<idt></idt><idt></idt><kw>procedure</kw> <name>startwrite</name>;<br />
<idt></idt><idt></idt><idt></idt><kw>begin</kw><br />
<idt></idt><idt></idt><idt></idt><idt></idt><kw>if</kw> <name>readercount</name> != 0 V <name>busy</name> <kw>then</kw> <name>OKtowrite</name>.wait<br />
<idt></idt><idt></idt><idt></idt><idt></idt><name>busy</name> := true<br />
<idt></idt><idt></idt><idt></idt><kw>end</kw> <name>startwrite</name>;<br />
<br />
<idt></idt><idt></idt><kw>procedure</kw> <name>endwrite</name>;<br />
<idt></idt><idt></idt><idt></idt><kw>begin</kw><br />
<idt></idt><idt></idt><idt></idt><idt></idt><name>busy</name> := false;<br />
<idt></idt><idt></idt><idt></idt><idt></idt><kw>if</kw> <name>OKtoread</name>.queue <kw>then</kw> <name>OKtoread</name>.signal<br />
<idt></idt><idt></idt><idt></idt><idt></idt><kw>else</kw> <name>OKtowrite</name>.signal<br />
<idt></idt><idt></idt><idt></idt><kw>end</kw> <name>endwrite</name>;<br />
<br />
<idt></idt><idt></idt><name>readercount</name> := 0;<br />
<idt></idt><idt></idt><name>busy</name> := false;<br />
<idt></idt><kw>end</kw> <name>readers and writers</name>;<br />
</codeblock>
</small>
</corpo>
<autore>Lorenzo Viola</autore>

4
style.css
View File

@ -13,7 +13,7 @@
}
:root {
--dimensone-titolo: 5vw;
--dimensone-titolo: 4vw;
--dimensione-corpo: 2vw;
--dimensione-autore: 2vw;
@ -78,7 +78,7 @@ li {
small {
font-size: 2vw;
font-size: 1.25vw;
}
small p {