absolute parallelism
1.The full priority scheduling algorithm generates the scheduling list according to the priority vectors, and only the application which has the highest priority can be submitted while the non-absolute priority scheduling algorithm schedules several independent grid applications so as to compensate the parallelism problem of the full priority scheduling algorithm.
