Parallel multiplication: a case study in parallel programming

Authors:
C. K. Yuen;M. D. Feng
Affiliations:
Department oflnformation Systems and Computer Science, National University of Singapore, Kent Ridge, Singapore;Department oflnformation Systems and Computer Science, National University of Singapore, Kent Ridge, Singapore
Venue:
ACM SIGPLAN Notices
Year:
1994

Citing 8
Cited 0

Linda in context

Communications of the ACM
Speculative computation in Multilisp

Proceedings of the US/Japan workshop on Parallel Lisp on Parallel Lisp: languages and systems
Computational models for parallel computers

Scientific applications of multiprocessors
Program development by stepwise refinement

Communications of the ACM
Parallel LISP Systems: A Study of Languages and Architectures

Parallel LISP Systems: A Study of Languages and Architectures
Software Engineering

Software Engineering
A Discipline of Programming

A Discipline of Programming
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.