Editing The Combinatorics of Resource Sharing

Title: The Combinatorics of Resource Sharing

Research Question: How can the combinatorial structures and concepts be used to model, design, and analyze resource sharing in computer systems?

Methodology: The study uses graph-theoretic models and partially ordered sets to establish priorities among processes and acquisition orders on resources. It also discusses graph coloring concepts as they relate to resource sharing.

Results: The research presents a general model of resource-sharing computation and discusses various deadlock models, algorithms, and deadlock-handling policies. It also explores concurrency issues and their relation to resource sharing.

Implications: The study provides insights into the design and analysis of resource-sharing policies in computer systems. It highlights the importance of combinatorial structures and concepts in understanding and addressing the complexities of resource sharing, such as safety and liveness guarantees, as well as asynchronism in process behavior.

Link to Article: https://arxiv.org/abs/0309044v1
Authors: 
arXiv ID: 0309044v1

[[Category:Computer Science]]
[[Category:Resource]]
[[Category:Sharing]]
[[Category:As]]
[[Category:Concepts]]
[[Category:It]]