Combined resource-sharing algorithm

The increasing use of multiprocessor systems in a variety of circumstances has highlighted a requirement for improved co-ordination algorithms for those systems where communication is via data structures in shared memory. In this paper, two classes of algorithm are described, and their principal characteristics are discussed. A hybrid algorithm having the advantages of both classes is then proposed. Finally, figures giving the performance of this algorithm on a four-processor shared-memory system are compared with those for alternative algorithms.