Author:
Nather Rüdiger,Fohry Claudia
Publisher
Springer Nature Switzerland
Reference17 articles.
1. Aiken, A., Bauer, M.: Programming with Legion (2023). https://legion.stanford.edu/pdfs/legion-manual.pdf. Accessed 27 Feb 2024
2. Aliaga, J.I., Carratalá-Sáez, R., Kriemann, R., Quintana-Ortí, E.S.: Task-parallel LU factorization of hierarchical matrices using OmpSs. In: IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 1148–1157 (2017). https://doi.org/10.1109/IPDPSW.2017.124
3. Augonnet, C., Goudin, D., Kuhn, M., Lacoste, X., Namyst, R., Ramet, P.: A hierarchical fast direct solver for distributed memory machines with manycore nodes. Technical report, CEA/DAM, Total E &P, Université de Bordeaux (2019). https://cea.hal.science/cea-02304706
4. Baker, H.C., Hewitt, C.: The incremental garbage collection of processes. ACM SIGART Bull. 64, 55–59 (1977). https://doi.org/10.1145/872736.806932
5. Blelloch, G.E., Reid-Miller, M.: Pipelining with futures. In: Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA) (1997). https://doi.org/10.1145/258492.258517