The History of the Bakery Algorithm

The first computer science journal that he ever looked at, actually I wasn't even aware that there was such a thing as computer science because that was in 1972 and there really wasn't computer science in those days. But anyway, so they had this algorithm that's solving mutual exclusion. Mutual exclusion is the problem that if you have a bunch of processes running and say some process was to use the printer, well, if you had two processes trying to print at the same time, it's not going to work. That's called mutual exclusion. The bakery algorithm works. It doesn't require mutual exclusion on the reading and writing of variables. And it can be read by multiple processes. So you don