Sample global scheduling plugins

Analyse detail state of all resources and choose the right/best one.

Choose randomly between offers returned by local resources/plugins. All offers must satisfy task resource requirements.

Schedules jobs using the earliest due date (EDD) policy to sort them in a queue and then applies the greedy list scheduling Graham algorithm.

Choose randomly between offers returned by local resources/plugins. All offers must satisfy task resource requirements. Network reservation is based on Dijkstra algorithm, which finds the best (shortest) path between two nodes according to time and bandwidth requirements.

Choose randomly between offers returned by local resources/plugins. All offers must satisfy task resource requirements. Network reservation is dependent on user, who defines path between nodes, relying on task requirements and network parameters provided by network reservation manager.

Use Round Robin algorithm for choosing resources.