We present three parallel implementations of the Karatsuba algorithm for long integer multiplication on a distributed memory architecture and discuss the experimental results obtained on a Paragon computer. The first two implementations have both time complexity O(n) on n log 2 3 processors, but pre
✦ LIBER ✦
Development and performance analysis of real-world applications for distributed and parallel architectures
✍ Scribed by T. Fahringer; P. Blaha; A. Hössinger; J. Luitz; E. Mehofer; H. Moritsch; B. Scholz
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 438 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1532-0626
- DOI
- 10.1002/cpe.586
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Performance Analysis of the Parallel Kar
✍
GIOVANNI CESARI; ROMAN MAEDER
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 447 KB
MATE: Monitoring, Analysis and Tuning En
✍
A. Morajko; P. Caymes-Scutari; T. Margalef; E. Luque
📂
Article
📅
2007
🏛
John Wiley and Sons
🌐
English
⚖ 174 KB
Calls for Papers: Special Issue of theJo
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 16 KB
Design and Performance of Parallel and D
✍
Steven Homer; Marcus Peinado
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 327 KB
We develop and experiment with a new parallel algorithm to approximate the maximum weight cut in a weighted undirected graph. Our implementation starts with the recent (serial) algorithm of Goemans and Williamson for this problem. We consider several different versions of this algorithm, varying the
Implementation and performance evaluatio
✍
Shigeki Yamada; Satoshi Tanaka; Akira Tanaka; Ryo Mukai
📂
Article
📅
2001
🏛
John Wiley and Sons
🌐
English
⚖ 561 KB
An analysis of VI Architecture primitive
✍
Andrew Begel; Philip Buonadonna; David E. Culler; David Gay
📂
Article
📅
2002
🏛
John Wiley and Sons
🌐
English
⚖ 373 KB