Probability Density Functions of Task-processing Times for Deterministic, Time-varying Processor Efficiency

Abstract

We consider a task being performed in an environment in which the work-rate (or efficiency of the processor varies with time in a deterministic manner. Given the probability density function (p.d.f.) of the total work-content of the task (i.e. processing time at 100% efficiency), we develop a closed-form expression for the p.d.f. of the task-processing time. Numerical examples are given.

Keywords:

• probability
• sequencing
• statistics
• task-processing