Collas, M. (2005). Resource Allocation on Sparse Graphs. Masters thesis, Aston University.
Abstract
Considering a network of workers represented by a sparse graph where each worker (ie. node) has a specific load of small independent jobs, our aim is to move the jobs around such that all tasks will be carried out while the communication is minimized. We examine the performance of a new algorithm based on message passing methods in comparison with a standard quadratic programming based algorithm.
| Publication DOI: | https://doi.org/10.48780/publications.aston.ac.uk.00021448 |
|---|---|
| Divisions: | College of Engineering & Physical Sciences |
| Additional Information: | Copyright © M. Collas, 2005. M. Collas asserts their moral right to be identified as the author of this thesis. This copy of the thesis has been supplied on condition that anyone who consults it is understood to recognise that its copyright rests with its author and that no quotation from the thesis and no information derived from it may be published without appropriate permission or acknowledgement. If you have discovered material in Aston Publications Explorer which is unlawful e.g. breaches copyright, (either yours or that of a third party) or any other law, including but not limited to those relating to patent, trademark, confidentiality, data protection, obscenity, defamation, libel, then please read our Takedown Policy and contact the service immediately. |
| Institution: | Aston University |
| Uncontrolled Keywords: | resource allocation,sparse graphs,information engineering |
| Last Modified: | 11 Apr 2025 14:14 |
| Date Deposited: | 19 Mar 2014 11:30 |
| Completed Date: | 2005-09 |
| Authors: |
Collas, M.
|
![[img]](https://publications.aston.ac.uk/style/images/fileicons/text.png)