Technical note Open Access
<?xml version='1.0' encoding='UTF-8'?> <record xmlns="http://www.loc.gov/MARC21/slim"> <leader>00000nam##2200000uu#4500</leader> <datafield tag="980" ind1=" " ind2=" "> <subfield code="a">publication</subfield> <subfield code="b">technicalnote</subfield> </datafield> <datafield tag="520" ind1=" " ind2=" "> <subfield code="a"><p>The default behaviour of a batch system is to dispatch jobs to nodes having the lower<br> value of some load index. Whilst this causes jobs to be equally distributed among all the<br> nodes in the farm, there are cases when different types of behaviour may be desirable, such as<br> having a completely full node before dispatching jobs to another one, or having similar jobs<br> dispatched to nodes already running jobs of the same kind. This work defines the packing<br> concept, different packing policies and useful metrics to evaluate how good the policy is. A<br> simple farm simulator has been written to evaluate the expected impact on a farm of different<br> packing policy. The simulator is run against a sequence of real jobs, whose parameters have<br> been taken from the accounting database of INFN-Tier1. The effectiveness of two packing<br> policies of interest, namely relaxed and exclusive, are compared. The exclusive policy proves<br> to be better, at the cost of unused cores in the farm, whose number is estimated. The<br> possibility of implementing the exclusive policy on a specific batch system, LSF 7.06, is<br> exploited. Relevant configurations are shown and an overall description of the mechanism is<br> presented.</p></subfield> </datafield> <datafield tag="024" ind1=" " ind2=" "> <subfield code="a">10.15161/oar.it/143357</subfield> <subfield code="2">doi</subfield> </datafield> <controlfield tag="001">143357</controlfield> <datafield tag="650" ind1="1" ind2="7"> <subfield code="a">cc-by</subfield> <subfield code="2">opendefinition.org</subfield> </datafield> <controlfield tag="005">20231102145658.0</controlfield> <datafield tag="542" ind1=" " ind2=" "> <subfield code="l">open</subfield> </datafield> <datafield tag="041" ind1=" " ind2=" "> <subfield code="a">eng</subfield> </datafield> <datafield tag="980" ind1=" " ind2=" "> <subfield code="a">user-infn</subfield> </datafield> <datafield tag="245" ind1=" " ind2=" "> <subfield code="a">JOB PACKING: OPTIMIZED CONFIGURATION FOR JOB SCHEDULING</subfield> </datafield> <datafield tag="100" ind1=" " ind2=" "> <subfield code="a">Dal Pra, Stefano</subfield> <subfield code="u">INFN-CNAF</subfield> <subfield code="0">(orcid)0000-0002-1057-2307</subfield> </datafield> <datafield tag="540" ind1=" " ind2=" "> <subfield code="u">https://creativecommons.org/licenses/by/4.0/</subfield> <subfield code="a">Creative Commons Attribution 4.0</subfield> </datafield> <datafield tag="260" ind1=" " ind2=" "> <subfield code="c">2014-12-16</subfield> </datafield> <datafield tag="856" ind1="4" ind2=" "> <subfield code="s">899259</subfield> <subfield code="u">https://www.openaccessrepository.it/record/143357/files/INFN-14-19-CCR.pdf</subfield> <subfield code="z">md5:6bb665129f3afb9c965b54082d9fccfe</subfield> </datafield> <datafield tag="773" ind1=" " ind2=" "> <subfield code="a">10.15161/oar.it/143356</subfield> <subfield code="i">isVersionOf</subfield> <subfield code="n">doi</subfield> </datafield> </record>
All versions | This version | |
---|---|---|
Views | 0 | 0 |
Downloads | 0 | 0 |
Data volume | 0 Bytes | 0 Bytes |
Unique views | 0 | 0 |
Unique downloads | 0 | 0 |