Evaluation of POS scheduling algorithm for distributed computing environment

One of important classes of computational problems is the class of problem-oriented workflow applications executed in distributed computing environment. The problem-oriented workflow application can be represented by the oriented graph with the tasks as the nodes and the data flows as the edges. For the problem-oriented workflow application, we can predict the execution time of the task and the amount of data to be transferred between the tasks. Nowadays, the significant number of scheduling algorithms for the distributed computing environment are proposed. Some of them (like DSC algorithm) take into account the peculiarity of problem-oriented workflow applications. Others (like Min-min algorithm) take into account the many core structure of the node of computational network. However, no one of them take into account both these properties. We developed the new Problem-Oriented Scheduling (POS) algorithm for distributed cluster computing environment, which is able to plan the launch of a task on several processor cores, taking into account the limit of task scalability.