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.

How Fairshare Affects Job Dispatch Order<br />

Chapter 14<br />

Fairshare Scheduling<br />

Within a queue, jobs are dispatched according to the queue’s scheduling<br />

policy.<br />

◆ For FCFS queues, the dispatch order depends on the order of jobs in the<br />

queue (which depends on job priority and submission time, and can also<br />

be modified by the job owner).<br />

◆ For fairshare queues, the dispatch order depends on dynamic share<br />

priority, then order of jobs in the queue (which is not necessarily the order<br />

in which they are submitted to the queue).<br />

A user’s priority gets higher when they use less than their fair share of the<br />

cluster’s resources. When a user has the highest priority, <strong>LSF</strong> considers one of<br />

their jobs first, even if other users are ahead of them in the queue.<br />

If there are only one user’s jobs pending, and you do not use hierarchical<br />

fairshare, then there is no resource contention between users, so the fairshare<br />

policies have no effect and jobs are dispatched as usual.<br />

Job dispatch order among queues of equivalent priority<br />

Example<br />

The order of dispatch depends on the order of the queues in the queue<br />

configuration file. The first queue in the list is the first to be scheduled.<br />

Jobs in a fairshare queue are always considered as a group, so the scheduler<br />

attempts to place all jobs in the queue before beginning to schedule the next<br />

queue.<br />

Jobs in an FCFS queue are always scheduled along with jobs from other FCFS<br />

queues of the same priority (as if all the jobs belonged to the same queue).<br />

In a cluster, queues A, B, and C are configured in that order and have equal<br />

queue priority.<br />

Jobs with equal job priority are submitted to each queue in this order: C B A<br />

B A.<br />

◆ If all queues are FCFS queues, order of dispatch is C B A B A (queue A is<br />

first; queues B and C are the same priority as A; all jobs are scheduled in<br />

FCFS order).<br />

◆ If all queues are fairshare queues, order of dispatch is AA BB C (queue A<br />

is first; all jobs in the queue are scheduled; then queue B, then C).<br />

◆ If A and C are fairshare, and B is FCFS, order of dispatch is AA B B C<br />

(queue A jobs are scheduled according to user priority; then queue B jobs<br />

are scheduled in FCFS order; then queue C jobs are scheduled according<br />

to user priority)<br />

◆ If A and C are FCFS, and B is fairshare, order of dispatch is C A A BB<br />

(queue A is first; queue A and C jobs are scheduled in FCFS order, then<br />

queue B jobs are scheduled according to user priority)<br />

◆ If any of these queues uses cross-queue fairshare, the other queues must<br />

also use cross-queue fairshare and belong to the same set, or they cannot<br />

have the same queue priority. For more information, see “Cross-queue<br />

Fairshare” on page 211.<br />

<strong>Administering</strong> <strong>Platform</strong> <strong>LSF</strong> 207

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

Saved successfully!

Ooh no, something went wrong!