TIME COMPLEXITY AND RESOURCE COMPLEXITY IDENTIFICATION FOR A COMPUTER JOB

摘要

The concept of computer job complexity is useful as a basic criterion to distribute workload, optimize resource allocat ion, perform scalability and compute processing costs. We propose a two-dimensional entity that represents the complexity of a job. The twodimen-sions are represented respectively by a component in the resources space and a time-tike component. Such approach is simple enough to make measurements easy and robust enough to parameterize the relevant information to allow for resource optimization and cost computation.