Task scheduling considering fault probability for distributed computing applications over an optical network

Abstract

The optical network integrated computing environment has been thought of as a promising technology to support large-scale data-intensive distributed computing applications. For such an environment involving so many heterogeneous resources, such as high-performance processors and optical links, faults seem to be inevitable. The faults will lead to the failure of the applications or highly delay the applications' finish times. Therefore, it is necessary to analyze resources' fault probability and then to better schedule the tasks of the application onto the appropriate resources so as to minimize the fault probability of the application. We address the task-scheduling problem based on the fault probability analysis for distributed computing applications over an optical network. We quantitatively analyze the fault probability of the processors and optical links in a given interval and propose a minimal fault probability (MFP) task-scheduling algorithm to minimize the fault probability of the application. We develop a simulator to evaluate the performance of the MFP algorithm. The simulation results prove the efficiency of the MFP algorithm.