International Journal of Computer Science Issues

More than a traditional journal...

In the recent decades computing beside the experiment and theory has been changed into third branch of science. The evolution of computations is in such a way that the possibility of their performance on a system and in a local way is very expensive and even impossible. So to solve this problem, distributed systems formed from computers and different sources have been presented. That with distribution of computing on them can get much advantages. The distributed system consists of a number of data centers that presents different services through internet. In a distributed system Timing and mapping the priority of tasks among processors is one of the issues attracted most of attention to itself. This issue consists of mapping a Direct Acyclic Graph with a set of tasks on a number of parallel processors and its purpose is allocating tasks to the available processors in order to satisfy the needs of priority and decency of tasks, and also to minimize the duration time of execution in total graph. In this article, well represent an algorithm that we have optimization of servers. Simulation is showed that the way for me is better about the list schedule algorithm.