Cart (Loading....) | Create Account
Close category search window
 

The Utah TENEX scheduler

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
$31 $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)
Ellison, C.M. ; University of Utah, Salt Lake City, Utah

A scheduling algorithm which is a modification of the standard TENEX scheduler is described. This algorithm differs from those commonly used in time-sharing systems in that it treats the case of multiple critical resources. The Utah scheduler considers CPU usage and real core occupancy, but the same techniques can be applied to cases of more than two critical resources. Similar scheduling tehniques can be applied to interactive batch-processing systems and to resource sharing systems.

Published in:

Proceedings of the IEEE  (Volume:63 ,  Issue: 6 )

Date of Publication:

June 1975

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.