From post

Achieving Memory Scalability in the Gysela Code to Fit Exascale Constraints.

, , и . PPAM (2), том 8385 из Lecture Notes in Computer Science, стр. 185-195. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Scheduling loops with partial loop-carried dependencies., , и . Parallel Comput., 26 (13-14): 1789-1806 (2000)Parallel sparse linear algebra and application to structural mechanics., , , , , и . Numer. Algorithms, 24 (4): 371-391 (2000)Toward memory scalability of GYSELA code for extreme scale computers., , , и . Concurr. Comput. Pract. Exp., 27 (4): 994-1009 (2015)PRFX: a runtime library for high performance programming on clusters of SMP nodes., , и . PARCO, том 13 из Advances in Parallel Computing, стр. 569-576. Elsevier, (2003)On Using an Hybrid MPI-Thread Programming for the Implementation of a Parallel Sparse Direct Solver on a Network of SMP Nodes., , и . PPAM, том 3911 из Lecture Notes in Computer Science, стр. 1050-1057. Springer, (2005)Hybrid MPI-Thread Implementation on a Cluster of SMP Nodes of a Parallel Simulator for the Propagation of Powdery Mildew in a Vineyard., , и . HPCC, том 4208 из Lecture Notes in Computer Science, стр. 833-842. Springer, (2006)PaStiX: A Parallel Sparse Direct Solver Based on a Static Scheduling for Mixed 1D/2D Block Distributions., , и . IPDPS Workshops, том 1800 из Lecture Notes in Computer Science, стр. 519-527. Springer, (2000)Hybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix Ordering., , и . IPPS/SPDP Workshops, том 1586 из Lecture Notes in Computer Science, стр. 986-995. Springer, (1999)On finding approximate supernodes for an efficient block-ILU(k., , и . Parallel Comput., 34 (6-8): 345-362 (2008)Parallel algebraic domain decomposition solver for the solution of augmented systems., , , , и . Adv. Eng. Softw., (2013)