Slow Integer Matrix Multiplication

Open
#732 2 comments 1 reaction 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
25/100
Issue type
Feature
Clarity
Needs clarification
Activity status
Stale
Tech stack
rust
Domain
performance

Research direction

Start by reproducing the 1000x1000 comparison in the linked Rust playground, then inspect the repository's integer and floating-point matrix multiplication entry points. Done means integer multiplication has a demonstrated performance improvement without regressions, supported by relevant benchmark or test results.

Written by the indexing model from the issue text.

Description

information needed

Currently matrix multiplications are a lot slower for integer matrices than for float matrices, because for floats either BLAS or matrixmultiply is used.

E.g. here for a 1000x1000 matrix the integer version takes more than 5 times as long as the float version and this get worse when the matrix size increases.

Is there anything planned for fast integer matrix multiplications? Or any way I can help to improve this situation?

Dominant language
Rust
Stars
4.3k
Forks
391
No merged PRs in 30d

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from rust-ndarray/ndarray

All issues in rust-ndarray/ndarray

Similar issues

More Rust issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.