A dynamic and adaptive scheduling algorithm for distributed student registration system

Distributed workflow scheduling is a hotspot in recent workflow research, it aims to finish the execution in the shortest time and use the system resources sufficiently. In this paper we put forward a pre-calculated scheduling algorithm (PCSA) based on the characters of distributed workflow system. In this algorithm every workflow will be pre-calculated before they are deployed into the workflow engine, analyzing every possible simple path in the flow, each activity will get a sorted execution node ranking, so the workflow instances will always chose the execution node close to the optimal one. In this way the algorithm can make each workflow instance has the minimum execution cost and transport cost. Our experiment indicates that the algorithm has a preferable distributed execute efficiency. This algorithm can fits the need of the student registration system well.