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 />

The following figure illustrates phases 1, 2, and 3:<br />

2 pools, 30 job slots, and 2 queues out of any pool<br />

◆ poolA uses 15 slots and contains queues Roma (50% share, 8 slots), Verona<br />

(30% share, 5 slots), and Genova (20% share, 2 remaining slots to total 15).<br />

◆ poolB with 15 slots containing queues Pisa (30% share, 5 slots), Venezia<br />

(30% share, 5 slots), and Bologna (30% share, 5 slots).<br />

◆ Two other queues Milano and Parma do not belong to any pool, but they<br />

can use the hosts of poolB. The queues from Milano to Bologna all have<br />

the same priority.<br />

The queues Milano and Parma run very short jobs that get submitted<br />

periodically in bursts. When no jobs are running in them, the distribution of<br />

jobs looks like this:<br />

QUEUE_NAME PRIO STATUS MAX JL/U JL/P JL/H NJOBS PEND RUN SUSP<br />

Roma 50 Open:Active - - - - 1000 992 8 0<br />

Verona 48 Open:Active - - - - 1000 995 5 0<br />

Genova 48 Open:Active - - - - 1000 998 2 0<br />

Pisa 44 Open:Active - - - - 1000 995 5 0<br />

Milano 43 Open:Active - - - - 2 2 0 0<br />

Parma 43 Open:Active - - - - 2 2 0 0<br />

Venezia 43 Open:Active - - - - 1000 995 5 0<br />

Bologna 43 Open:Active - - - - 1000 995 5 0<br />

<strong>Administering</strong> <strong>Platform</strong> <strong>LSF</strong> 225

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

Saved successfully!

Ooh no, something went wrong!