|
Eisenberg & McGuire algorithm
The Eisenberg & McGuire algorithm is an algorithm for solving the critical sections problem, a general version of the dining philosophers problem. It was described in 1972 by Murray A. Eisenberg and Michael R. McGuire. AlgorithmAll the n-processes share the following variables: enum pstate = {IDLE, WAITING, ACTIVE};
pstate flags[n];
int turn;
The variable turn is set arbitrarily to a number between 0 and n−1 at the start of the algorithm. The flags variable for each process is set to WAITING whenever it intends to enter the critical section. flags takes either IDLE or WAITING or ACTIVE.
repeat {
/* announce that we need the resource */
flags[i] := WAITING;
/* scan processes from the one with the turn up to ourselves. */
/* repeat if necessary until the scan finds all processes idle */
index := turn;
while (index != i) {
if (flags[index] != IDLE) index := turn;
else index := (index+1) mod n;
}
/* now tentatively claim the resource */
flags[i] := ACTIVE;
/* find the first active process besides ourselves, if any */
index := 0;
while ((index < n) && ((index = i) || (flags[index] != ACTIVE))) {
index := index+1;
}
/* if there were no other active processes, AND if we have the turn
or else whoever has it is idle, then proceed. Otherwise, repeat
the whole sequence. */
} until ((index >= n) && ((turn = i) || (flags[turn] = IDLE)));
/* Start of CRITICAL SECTION */
/* claim the turn and proceed */
turn := i;
/* Critical Section Code of the Process */
/* End of CRITICAL SECTION */
/* find a process which is not IDLE */
/* (if there are no others, we will find ourselves) */
index := (turn+1) mod n;
while (flags[index] = IDLE) {
index := (index+1) mod n;
}
/* give the turn to someone that needs it, or keep it */
turn := index;
/* we're finished now */
flags[i] := IDLE;
/* REMAINDER Section */
See alsoReferencesExternal links |
Index:
pl ar de en es fr it arz nl ja pt ceb sv uk vi war zh ru af ast az bg zh-min-nan bn be ca cs cy da et el eo eu fa gl ko hi hr id he ka la lv lt hu mk ms min no nn ce uz kk ro simple sk sl sr sh fi ta tt th tg azb tr ur zh-yue hy my ace als am an hyw ban bjn map-bms ba be-tarask bcl bpy bar bs br cv nv eml hif fo fy ga gd gu hak ha hsb io ig ilo ia ie os is jv kn ht ku ckb ky mrj lb lij li lmo mai mg ml zh-classical mr xmf mzn cdo mn nap new ne frr oc mhr or as pa pnb ps pms nds crh qu sa sah sco sq scn si sd szl su sw tl shn te bug vec vo wa wuu yi yo diq bat-smg zu lad kbd ang smn ab roa-rup frp arc gn av ay bh bi bo bxr cbk-zam co za dag ary se pdc dv dsb myv ext fur gv gag inh ki glk gan guw xal haw rw kbp pam csb kw km kv koi kg gom ks gcr lo lbe ltg lez nia ln jbo lg mt mi tw mwl mdf mnw nqo fj nah na nds-nl nrm nov om pi pag pap pfl pcd krc kaa ksh rm rue sm sat sc trv stq nso sn cu so srn kab roa-tara tet tpi to chr tum tk tyv udm ug vep fiu-vro vls wo xh zea ty ak bm ch ny ee ff got iu ik kl mad cr pih ami pwn pnt dz rmy rn sg st tn ss ti din chy ts kcg ve
Portal di Ensiklopedia Dunia
