Completion time of programs on concurrent processors with failure and repair

The authors address the problem of the completion time of a job structured as a directed acyclic graph processed on parallel processors, i.e., programs consisting of precedence-constrained tasks. The processors are allowed to be subject to failure and repair. It is shown how separate models of the structure of program work requirements and the structure state process of the server complex can be combined to form a composite model of a complex system. Distribution functions of the completion time of a job in this complex system environment are obtained. These distributions are evaluated for a range of parameters, and it is shown how the behavior of the system changes.

Duke Scholars

Author Kishor S. Trivedi Electrical and Computer Engineering