Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Phil Trinder"'
Publikováno v:
International Journal of Parallel Programming. 51:83-106
Exact combinatorial search is essential to a wide range of important applications, and there are many large problems that need to be solved quickly. Searches are extremely challenging to parallelise due to a combination of factors, e.g. searches are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0157f0c31e82ea4c73b842c47d7fd0dc
https://doi.org/10.1007/s10766-022-00744-3
https://doi.org/10.1007/s10766-022-00744-3
Publikováno v:
ACM Transactions on Internet of Things, 4, 1-35
ACM Transactions on Internet of Things, 4, 1, pp. 1-35
ACM Transactions on Internet of Things, 4, 1, pp. 1-35
Internet of Things (IoT) software is notoriously complex, conventionally comprising multiple tiers. Traditionally an IoT developer must use multiple programming languages and ensure that the components interoperate correctly. A novel alternative is t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9101460636eb053f7f2d1e4db5bc0fa0
http://hdl.handle.net/2066/287347
http://hdl.handle.net/2066/287347
Publikováno v:
Autonomous Robots. 45:351-369
Modern multi-robot systems often need to solve computationally intensive tasks but operate with limited compute resources and in the presence of failures. Cooperating to share computational tasks between robots at the edge reduces execution time. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d19c396e5e8603ae791b4ef8c98bad43
https://doi.org/10.1007/s10514-021-09967-8
https://doi.org/10.1007/s10514-021-09967-8
Publikováno v:
Proceedings of the 18th International Conference on Web Information Systems and Technologies.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7171b74b2e42ba23f1887141b1940a9c
https://doi.org/10.5220/0011381700003318
https://doi.org/10.5220/0011381700003318
Publikováno v:
FHPNC@ICFP
As the number of cores increases Non-Uniform Memory Access (NUMA) is becoming increasingly prevalent in general purpose machines. Effectively exploiting NUMA can significantly reduce memory access latency and thus runtime by 10-20%, and profiling pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5b8eeacee3574f802844b52488e135d
https://eprints.gla.ac.uk/245275/2/245275.pdf
https://eprints.gla.ac.uk/245275/2/245275.pdf
Publikováno v:
DLS
Execution times may be reduced by offloading parallel loop nests to a GPU. Auto-parallelizing compilers are common for static languages, often using a cost model to determine when the GPU execution speed will outweigh the offload overheads. Nowadays
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f1d9958ea3bddf148e4c1f9a3297efc0
https://eprints.gla.ac.uk/226320/1/226320.pdf
https://eprints.gla.ac.uk/226320/1/226320.pdf
Publikováno v:
PPoPP
Combinatorial search is central to many applications, yet the huge irregular search trees and the need to respect search heuristics make it hard to parallelise. We aim to improve the reuse of intricate parallel search implementations by providing the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a73aae6ceab20e76cd962de51f41c016
https://doi.org/10.1145/3332466.3374537
https://doi.org/10.1145/3332466.3374537
Autor:
Danail Penev, Phil Trinder
Publikováno v:
WEBIST
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5563c9deeceaa97acb59d1a1dec9cfb1
https://doi.org/10.5220/0010017200510058
https://doi.org/10.5220/0010017200510058
Autor:
José Cano, Phil Trinder
This book constitutes the proceedings of the 33rd International Conference on Parallel and Distributed Computing, Euro-Par 2022, held in GLasgow, UK, in August 2022.The 25 full papers presented in this volume were carefully reviewed and selected from
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030293994
Euro-Par
Euro-Par
Combinatorial search is central to many applications yet\ud hard to parallelise. We argue for improving the reuse of parallel searches,\ud and present the design and implementation of a new parallel search\ud framework. YewPar generalises search by a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2994f731cb128652d3454650fb6d7bd
https://shura.shu.ac.uk/24769/1/Archibald_Maier_Stewart_Trinder_EuroPar19_accepted.pdf
https://shura.shu.ac.uk/24769/1/Archibald_Maier_Stewart_Trinder_EuroPar19_accepted.pdf