Browse Prior Art Database

Accounting Algorithm for Computer Systems

IP.com Disclosure Number: IPCOM000076627D
Original Publication Date: 1972-Mar-01
Included in the Prior Art Database: 2005-Feb-24
Document File: 3 page(s) / 26K

Publishing Venue

IBM

Related People

Roskosz, CL: AUTHOR

Abstract

Accounting algorithms may be made repeatable across dissimilar systems by relating the variables used by the algorithms to a standard system. For example, if central processing unit (CPU) time is used as a variable, then all CPU times should be mapped into what they would have been had the work been processed on the standard CPU.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 55% of the total text.

Page 1 of 3

Accounting Algorithm for Computer Systems

Accounting algorithms may be made repeatable across dissimilar systems by relating the variables used by the algorithms to a standard system. For example, if central processing unit (CPU) time is used as a variable, then all CPU times should be mapped into what they would have been had the work been processed on the standard CPU.

One method of mapping the variables of a particular accounting algorithm is discussed below. This algorithm provides a method for measuring the system resources used by each job processed. The unit generated is called a machine unit (M.U). For each job step processed on the standard system, an MU is simply one minute of CPU time, one minute of I/O time, or 130K of core storage occupied for one minute. All times are those that would be generated in a single-string MVT environment. The number of units charged to a particular job step on the standard system can be stated as: MU(s) = t(c) + t(I) + R over 130 t(E) where: t(c) = MVT single-string CPU time. t(I) = MVT single-string I/O time. t(E) = MVT single-string elapsed time. R = Requested region size in thousands of bytes.

MVT stands for "multiprogramming with a variable number of tasks."

MVT single-string elapsed time, is the time it takes a job to run when it is the only job running in an MVT system.

A peripheral charge, MU(p), of one MU is assessed for each 1000 cards read, 1000 cards punched, or 1000 lines of printed output. This charge is added to the step charges for a job. The MU charge for a job MU(j), then, is:

(Image Omitted)

where n is the number of steps in the job.

A tool such as the System Management Facility (SMF) may serve as the data source for the algorithm. SMF reports CPU time and...