HiPERiSM - High Performance Algorithm Consulting
Example of a comparison for three algorithms used to compute the permanent of (0,1) matrices for orders n=5, 10, 15, 20 on the Cray C90. The three algorithms are: Ryser(R), Nijenhuis and Wilf (NW), and Kallman (K). The Kallman algorithm is more than 24 times faster than NW for n=20, and for the customer requirement it enabled the computation of the permanent for matrices with order n=60 in 15.5 hours on the Cray C90. The Kallman algorithm is an excellent integer/logical serial benchmark for compilers and architectures and some results are given in the technical reports pages and in Computer Physics Communications, 124 (2000), pp. 315-329.
for further examples see the list and downloads on the Technical Reports page.
Efficient Computation
Ryser, Nijenhuis-Wilf, and Kallman algorithms evaluated for (0,1) matrices up to order n=20 on Cray C90.
Kallman's Edge
Kallman outperformed NW by 24x for n=20, enabling permanent computation for n=60 in just 15.5 hours.
Benchmark Standard
Kallman serves as a powerful serial benchmark for compilers and hardware, with published technical report.
We Worked With Reputed Companies in The World
We Evaluated 3 Powerful Algorithms on the Cray C90
Our Pricing Plan
- Powerful Admin Panel
- 1 Native Android App
- Multi-Language Support
- Support via E-mail and Phone
- Powerful Admin Panel
- 2 Native Android App
- Multi-Language Support
- Support via E-mail and Phone
- Powerful Admin Panel
- 3 Native Android App
- Multi-Language Support
- Support via E-mail and Phone
