System optimization: Mathematical programming techniques for optimal computer use

  • Authors:
  • H. E. Thiess

  • Affiliations:
  • -

  • Venue:
  • ACM '65 Proceedings of the 1965 20th national conference
  • Year:
  • 1965

Quantified Score

Hi-index 0.05

Visualization

Abstract

IN THIS PAPER we consider the application of mathematical programming techniques for the solution of allocation, assignment, or selection problems of digital computer uses involving large amounts of data input and output in a series of computer runs. Files may be input to several runs in a series of machine runs; further, a file may originally be an output of one of the computer runs. We seek to optimize the allocation or selection of computer memory to blocks of records for each file. Also, we shall seek to optimize the assignment of input-output devices if more than one type of such devices is available. Aside from other applications, we have a memory allocation problem. The minimization of use of memory locations for mostly scientific computing problems was the subject of the ACM Storage Allocation Symposium held in Princeton, N. J. on June 23 - 24, 19611. Wolman2 discusses memory allocation in situations where, e.g., “a general-purpose computer performs the control, switching, and storage functions in a data communication system with message storage.” White3 describes the “Relative Effects of Central Processor and Input-Output Speeds Upon Throughput on the Large Computer.” Delgalvis and Davison4 derive a computational procedure to evaluate the input-output buffer storage requirements of a real-time system.