On using the Bakery algorithm to solve the problem of mutual exclusion for n-processes in an operating system.

"The idea here is that, customers take a number, and the customer with the lowest number gets service next.

Here, of course, 'service' means entry into the critical section"


Come on man! The innuendo is so thick you could cut it with a .. a.. innuendo cutting device.

Please dear Lord tell me I'm not the only one who sees this.

powered by performancing firefox