Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › Technologies for optimizing sparse matrix code with field-programmable gate arrays

Technologies for optimizing sparse matrix code with field-programmable gate arrays

US Patent 9977663 · Granted May 22, 2018

Estimated economic value: $37,728,000 ⓘ

Assignee

Inventors

View full patent text on Google Patents →

More Patents by These Inventors

Branch prefetch mechanisms for mitigating frontend branch resteers2024
Method and apparatus for supporting programmatic control of a compiler for gener2021
Methods and systems for performing a replay execution2019
Mechanism for facilitating dynamic and efficient management of instruction atomi2019
Methods and systems to identify and reproduce concurrency violations in multi-th2019
Technologies for automatic reordering of sparse matrices2019
Conjugate code generation for efficient dynamic optimizations2019
Detecting root causes of use-after-free memory errors2019
Methods and systems to identify and reproduce concurrency violations in multi-th2019
Techniques for detecting race conditions2018
Apparatus and method for a profiler for hardware transactional memory programs2018
Enabling maximum concurrency in a hybrid transactional memory system2018