LSF Version 7.3 - Administering Platform LSF

Administering Platform LSF 319
Fairshare Scheduling
10 queues sharing
10% each of 50
slots
In this example, queue1 (the curve with the highest peaks) has the longer running
jobs and so has less accumulated slots in use over time. LSF accordingly rebalances
the load when all queues compete for jobs to maintain a configured 10% usage
share.
Using Historical and Committed Run Time
By default, as a job is running, the dynamic priority decreases gradually until the
job has finished running, then increases immediately when the job finishes.
In some cases this can interfere with fairshare scheduling if two users who have the
same priority and the same number of shares submit jobs at the same time.
To avoid these problems, you can modify the dynamic priority calculation by using
either or both of the following weighting factors: