ACM

Communications of the ACM

Home/Magazine Archive/January 1970 (Vol. 13, No. 1)/A processor allocation method for time-sharing/Abstract

A processor allocation method for time-sharing

By A. P. Mullery, G. C. Driscoll
Communications of the ACM, January 1970, Vol. 13 No. 1, Pages 10-14
10.1145/361953.361961
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

A scheduling algorithm is proposed which is intended to minimize changes of tasks on processors and thereby reduce overhead. The algorithm also has application to more general resource allocation problems. It is implemented by means of a method for efficiently handling dynamically changing segmented lists.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.