LSF Version 7.3 - Administering Platform LSF

Administering Platform LSF 307
Fairshare Scheduling
How hierarchical fairshare affects job dispatch order
LSF uses the dynamic share priority of a user or group to find out which user's job
to run next. If you use hierarchical fairshare, LSF works through the share tree from
the top level down, and compares the dynamic priority of users and groups at each
level, until the user with the highest dynamic priority is a single user, or a group that
has no subgroups.
View hierarchical share information for a group
1 Use bugroup -l to find out if you belong to a group, and what the share
distribution is.
bugroup -l
GROUP_NAME: group1
USERS: group2/ group3/
SHARES: [group2,20] [group3,10]
GROUP_NAME: group2
USERS: user1 user2 user3
SHARES: [others,10] [user3,4]
GROUP_NAME: group3
USERS: all
SHARES: [user2,10] [default,5]
This command displays all the share trees that are configured, even if they are
not used in any fairshare policy.
View hierarchical share information for a host partition
By default, bhpart displays only the top level share accounts associated with the
partition.
1 Use bhpart -r to display the group information recursively.
The output lists all the groups in the share tree, starting from the top level, and
displays the following information:
◆ Number of shares
◆ Dynamic share priority (LSF compares dynamic priorities of users who
belong to same group, at the same level)
◆ Number of started jobs
◆ Number of reserved jobs
◆ CPU time, in seconds (cumulative CPU time for all members of the group,
recursively)
◆ Run time, in seconds (historical and actual run time for all members of the
group, recursively)
bhpart -r Partition1
HOST_PARTITION_NAME: Partition1
HOSTS: HostA