Bibliographic Details
| Title: |
A Processor Allocation Method for Time-Sharing. |
| Authors: |
Randell, B., Mullery, A. P.1, Driscoll, G. C.1 |
| Source: |
Communications of the ACM. Jan1970, Vol. 13 Issue 1, p10-14. 5p. 3 Diagrams, 1 Chart. |
| Subjects: |
Time-sharing computer systems, Macro processors, Algorithms, Algebra, Resource allocation, Dynamic programming |
| Abstract: |
A scheduling algorithm is proposed which is intended to minimize changes of tasks on processors and thereby reduce over-head. 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
