Skip to main content

Research Repository

Advanced Search

Outputs (329)

An efficient shortest path routing algorithm in the data centre network DPillar (2015)
Presentation / Conference Contribution
Erickson, A., Kiasari, A., Navaridas, J., & Stewart, I. (2015). An efficient shortest path routing algorithm in the data centre network DPillar. In Z. Lu, D. Kim, W. Wu, W. Li, & D. -. Du (Eds.), Combinatorial optimization and applications: 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, proceedings (209-220). https://doi.org/10.1007/978-3-319-26626-8_16

DPillar has recently been proposed as a server-centric data centre network and is combinatorially related to the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving a symm... Read More about An efficient shortest path routing algorithm in the data centre network DPillar.

Routing algorithms for recursively-defined data centre networks (2015)
Presentation / Conference Contribution
Erickson, A., Kiasari, A., Navaridas, J., & Stewart, I. (2015). Routing algorithms for recursively-defined data centre networks. In ISPA 105: The 13th IEEE International Symposium on Parallel and Distributed Processing with Applications (84-91). https://doi.org/10.1109/trustcom.2015.616

The server-centric data centre network architecture can accommodate a wide variety of network topologies. Newly proposed topologies in this arena often require several rounds of analysis and experimentation in order that they might achieve their full... Read More about Routing algorithms for recursively-defined data centre networks.

Accelerating ant colony optimization-based edge detection on the GPU using CUDA (2014)
Presentation / Conference Contribution
Dawson, L., & Stewart, I. (2014). Accelerating ant colony optimization-based edge detection on the GPU using CUDA. In Proceedings of the 2014 IEEE Congress on Evolutionary Computation : July 6-11, 2014, Beijing, China (1736-1743). https://doi.org/10.1109/cec.2014.6900638

Ant Colony Optimization (ACO) is a nature-inspired metaheuristic that can be applied to a wide range of optimization problems. In this paper we present the first parallel implementation of an ACO-based (image processing) edge detection algorithm on t... Read More about Accelerating ant colony optimization-based edge detection on the GPU using CUDA.

On the mathematics of data centre network topologies (2015)
Presentation / Conference Contribution
Stewart, I. (2015). On the mathematics of data centre network topologies. In A. Kosowski, & I. Walukiewicz (Eds.), Fundamentals of computation theory : 20th international symposium, FCT 2015, Gdańsk, Poland, August 17 - 19, 2015 ; proceedings (283-295). https://doi.org/10.1007/978-3-319-22177-9_22

In a recent paper, combinatorial designs were used to construct switch-centric data centre networks that compare favourably with the ubiquitous (enhanced) fat-tree data centre networks in terms of the number of servers within (given a fixed server-to... Read More about On the mathematics of data centre network topologies.

Candidate set parallelization strategies for Ant Colony Optimization on the GPU (2013)
Presentation / Conference Contribution
Dawson, L., & Stewart, I. (2013). Candidate set parallelization strategies for Ant Colony Optimization on the GPU. In J. Kołodziej, B. Di Martino, D. Talia, & K. Xiong (Eds.), 13th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP'13: Vietri sul Mare, Italy, December 18-20, 2013, Proceedings, Part I (216-225). https://doi.org/10.1007/978-3-319-03859-9_18

For solving large instances of the Travelling Salesman Problem (TSP), the use of a candidate set (or candidate list) is essential to limit the search space and reduce the overall execution time when using heuristic search methods such as Ant Colony O... Read More about Candidate set parallelization strategies for Ant Colony Optimization on the GPU.

Improving Ant Colony Optimization performance on the GPU using CUDA. (2013)
Presentation / Conference Contribution
Dawson, L., & Stewart, I. (2013). Improving Ant Colony Optimization performance on the GPU using CUDA. In 2013 IEEE Congress on Evolutionary Computation (CEC 2013): Proceedings of a meeting held 20-23 June 2013, Cancun, Mexico (1901-1908). https://doi.org/10.1109/cec.2013.6557791

We solve the Travelling Salesman Problem (TSP) using a parallel implementation of the Ant System (AS) algorithm for execution on the Graphics Processing Unit (GPU) using NVIDIA CUDA. Extending some recent research, we implement both the tour construc... Read More about Improving Ant Colony Optimization performance on the GPU using CUDA..

Graph editing to a fixed target (2013)
Presentation / Conference Contribution
Golovach, P., Paulusma, D., & Stewart, I. A. (2013). Graph editing to a fixed target. In T. Lecroq, & L. Mouchard (Eds.), Combinatorial algorithms : 24th International Workshop, IWOCA 2013, 10-12 July 2013, Rouen, France ; revised selected papers (192-205). https://doi.org/10.1007/978-3-642-45278-9_17

For a fixed graph H, the H-Minor Edit problem takes as input a graph G and an integer k and asks whether G can be modified into H by a total of at most k edge contractions, edge deletions and vertex deletions. Replacing edge contractions by vertex di... Read More about Graph editing to a fixed target.