Search Results for "device"

...CUTLASS decomposes these "moving parts" into reusable, modular software components abstracted by C++ template classes. These thread-wide, warp-wide, block-wide, and device-wide primitives can be specialized and tuned via custom tiling sizes, data types, and other algorithmic policy. The resulting flexibility simplifies their use as building blocks within custom kernels and applications. To support a wide variety of applications, CUTLASS provides extensive support for mixed-precision computations, providing specialized data-movement and multiply-accumulate abstractions for half-precision floating point (FP16), BFloat16 (BF16), Tensor Float 32 (TF32), etc.

...By using LAMA for their application, software developers benefit from higher productivity and stay up to date with the latest hardware innovations, both leading to shorter time-to-market. The framework supports multiple target platforms within a distributed heterogeneous environment. It offers optimized device code on the backend side, high scalability through latency hiding and asynchronous execution across multiple nodes. LAMA's modular and extensible software design supports the developer on several levels, regardless of whether writing his own portable code with the Heterogeneous Computing Development Kit or using prepared functionality from the Linear Algebra Package, the user always gains high productivity and maximum performance.

ViennaCL provides high level C++ interfaces for linear algebra routines on CPUs and GPUs using CUDA, OpenCL, and OpenMP. The focus is on generic implementations of iterative solvers often used for large linear systems and simple integration into existing projects.

...In the end, it prints out the set of largest frequency tuples that were still found significant. The GPU computing is implemented through CUDA and brings a significant performance increase. It is still possible to run FreDec solely on CPU, if no suitable GPU device is available in the system. See the details of the underlying theory in Baluev 2013, MNRAS, V. 436, P. 807 The description of the algorithm itself can be found in arXiv:1309.0100. Please go to the project forum to report any bugs.