Treffer: Cellular recursive algorithm architecture for long integers multiplication in arrays of restricted size
Title:
Cellular recursive algorithm architecture for long integers multiplication in arrays of restricted size
Authors:
Source:
PaCT-99 : parallel computing technologies (St. Petersburg, 6-10 September 1999)Lecture notes in computer science. :371-382
Publisher Information:
Berlin: Springer, 1999.
Publication Year:
1999
Physical Description:
print, 3 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme parallèle, Parallel algorithm, Algoritmo paralelo, Algorithme récursif, Recursive algorithm, Algoritmo recursivo, Analyse algorithme, Algorithm analysis, Análisis algoritmo, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Informatique théorique, Computer theory, Informática teórica, Algorithme cellulaire, Cellular algorithm
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Supercomputer Software Department, ICMMG SB RAS, Pr. lavrentieva, 6, Novosibirsk, 630090, Russian Federation
ISSN:
0302-9743
Rights:
Copyright 1999 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.1826019
Database:
PASCAL Archive
Weitere Informationen
A new cellular recursive algorithm architecture for multiplication of two long binary integers in arrays of restricted size is presented. The new algorithm is based on divide and conquer technique and performed in terms of a model of fine-grained parallelism - Parallel Substitution Algorithm. Time complexity of the new cellular recursive algorithm for multiplication of two long binary integers is obtained.