1994
DOI: 10.1145/181587.181589
| |Summarize |Cite
|
Sign up to set email alerts

Parallel multiplication

Abstract: Six versions of a parallel program for multiplication are presented, and compared in terms of their efficiencies. They illustrate the bottom up and top down methods of program structure design, and the use of tuplespace and speculative processing in parallel programming. The ideas are also applicable to general AND/OR parallel problems.

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
0
0

Citation Types

0
2
0
0

Year Published

Range
2020
2020
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 7 publications

0
2
0
0
Order By: Relevance
How the paper below cites the one you are viewing
“…The second direction has been to reduce the cost of multiplying the data set by proposing an efficient strategy to multiply the ݉ numbers. Regarding the first research direction, many methods have been proposed to reduce the time complexity of multiplying two integers in both sequential [7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23] and parallel computation [24][25][26][27][28][29]. In the case of sequential computation, several techniques have been proposed such as the Naïve multiplication algorithm [1], Karatsuba's algorithm [1,15], the Toom-Cook multiplication algorithm [20], and a fast Fourier transform-based algorithm [18].…”
Section: Introduction
mentioning
confidence: 99%
“…On the other hand, many different attempts have been made to parallelize the multiplication problem using different parallel models [24][25][26][27][28][29]. Most of these attempts have been based on the shared memory model, where the processors in this model communicate through shared memory.…”
Section: Introduction
mentioning
confidence: 99%
See 1 more Smart Citation