Zobrazeno 1 - 10
of 117
pro vyhledávání: '"Peter Kilpatrick"'
Publikováno v:
2022 IEEE International Conference on Edge Computing and Communications (EDGE).
Partitioning and deploying Deep Neural Networks (DNNs) across edge nodes may be used to meet performance objectives of applications. However, the failure of a single node may result in cascading failures that will adversely impact the delivery of the
Publikováno v:
Koohi Esfahani, M, Kilpatrick, P & Vandierendonck, H 2022, MASTIFF: structure-aware minimum spanning tree/forest . in Proceedings of the 36th ACM International Conference on Supercomputing, ICS 2022 ., 9, ACM International Conference on Supercomputing: Proceedings, Association for Computing Machinery, 36th ACM International Conference on Supercomputing, virtual, online, 28/06/2022 . https://doi.org/10.1145/3524059.3532365
The Minimum Spanning Forest (MSF) problem finds usage in many different applications. While theoretical analysis shows that linear-time solutions exist, in practice, parallel MSF algorithms remain computationally demanding due to the continuously inc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3c91aba25805a40f130055033736f7f
https://pure.qub.ac.uk/en/publications/456f85fe-6f36-4d50-a61d-2ee0feb97265
https://pure.qub.ac.uk/en/publications/456f85fe-6f36-4d50-a61d-2ee0feb97265
Publikováno v:
2022 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS).
Autor:
Mark Price, Wei Zhang, Imelda Friel, Trevor Robinson, Roisin McConnell, Declan Nolan, Peter Kilpatrick, Sakil Barbhuiya, Stephen Kyle
Publikováno v:
Price, M, Zhang, W, Friel, I, Robinson, T T, McConnell, R, Nolan, D, Kilpatrick, P, Barbhuiya, S & Kyle, S 2022, ' Generative design for additive manufacturing using a biological development analogy ', Journal of Computational Design and Engineering, vol. 9, no. 2, pp. 463–479 . https://doi.org/10.1093/jcde/qwac016
The transformation in manufacturing capability being driven by new processes, such as additive manufacturing, offers huge potential for product innovation and opportunity to create bespoke designs tailored to individual specifications or needs. Howev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3b3894cac81de6f36a69eec7e1c052c
https://pure.qub.ac.uk/en/publications/ed3a3db9-69eb-4175-aa7c-da7a9e80ef06
https://pure.qub.ac.uk/en/publications/ed3a3db9-69eb-4175-aa7c-da7a9e80ef06
Autor:
Gabriele Mencagli, Peter Kilpatrick, Massimo Torquati, Marco Danelutto, Horacio González–Vélez
Publikováno v:
Danelutto, M, Mencagli, G, Torquati, M, González–Vélez, H & Kilpatrick, P 2020, ' Algorithmic Skeletons and Parallel Design Patterns in Mainstream Parallel Programming ', International Journal of Parallel Programming . https://doi.org/10.1007/s10766-020-00684-w
This paper discusses the impact of structured parallel programming methodologies in state-of-the-art industrial and research parallel programming frameworks. We first recap the main ideas underpinning structured parallel programming models and then p
Publikováno v:
Koohi Esfahani, M, Kilpatrick, P & Vandierendonck, H 2022, LOTUS: Locality Optimizing Triangle Counting . in 27th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (PPoPP 2022): Proceedings . Association for Computing Machinery, pp. 219-233 . https://doi.org/10.1145/3503221.3508402
Triangle Counting (TC) is a basic graph mining problem with numerous applications. However, the large size of real-world graphs has a severe effect on TC performance.This paper studies the TC algorithm from the perspective of memory utilization. We i
Publikováno v:
Koohi Esfahani, M, Kilpatrick, P & Vandierendonck, H 2021, Locality Analysis of Graph Reordering Algorithms . in 2021 IEEE International Symposium on Workload Characterization (IISWC'21) . IEEE Computer Society . https://doi.org/10.1109/IISWC53511.2021.00020
A major challenge in processing real-world graphs stems from poor locality of memory accesses and vertex reordering algorithms (RAs) have been proposed to improve locality by changing the order of memory accesses.While state-of-the-art RAs like Slash
Autor:
Schahram Dustdar, Francis McNamee, Blesson Varghese, Ivor Spence, Peter Kilpatrick, Weisong Shi
Publikováno v:
CLOUD
Deep Neural Networks (DNNs) are an application class that benefit from being distributed across the edge and cloud. A DNN is partitioned such that specific layers of the DNN are deployed onto the edge and the cloud to meet performance and privacy obj
Publikováno v:
CLUSTER
Koohi Esfahani, M, Kilpatrick, P & Vandierendonck, H 2021, Thrifty label propagation: fast connected components for skewed-degree graphs . in Proceedings of the IEEE International Conference on Cluster Computing, CLUSTER'21 . IEEE International Conference on Cluster Computing: Proceedings, Institute of Electrical and Electronics Engineers Inc., IEEE International Conference on Cluster Computing, Portland, Oregon, United States, 07/09/2021 . https://doi.org/10.1109/Cluster48925.2021.00042
Koohi Esfahani, M, Kilpatrick, P & Vandierendonck, H 2021, Thrifty label propagation: fast connected components for skewed-degree graphs . in Proceedings of the IEEE International Conference on Cluster Computing, CLUSTER'21 . IEEE International Conference on Cluster Computing: Proceedings, Institute of Electrical and Electronics Engineers Inc., IEEE International Conference on Cluster Computing, Portland, Oregon, United States, 07/09/2021 . https://doi.org/10.1109/Cluster48925.2021.00042
Various concurrent algorithms have been proposed in the literature in recent years that mostly focus on the disjoint set approach to the Connected Components (CC) algorithm. However, these CC algorithms do not take the skewed structure of real-world
Publikováno v:
Koohi Esfahani, M, Kilpatrick, P & Vandierendonck, H 2021, Exploiting in-Hub Temporal Locality in SpMV-based Graph Processing . in 50th International Conference on Parallel Processing (ICPP 2021): Proceedings ., 42, Association for Computing Machinery, New York, NY, USA . https://doi.org/10.1145/3472456.3472462
ICPP
ICPP
The skewed degree distribution of real-world graphs is the main source of poor locality in traversing all edges of the graph, known as Sparse Matrix-Vector (SpMV) Multiplication. Conventional graph traversal methods, such as push and pull, traverse a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b938b51978ff16ae92ef8575e4cc8500
https://pure.qub.ac.uk/en/publications/de1085f1-827d-4814-af10-bff30d9f4702
https://pure.qub.ac.uk/en/publications/de1085f1-827d-4814-af10-bff30d9f4702