|
954.
|
|
|
The NVBLAS Library is a GPU-accelerated Library that implements BLAS (Basic Linear Algebra Subprograms). It can accelerate most BLAS Level-3 routines by dynamically routing BLAS calls to one or more NVIDIA GPUs present in the system, when the characteristics of the call make it to speedup on a GPU.
|
|
|
Description
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: libnvblas12
|
|
955.
|
|
|
NVIDIA Graph Analytics library (nvGRAPH)
|
|
|
Summary
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: libnvgraph10
|
|
956.
|
|
|
The NVIDIA Graph Analytics library (nvGRAPH) comprises of parallel algorithms for high performance analytics on graphs with up to 2 billion edges. nvGRAPH makes it possible to build interactive and high throughput graph analytics applications.
|
|
|
Description
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: libnvgraph10
|
|
957.
|
|
|
nvGRAPH supports three widely-used algorithms:
* [Page Rank] is most famously used in search engines, and also used in
social network analysis, recommendation systems, and for novel uses
in natural science when studying the relationship between proteins
and in ecological networks.
* [Single Source Shortest Path] is used to identify the fastest path from
A to B through a road network, and can also be used for a optimizing
a wide range of other logistics problems.
* [Single Source Widest Path] is used in domains like IP traffic routing
and traffic-sensitive path planning.
|
|
|
Description
|
|
|
represents a line break.
Start a new line in the equivalent position in the translation.
|
|
|
represents a space character.
Enter a space in the equivalent position in the translation.
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: libnvgraph10
|
|
958.
|
|
|
In addition, the nvGRAPH semi-ring SPMV operations can be used to build a wide range of innovative graph traversal algorithms.
|
|
|
Description
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: libnvgraph10
|
|
959.
|
|
|
nvGRAPH accelerates analysis of large graphs by making efficient use of the massive parallelism available in NVIDIA Tesla GPUs. The size of a graph in memory is dominated by the number of edges. An M40 with 24 GB can support a graph of up to 2 billion edges.
|
|
|
Description
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: libnvgraph10
|
|
960.
|
|
|
CUDA Runtime Compilation (NVIDIA NVRTC Library)
|
|
|
Summary
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: libnvrtc12
|
|
961.
|
|
|
CUDA Runtime Compilation library (nvrtc) provides an API to compile CUDA-C++ device source code at runtime.
|
|
|
Description
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: libnvrtc12
Package: libnvrtc-builtins12.0
|
|
962.
|
|
|
The resulting compiled PTX can be launched on a GPU using the CUDA Driver API.
|
|
|
Description
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: libnvrtc12
Package: libnvrtc-builtins12.0
|
|
963.
|
|
|
This package contains the NVRTC library.
|
|
|
Description
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: libnvrtc12
|