A multi-criteria approach to time cheating in the divisible load scheduling

Abstract

The divisible load scheduling (DLS) can be considered as a special class of scheduling model in the area of distributed and parallel systems. According to the DLS, the computations and communications can be divided into some arbitrarily independent fragments in which each fragment can be computed independently by a processor. The basic assumptions of the traditional DLS models are $$w_j\le w_{j+1}$$ and $$z_j\le z_{j+1}$$ for all $$j\le m$$ ( $$z_j$$ and $$w_j$$ are the rates of communication and computation of the jth processor, respectively). These presumptions are not acceptable if the processors do not report their real rates of communication or computation. The problem that a processor may not report its real rates of communication or computation is called cheating problem. This paper has a multi-criteria approach to the time cheating problem in the area of the DLS. The multi-criteria DLS model is a new paradigm in the area of DLS and its applications. The main contribution of this paper is to reduce the effects of time cheating in a DLS scheduling model.