A review on scheduling strategy for real-time processes

In this project, a real-time process scheduling algorithm was implemented, capable of improving the results for assigning tasks based on a consensus among several nodes of a mobile distributed system. In such a way that the data of a mobile device can be transferred and located in a network without losing information, we take into account the delay quality. This project was intended to give a real-time planning and routing vision, which allowed the obtaining of good results without loss of information, looking for no local minimums. Also, it was proposed to construct a routing algorithm to maintain and construct a scheduler, considering an online compensation the distribution of loads, in addition to optimizing the route of the messages, reducing the communication time based on the routing problem