Designing parallel algorithms from forests and multistage graphs
Resource
Computer Software and Applications Conference, 1988. COMPSAC 88. Proceedings., Twelfth International
Journal
Computer Software and Applications Conference, 1988. COMPSAC 88. Proceedings., Twelfth International
Pages
-
Date Issued
1988-10
Date
1988-10
Author(s)
Chen, G.H.
Chern, M.-S.
DOI
N/A
Abstract
The data dependence graph (DDG) is a tool for parallelism detection, which is essential to parallel algorithm design. The authors consider a three-stage procedure for designing parallel algorithms for a given problem: finding a solution method for the given problem; constructing a DDG for the solution method; and designing parallel algorithms from the DDG. They propose some design approaches for two classes of DDGs: the forest and the multistage graph.>
SDGs
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00017188.pdf
Size
37.39 KB
Format
Adobe PDF
Checksum
(MD5):54ff31feb92239b7caf1b5f22779a05d