Parallel Multiplication: A Case Study in Parallel Programming
No Thumbnail Available
Date
1993-11-01T00:00:00Z
Journal Title
Journal ISSN
Volume Title
Publisher
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.