The combinatorics of resource sharing
<|reference_start|>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.<|reference_end|>
@article{barbosa2003the,
    title={The combinatorics of resource sharing},
    author={V. C. Barbosa},
    journal={arXiv preprint arXiv:cs/0309044},
    year={2003},
    doi={10.1007/978-1-4757-3609-0_2},
    archivePrefix={arXiv},
    eprint={cs/0309044},
    primaryClass={cs.OS cs.DC}
}