A distributed process scheduling algorithm based on statistical heuristic search
Tibor Gyires · 2002
The problem of process distribution in a computer network can be formulated as a distributed search process. The goal is to find those processors which can execute the processes in the most cost-efficient way. We present a modified version of the AO* algorithm using statistical data as a heuristic function. Based on previous observations of processors' efficiency in process execution the search will focus on the most promising search path to locate appropriate processors.