Install Steam
login
|
language
简体中文 (Simplified Chinese)
繁體中文 (Traditional Chinese)
日本語 (Japanese)
한국어 (Korean)
ไทย (Thai)
Български (Bulgarian)
Čeština (Czech)
Dansk (Danish)
Deutsch (German)
Español - España (Spanish - Spain)
Español - Latinoamérica (Spanish - Latin America)
Ελληνικά (Greek)
Français (French)
Italiano (Italian)
Bahasa Indonesia (Indonesian)
Magyar (Hungarian)
Nederlands (Dutch)
Norsk (Norwegian)
Polski (Polish)
Português (Portuguese - Portugal)
Português - Brasil (Portuguese - Brazil)
Română (Romanian)
Русский (Russian)
Suomi (Finnish)
Svenska (Swedish)
Türkçe (Turkish)
Tiếng Việt (Vietnamese)
Українська (Ukrainian)
Report a translation problem
❤️ connect romania.llg.ro in consola ❤️
⛔️ Sistem de !ws, !medic, !credits, VIP, Bhop, TAG ⛔️
Mesaj trimis automat!
❤️ connect romania.llg.ro in consola❤️
⛔️ Sistem de !medic | !credits | bhop | tag ⛔️
Algoritmul care rezolva problema sectiunii critice pentru n procese este cunoscut sub numele de algoritmul lui Bakery si este bazat pe un algoritm de scheduling folosit in bakeries (brutari), magazine de inghetata. Cand intra in magazin fiecare cumparator primeste un numar. Cumparatorul cu numarul cel mai mic este urmatorul servit. Datele comune sunt :
var choosing :array[0..n-1] of boolean ;
var number:array[0..n-1] of integer;
Initial structurile de date sunt initializate cu false respectiv cu 0. Definim urmatoarele notatii:
(a,b)<(c,d) – if a<c or if a=c and b<d;
max(a0...an-1) este un nr k, unde k>=ai for i=0..n-1.
Algoritmul este urmatorul:
repeat
choosing =true;
number =max(number[0],..numer[n-1])+1;
choosing =false;
for j=0 to n-1
do {
while choosing[j] do no-op;
while number[j]<>0 and
(number[j],j)<(number ,i) do no-op;}
critical section
number =0;
remainder section
until false;
Share your screen in HD
Collect or create your own custom and animated emoji
Support the server and let everyone know about your support
https://discord.gg/vpDnaFGjY3