Year: 1994
Type: article
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.
Source: ACM SIGPLAN Notices
Authors: C. K. Yuen, M. D. Feng
Institution: National University of Singapore
Language: English
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2053698015