Comparative study of scheduling algorithms for distributed computing environments

The paper analyzes the efficiency of known algorithms for scheduling of bag-of-tasks and workflow applications in distributed computing environments (DCE). The comparison of algorithms is performed on the base of simulation experiments for various application cases and DCE configurations. Simulation allows to avoid the time consuming real-world experiments and to ensure reproducible results. Besides the experimental results, the used simulation model (simulator) of DCE based on the SimGrid framework is described. (in Russian).