This paper describes the problem of a process manager that is based on a single processor, which is multiplexed among many processes. These can only support a few CPUs. In addition, the paper suggests the correctness of problem and the design of efficient process managers for computer systems in which many identical CPUs have assess to a shared memory.
The paper starts with introduction of the problem and overview of a process manager. The general description of the processor manager is that is the portion of the operating system that implements processes and semaphores. Moreover, the paper introduces data structure, locks, starting, stopping, scheduling processes, WAIT, SIGNAL operations, Interrupt handling, creation, and deletion of the process manager.
Furthermore, authors show that ready-list contention and the multiprocessor-priority problem can be eliminated by implementing the ready list as a circulating ring of process indices. The authors proudly declare that their solution can be applied to any system in which a set of identical processors has access to shared memory.
Even though the paper was well described the problems and solutions this paper was a little bit difficult to understand for me. I read again and again some parts but still do not get the parts. I think the reader need a little bit of some deep knowledge. I liked the way of the authors that give the conclusion was very powerful at the end.