Admissible Resource Selection Strategies in Two Level Job-Scheduling for a Computational Grid
We address parallel jobs scheduling problem for computational GRID systems. We concentrate on two-level hierarchy scheduling: at the first level broker allocates computational jobs to parallel computers. At the second level each computer generates schedules of the parallel jobs assigned to it by its own local scheduler. Selection, allocation strategies, and efficiency of proposed hierarchical scheduling algorithms based on realistic GRID parameters and real workloads are discussed.