cc_staff
153
edits
No edit summary |
No edit summary |
||
Line 1,627: | Line 1,627: | ||
| align="center" | [https://github.com/NVIDIA/gdrcopy gdrcopy] | | align="center" | [https://github.com/NVIDIA/gdrcopy gdrcopy] | ||
| align="center" | - | | align="center" | - | ||
| align="center" | 2.1 | | align="center" | 2.1, 2.3.1 | ||
| <div class="mw-collapsible mw-collapsed" style="white-space: pre-line;"><br />Description: A low-latency GPU memory copy library based on NVIDIA GPUDirect RDMA technology. Homepage: https://github.com/NVIDIA/gdrcopy URL: https://github.com/NVIDIA/gdrcopy<br /><br /><br /></div> | | <div class="mw-collapsible mw-collapsed" style="white-space: pre-line;"><br />Description: A low-latency GPU memory copy library based on NVIDIA GPUDirect RDMA technology. Homepage: https://github.com/NVIDIA/gdrcopy URL: https://github.com/NVIDIA/gdrcopy<br /><br /><br /></div> | ||
|- | |- | ||
Line 1,768: | Line 1,768: | ||
| align="center" | tools | | align="center" | tools | ||
| align="center" | 0.3.1 | | align="center" | 0.3.1 | ||
| <div class="mw-collapsible mw-collapsed" style="white-space: pre-line;"><br />Description: This is GLOST, the Greedy Launcher Of Small Tasks. Homepage | | <div class="mw-collapsible mw-collapsed" style="white-space: pre-line;"><br />Description: This is GLOST, the Greedy Launcher Of Small Tasks. Homepage: https://github.com/cea-hpc/glost Keyword:tools<br /><br /><br /></div> | ||
|- | |- | ||
| align="center" | [https://www.gnu.org/software/glpk/ glpk] | | align="center" | [https://www.gnu.org/software/glpk/ glpk] | ||
Line 2,968: | Line 2,968: | ||
| align="center" | math | | align="center" | math | ||
| align="center" | 4.0.3, 5.1.0 | | align="center" | 4.0.3, 5.1.0 | ||
| <div class="mw-collapsible mw-collapsed" style="white-space: pre-line;"><br />Description: METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes. Homepage | | <div class="mw-collapsible mw-collapsed" style="white-space: pre-line;"><br />Description: METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes. Homepage: http://glaros.dtc.umn.edu/gkhome/metis/metis/overview Keyword:math<br /><br /><br /></div> | ||
|- | |- | ||
| align="center" | [http://glaros.dtc.umn.edu/gkhome/metis/metis/overview metis-64idx] | | align="center" | [http://glaros.dtc.umn.edu/gkhome/metis/metis/overview metis-64idx] |