In search of a map: using program slicing to discover potential parallelism in recursive functions-Reference-Cited by-同舟云学术

In search of a map: using program slicing to discover potential parallelism in recursive functions

Published:2017-09-07 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 6th ACM SIGPLAN International Workshop on Functional High-Performance Computing
language:
Short-container-title:

Author:

Barwell Adam D.¹,Hammond Kevin¹

Affiliation:

1. University of St. Andrews, UK

Funder

Engineering and Physical Sciences Research Council

Scottish Enterprise

Horizon 2020 Framework Programme

European Cooperation in Science and Technology

FP7 Ideas: European Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3122948.3122951

Reference38 articles.

1. AN ANALYTICAL METHOD FOR PARALLELIZATION OF RECURSIVE FUNCTIONS

2. Towards semi-automatic data-type translation for parallelism in Erlang

3. Using Program Shaping and Algorithmic Skeletons to Parallelise an Evolutionary Multi-Agent System in Erlang;Barwell Adam D.;Computing and Informatics,2016

4. Adam D. Barwell and Kevin Hammond. 2017. Obliterating Obstructions: Discovering Potential Parallelism by Slicing for Dependencies in Recursive Functions. International Journal of Parallel Programming (2017). In submission. Adam D. Barwell and Kevin Hammond. 2017. Obliterating Obstructions: Discovering Potential Parallelism by Slicing for Dependencies in Recursive Functions. International Journal of Parallel Programming (2017). In submission.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. STCLang: state thread composition as a foundation for monadic dataflow parallelism;Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell - Haskell 2019;2019