The Matrix-Matrix of Cannon In order to swiftly multiply two huge matrices, multiplication is a parallel approach that distributes the work over a number of processors or cores. In particular, ...

Inspired by the outstanding paper "AlphaTensor: Discovering faster matrix multiplication algorithms with reinforcement learning", in this repo I used pyomo library and IPOPT optimizer to solve the ...

Multiplication of two numbers is easy, right? At primary school we learn how to do long multiplication like this: Methods similar to this go back thousands of years, at least to the ancient Sumerians ...

People tend to obsess over making computer software faster. You can, of course, just crank up the clock speed and add more processors, but often the most powerful way to make something faster is to ...

Abstract: Summary form only given. We describe a novel parallel algorithm that implements a dense matrix multiplication operation with algorithmic efficiency equivalent to that of Cannon's algorithm.

Abstract: This paper presents two improved modular multiplication algorithms: variable length Interleaved modular multiplication (VLIM) algorithm and parallel modular multiplication (P_MM) method ...