The combinatorics of resource sharing
操作系统
2016-09-14 v1 分布式、并行与集群计算
摘要
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.
引用
@article{arxiv.cs/0309044,
title = {The combinatorics of resource sharing},
author = {V. C. Barbosa},
journal= {arXiv preprint arXiv:cs/0309044},
year = {2016}
}
备注
R. Correa et alii (eds.), Models for Parallel and Distributed Computation, pp. 27-52. Kluwer Academic Publishers, Dordrecht, The Netherlands, 2002