Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Dissertation (MSc(Computer Science))--University of Pretoria, 2016.
| Other Authors: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
University of Pretoria
2018
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613695177129984 |
|---|---|
| access_status_str | Open Access |
| author2 | Engelbrecht, Andries P. |
| author_browse | Engelbrecht, Andries P. |
| author_facet | Engelbrecht, Andries P. |
| collection | Thesis |
| dc_rights_str_mv | © 2018 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. |
| description | Dissertation (MSc(Computer Science))--University of Pretoria, 2016. |
| format | Thesis |
| id | oai:repository.up.ac.za:2263/66340 |
| institution | University of Pretoria (South Africa) |
| language | English |
| last_indexed | 2026-06-10T12:40:13.972Z |
| license_str | Other — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from UPSpace — University of Pretoria Institutional Repository |
| publishDate | 2018 |
| publishDateRange | 2018 |
| publishDateSort | 2018 |
| publisher | University of Pretoria |
| publisherStr | University of Pretoria |
| record_format | dspace |
| source_str | UPSpace — University of Pretoria Institutional Repository |
| spelling | oai:repository.up.ac.za:2263/66340 Ant-inspired strategies for opportunistic load balancing in the distributed computation of solutions to embarrassingly parallel problems Engelbrecht, Andries P. rklazar@icloud.com Klazar, Ronald ant algorithms cemetery formation division of labour distributed systems distributed computing load balancing Engineering, built environment and information technology theses SDG-09 Dissertation (MSc(Computer Science))--University of Pretoria, 2016. Computational science is a practice that requires a large amount of computing time. One means of providing the required computing time is to construct a distributed computing system that utilises the ordinary desktop computers found within an organisation. However, when the constituent computers do not all perform computations at the same speed, the overall completion time of a project involving the execution of tasks by all of the computers in the system becomes dependent on the performance of the slowest computer in the network. This study proposes two ant-inspired algorithms for dynamic task allocation that aim to overcome the aforementioned dependency. A procedure for tuning the free parameters of the algorithms is specified and the algorithms are evaluated for their viability in terms of their effect on the overall completion time of tasks as well as their usage of bandwidth in the network. bs2026 Computer Science MSc(Computer Science) Unrestricted SDG-09: Industry, innovation and infrastructure 2018-08-27T12:38:20Z 2018-08-27T12:38:20Z 2016-09-01 2016 Dissertation Klazar, R 2016, Ant-Inspired Strategies for Opportunistic Load Balancing in the Distributed Computation of Solutions to Embarrassingly Parallel Problems, MSc dissertation, University of Pretoria, Pretoria http://hdl.handle.net/2263/66340 en © 2018 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. application/pdf University of Pretoria |
| spellingShingle | ant algorithms cemetery formation division of labour distributed systems distributed computing load balancing Engineering, built environment and information technology theses SDG-09 Ant-inspired strategies for opportunistic load balancing in the distributed computation of solutions to embarrassingly parallel problems |
| title | Ant-inspired strategies for opportunistic load balancing in the distributed computation of solutions to embarrassingly parallel problems |
| title_full | Ant-inspired strategies for opportunistic load balancing in the distributed computation of solutions to embarrassingly parallel problems |
| title_fullStr | Ant-inspired strategies for opportunistic load balancing in the distributed computation of solutions to embarrassingly parallel problems |
| title_full_unstemmed | Ant-inspired strategies for opportunistic load balancing in the distributed computation of solutions to embarrassingly parallel problems |
| title_short | Ant-inspired strategies for opportunistic load balancing in the distributed computation of solutions to embarrassingly parallel problems |
| title_sort | ant inspired strategies for opportunistic load balancing in the distributed computation of solutions to embarrassingly parallel problems |
| topic | ant algorithms cemetery formation division of labour distributed systems distributed computing load balancing Engineering, built environment and information technology theses SDG-09 |
| url | http://hdl.handle.net/2263/66340 |