25.06.2015 Views

Administering Platform LSF - SAS

Administering Platform LSF - SAS

Administering Platform LSF - SAS

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Chapter 14<br />

Fairshare Scheduling<br />

Cross-queue Fairshare<br />

Applying the same fairshare policy to several queues<br />

User and queue priority<br />

Fairshare policy configured at the queue level handles resource contention<br />

across multiple queues.<br />

You can define a fairshare policy that applies to several queues at the same<br />

time. You define the fairshare policy in a master queue and list slave queues<br />

to which the same fairshare policy applies; slave queues inherit the same<br />

fairshare policy as your master queue. For job scheduling purposes, this is<br />

equivalent to having one queue with one fairshare tree.<br />

In this way, if a user submits jobs to different queues, user priority is calculated<br />

by taking into account all the jobs the user has submitted across the defined<br />

queues.<br />

To submit jobs to a fairshare queue, users must be allowed to use the queue<br />

(USERS in lsb.queues) and must have a share assignment (FAIRSHARE in<br />

lsb.queues). Even cluster and queue administrators cannot submit jobs to a<br />

fairshare queue if they do not have a share assignment.<br />

By default, a user has the same priority across the master and slave queues. If<br />

the same user submits several jobs to these queues, user priority is calculated<br />

by taking into account all the jobs the user has submitted across the masterslave<br />

set.<br />

If DISPATCH_ORDER=QUEUE is set in the master queue, jobs are dispatched<br />

according to queue priorities first, then user priority. This avoids having users<br />

with higher fairshare priority getting jobs dispatched from low-priority queues.<br />

Jobs from users with lower fairshare priorities who have pending jobs in higher<br />

priority queues are dispatched before jobs in lower priority queues. Jobs in<br />

queues having the same priority are dispatched according to user priority.<br />

Queues that are not part of the ordered cross-queue fairshare can have any<br />

priority. Their priority can fall within the priority range of cross-queue fairshare<br />

queues and they can be inserted between two queues using the same fairshare<br />

tree.<br />

Viewing cross-queue fairshare information<br />

Run bqueues -l to know if a queue is part of cross-queue fairshare. The<br />

parameter FAIRSHARE_QUEUES indicates cross-queue fairshare. The first<br />

queue listed in the FAIRSHARE_QUEUES parameter is the master queue—the<br />

queue in which fairshare is configured; all other queues listed inherit the<br />

fairshare policy from the master queue.<br />

All queues that participate in the same cross-queue fairshare will display the<br />

same fairshare information (SCHEDULING POLICIES, FAIRSHARE_QUEUES,<br />

USER_SHARES, SHARE_INFO_FOR) when bqueues -l is used. Fairshare<br />

information applies to all the jobs running in all the queues in the master-slave<br />

set.<br />

<strong>Administering</strong> <strong>Platform</strong> <strong>LSF</strong> 211

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!