Algorithm of planning energy-saving parallel processing of information with regard of information importance and time of entry in progress

An algorithm for planning energy-saving parallel processing of information in a multi-module computing system is considered, taking into account the information importance and time of receipt of tasks. The developed scheduling algorithm has a polynomial complexity and, unlike known ones, removes restrictions on simultaneous receipt for processing tasks, takes into account their informational importance and minimizes the necessary number of processors. The analysis of the developed algorithm is carried out.