Complexity analysis of multidigit multiplication operation for implementtation in parallel computational model
It is analyzed on computing operation of multidigit multiplication of N-digit values based on standard method in parallel computational model the complexity of number of operations of simple additions and multiplications for two cases: when number of available processors is unlimited, and when numbe...
Збережено в:
| Дата: | 2017 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | Ukrainian |
| Опубліковано: |
PROBLEMS IN PROGRAMMING
2017
|
| Теми: | |
| Онлайн доступ: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/133 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Problems in programming |
| Завантажити файл: |  |
Репозитарії
Problems in programming| Резюме: | It is analyzed on computing operation of multidigit multiplication of N-digit values based on standard method in parallel computational model the complexity of number of operations of simple additions and multiplications for two cases: when number of available processors is unlimited, and when number of available processors is limited and multiply N. |
|---|