do {
    choosing[i] = true;
    number[i] = max(number[0], number[1], …, number [n – 1])+1;
    choosing[i] = false;
    for (j = 0; j < n; j++) {
        while (choosing[j]);
        while ((number[j]!= 0) && (number[j],j) < (number[i],i)));
    }
    critical section number
    number[i] = 0;
    remainder section
} while(1);