Technical note Open Access
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd"> <identifier identifierType="DOI">10.15161/oar.it/143357</identifier> <creators> <creator> <creatorName>Dal Pra, Stefano</creatorName> <givenName>Stefano</givenName> <familyName>Dal Pra</familyName> <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="http://orcid.org/">0000-0002-1057-2307</nameIdentifier> <affiliation>INFN-CNAF</affiliation> </creator> </creators> <titles> <title>JOB PACKING: OPTIMIZED CONFIGURATION FOR JOB SCHEDULING</title> </titles> <publisher>INFN Open Access Repository</publisher> <publicationYear>2014</publicationYear> <dates> <date dateType="Issued">2014-12-16</date> </dates> <language>en</language> <resourceType resourceTypeGeneral="Text">Technical note</resourceType> <alternateIdentifiers> <alternateIdentifier alternateIdentifierType="url">https://www.openaccessrepository.it/record/143357</alternateIdentifier> </alternateIdentifiers> <relatedIdentifiers> <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.15161/oar.it/143356</relatedIdentifier> <relatedIdentifier relatedIdentifierType="URL" relationType="IsPartOf">https://www.openaccessrepository.it/communities/infn</relatedIdentifier> </relatedIdentifiers> <rightsList> <rights rightsURI="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0</rights> <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights> </rightsList> <descriptions> <description descriptionType="Abstract"><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></description> </descriptions> </resource>
All versions | This version | |
---|---|---|
Views | 0 | 0 |
Downloads | 0 | 0 |
Data volume | 0 Bytes | 0 Bytes |
Unique views | 0 | 0 |
Unique downloads | 0 | 0 |