Parallel Multiplication: A Case Study in Parallel Programming

Simple item page
dc.contributor.authorYuen C Ken_US
dc.contributor.authorFeng M Den_US
dc.date.accessioned2004-10-21T14:28:52Zen_US
dc.date.accessioned2017-01-23T06:59:56Z
dc.date.available2004-10-21T14:28:52Zen_US
dc.date.available2017-01-23T06:59:56Z
dc.date.issued1993-11-01T00:00:00Zen_US
dc.description.abstractSix 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.en_US
dc.format.extent131883 bytesen_US
dc.format.extent117265 bytesen_US
dc.format.mimetypeapplication/pdfen_US
dc.format.mimetypeapplication/postscripten_US
dc.identifier.urihttps://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1322en_US
dc.language.isoenen_US
dc.relation.ispartofseriesTR11/93en_US
dc.titleParallel Multiplication: A Case Study in Parallel Programmingen_US
dc.typeTechnical Reporten_US
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
report.ps
Size:
114.52 KB
Format:
Postscript Files
Description:
Download
Thumbnail Image
Name:
report.pdf
Size:
128.79 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.52 KB
Format:
Plain Text
Description:
Download
Collections
Technical Reports