The Combinatorics of Resource Sharing
We discuss general models of resource-sharing computations, with emphasis on the combinatorial structures and concepts that underlie the various deadlock models that have been proposed, the design of algorithms and deadlock-handling policies, and concurrency issues. These structures are mostly graph-theoretic in nature, or partially ordered sets for the establishment of priorities among processes and acquisition orders on resources. We also discuss graph-coloring concepts as they relate to resource sharing.
KeywordsDeadlock models deadlock detection deadlock prevention concurrency measures
Unable to display preview. Download preview PDF.
- V. C. Barbosa. Concurrency in Systems with Neighborhood Constraints. PhD thesis, Computer Science Department, University of California, Los Angeles, CA, 1986.Google Scholar
- V. C. Barbosa. An Introduction to Distributed Algorithms. The MIT Press, Cambridge, MA, 1996.Google Scholar
- V. C. Barbosa and M. R. F. Benevides. A graph-theoretic characterization of AND-OR deadlocks. Technical Report COPPE-ES-472/98, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil, July 1998.Google Scholar
- F. M. G. França. Neural Networks as Neighbourhood-Constrained Systems. PhD thesis, Imperial College, London, UK, 1994.Google Scholar