article · Communications of the ACM · 1970

A processor allocation method for time-sharing

Cited by 11Open access

Abstract

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.

Cite this paper

APA 7

Mullery, A. P., & Driscoll, G. C. (1970). A processor allocation method for time-sharing. Communications of the ACM, 13(1), 10–14. https://doi.org/10.1145/361953.361961

MLA 9

Mullery, A. P., and Graham C. Driscoll. “A processor allocation method for time-sharing.” Communications of the ACM, vol. 13, no. 1, 1970, pp. 10–14, https://doi.org/10.1145/361953.361961.

Chicago

Mullery, A. P., and Graham C. Driscoll. 1970. “A processor allocation method for time-sharing.” Communications of the ACM 13 (1): 10–14. https://doi.org/10.1145/361953.361961.

Harvard

Mullery, A.P. and Driscoll, G.C. (1970) ‘A processor allocation method for time-sharing’, Communications of the ACM, 13(1), pp. 10–14. Available at: https://doi.org/10.1145/361953.361961.

BibTeX

@article{mullery1970processor,
  title = {{A processor allocation method for time-sharing}},
  author = {Mullery, A. P. and Driscoll, Graham C.},
  journal = {Communications of the ACM},
  volume = {13},
  number = {1},
  pages = {10--14},
  year = {1970},
  doi = {10.1145/361953.361961}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.