ePrints

Modelling job allocation where service duration is unknown

Lookup NU author(s): Dr Nigel Thomas

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

In this paper a novel job allocation scheme in distributed systems (TAG) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size and has been shown to be more efficient than round robin and random allocation when the job size distribution is heavy tailed and the load is not high. In this paper the job size distribution is assumed to be of a phase-type and the queues are bounded. Numerical results are derived and compared with those derived from models employing random allocation and the shortest queue strategy. It is shown that TAG can perform well for a range of performance metrics. © 2006 IEEE.

Publication metadata

Author(s): Thomas N

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Year of Conference: 2006

Pages: 10p

Publisher: IEEE

URL: http://dx.doi.org/10.1109/IPDPS.2006.16396291109

DOI: 10.1109/IPDPS.2006.1639629

Library holdings: Search Newcastle University Library for this item

ISBN: 1424400546

Share