The combinatorics of resource sharing

Details The combinatorics of resource sharing The combinatorics of resource sharing

2003-09-23

arxiv.org/abs/cs/0309044v1

Computer Science

Operating Systems

R. Correa et alii (eds.), Models for Parallel and Distributed Computation, pp. 27-52. Kluwer Academic Publishers, Dordrecht, T

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The combinatorics of resource sharing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The combinatorics of resource sharing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The combinatorics of resource sharing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-182687