By Topic

Selectors: High-Level Resource Schedulers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Dennis W. Leinbaugh ; Department of Computer and Information Science, The Ohio State University, Columbus, OH 43210.; AT&T Bell Laboratories, Columbus, OH 43213.

Resource sharing problems can be described in three basically independent modular components. ¿ The constraints the resource places upon sharing because of physcal limitations and consistency requirements. ¿ The desired ordering of resource requests to achieve efficiency-either efficiency of resource utilization or efficiency of processes making the requests. ¿ Modifications to the ordering to prevent starvation of processes waiting for requests which might otherwise never receive service. A high-level nonprocedural language to specify these components of resource sharing problems is described. General deadlock and starvation properties of selectors are proven. Solutions to several classic resource sharing problems are shown to illustrate the expressiveness of this language. Proof techniques for this high-level language are introduced to show how to prove particular selectors are or are not deadlock and starvation free.

Published in:

IEEE Transactions on Software Engineering  (Volume:SE-10 ,  Issue: 6 )