article · ACM SIGMETRICS Performance Evaluation Review · 1984

Efficient approximation for models of multiprogramming with shared domains

Alexandre Brandwajn, William M. McCormack

Cited by 7Open access

Abstract

Queueing network models of multiprogramming systems with memory constraints and multiple classes of jobs are important in representing large commercial computer systems. Typically, an exact analytical solution of such models is unavailable, and, given the size of their state space, the solution of models of this type is approached through simulation and/or approximation techniques. Recently, a computationally efficient iterative technique has been proposed by Brandwajn, Lazowska and Zahorjan for models of systems in which each job is subject to a separate memory constraint, i.e., has its own memory domain. In some important applications, it is not unusual, however, to have several jobs of different classes share a single memory “domain” (e.g., IBM's Information Management System). We present a simple approximate solution to the shared domain problem. The approach is inspired by the recently proposed technique which is complemented by a few approximations to preserve the conceptual simplicity and computational efficiency of this technique. The accuracy of the results is generally in fair agreement with simulation.

Cite this paper

APA 7

Brandwajn, A., & McCormack, W. M. (1984). Efficient approximation for models of multiprogramming with shared domains. ACM SIGMETRICS Performance Evaluation Review, 12(3), 186–194. https://doi.org/10.1145/1031382.809327

MLA 9

Brandwajn, Alexandre, and William M. McCormack. “Efficient approximation for models of multiprogramming with shared domains.” ACM SIGMETRICS Performance Evaluation Review, vol. 12, no. 3, 1984, pp. 186–94, https://doi.org/10.1145/1031382.809327.

Chicago

Brandwajn, Alexandre, and William M. McCormack. 1984. “Efficient approximation for models of multiprogramming with shared domains.” ACM SIGMETRICS Performance Evaluation Review 12 (3): 186–94. https://doi.org/10.1145/1031382.809327.

Harvard

Brandwajn, A. and McCormack, W.M. (1984) ‘Efficient approximation for models of multiprogramming with shared domains’, ACM SIGMETRICS Performance Evaluation Review, 12(3), pp. 186–194. Available at: https://doi.org/10.1145/1031382.809327.

BibTeX

@article{brandwajn1984efficient,
  title = {{Efficient approximation for models of multiprogramming with shared domains}},
  author = {Brandwajn, Alexandre and McCormack, William M.},
  journal = {ACM SIGMETRICS Performance Evaluation Review},
  volume = {12},
  number = {3},
  pages = {186--194},
  year = {1984},
  doi = {10.1145/1031382.809327}
}

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