Menu: Home :: go to Journal :: switch to Russian :: switch to English
You are here: all Journals and Issues→ Journal→ Issue→ Article

SOME ESTIMATIONS OF PERFORMANCE OF PARALLEL ALGORITHMS FOR SOLVING LARGE LINEAR SYSTEMS OVER GF(2)

Annotation

This topic explains how to estimate the running time and RAM volume required by programs of Wiedemann-Coppersmith algorithm, Montgomery's algorithm, some modifications of them and new algorithm when uploading multiple compute nodes and some other details of these algorithms.

Keywords

fast algorithms; sparce linear systems; parallel algorithms; computer algebra

Full-text in one file

Download

UDC

519.612

Pages

1342-1354

Для корректной работы сайта используйте один из современных браузеров. Например, Firefox 55, Chrome 60 или более новые.