The University of Southampton
University of Southampton Institutional Repository

A message-passing approach to decentralised parallel machine scheduling

A message-passing approach to decentralised parallel machine scheduling
A message-passing approach to decentralised parallel machine scheduling
This paper tackles the problem of parallelizing heterogeneous computational tasks across a number of computational nodes (aka agents) where each agent may not be able to perform all the tasks and may have different computational speeds. An equivalent problem can be found in operations research, and it is known as scheduling tasks on unrelated parallel machines (also known as R?Cmax). Given this equivalence observation, we present the spanning tree decentralized task distribution algorithm (ST-DTDA), the first decentralized solution to R?Cmax. ST-DTDA achieves decomposition by means of the min–max algorithm, a member of the generalized distributive law family, that performs inference by message-passing along the edges of a graphical model (known as a junction tree). Specifically, ST-DTDA uses min–max to optimally solve an approximation of the original R?Cmax problem that results from eliminating possible agent-task allocations until it is mapped into an acyclic structure. To eliminate those allocations that are least likely to have an impact on the solution quality, ST-DTDA uses a heuristic approach. Moreover, ST-DTDA provides a per-instance approximation ratio that guarantees that the makespan of its solution (optimal in the approximated R?Cmax problem) is not more than a factor ? times the makespan of the optimal of the original problem. In our empirical evaluation of ST-DTDA, we show that ST-DTDA, with a min-regret heuristic, converges to solutions that are between 78 and 95% optimal whilst providing approximation ratios lower than 3.
856-874
Vinyals, Meritxell
85e88e6d-4613-4c81-ac45-45d30c6f8580
Macarthur, Kathryn
4c7db797-1679-4fd1-9dac-26f84bd5debd
Farinelli, Alessandro
1d096018-a929-4ff4-9b2a-308458863213
Ramchurn, Sarvapali
1d62ae2a-a498-444e-912d-a6082d3aaea3
Jennings, Nicholas R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Vinyals, Meritxell
85e88e6d-4613-4c81-ac45-45d30c6f8580
Macarthur, Kathryn
4c7db797-1679-4fd1-9dac-26f84bd5debd
Farinelli, Alessandro
1d096018-a929-4ff4-9b2a-308458863213
Ramchurn, Sarvapali
1d62ae2a-a498-444e-912d-a6082d3aaea3
Jennings, Nicholas R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30

Vinyals, Meritxell, Macarthur, Kathryn, Farinelli, Alessandro, Ramchurn, Sarvapali and Jennings, Nicholas R. (2014) A message-passing approach to decentralised parallel machine scheduling. The Computer Journal, 57 (6), 856-874. (doi:10.1093/comjnl/bxt140).

Record type: Article

Abstract

This paper tackles the problem of parallelizing heterogeneous computational tasks across a number of computational nodes (aka agents) where each agent may not be able to perform all the tasks and may have different computational speeds. An equivalent problem can be found in operations research, and it is known as scheduling tasks on unrelated parallel machines (also known as R?Cmax). Given this equivalence observation, we present the spanning tree decentralized task distribution algorithm (ST-DTDA), the first decentralized solution to R?Cmax. ST-DTDA achieves decomposition by means of the min–max algorithm, a member of the generalized distributive law family, that performs inference by message-passing along the edges of a graphical model (known as a junction tree). Specifically, ST-DTDA uses min–max to optimally solve an approximation of the original R?Cmax problem that results from eliminating possible agent-task allocations until it is mapped into an acyclic structure. To eliminate those allocations that are least likely to have an impact on the solution quality, ST-DTDA uses a heuristic approach. Moreover, ST-DTDA provides a per-instance approximation ratio that guarantees that the makespan of its solution (optimal in the approximated R?Cmax problem) is not more than a factor ? times the makespan of the optimal of the original problem. In our empirical evaluation of ST-DTDA, we show that ST-DTDA, with a min-regret heuristic, converges to solutions that are between 78 and 95% optimal whilst providing approximation ratios lower than 3.

Text The Computer Journal-2013-Vinyals-comjnl_bxt140.pdf - Other
Download (809kB)

More information

e-pub ahead of print date: 3 December 2013
Published date: 2014
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 360818
URI: https://eprints.soton.ac.uk/id/eprint/360818
PURE UUID: 3482fb27-a698-4dd2-bef1-3c1f1ddcd467
ORCID for Sarvapali Ramchurn: ORCID iD orcid.org/0000-0001-9686-4302

Catalogue record

Date deposited: 28 Dec 2013 17:11
Last modified: 08 Jun 2018 00:33

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×