Title
Using Hammock Graphs to Eliminate Nonstructured Branch Statements
Abstract
. The detection of parallelism is based on the dependence analysisof the program. One of the key problems is to partition the programinto independent subtasks in the presence of control statements (MIMD).In this paper the nonstructured control statements are converted intostructured ones. In this way, a large block of statements is obtained,and the control dependences of the program are easily converted intomanageable parallel tasks.1 IntroductionThe parallelism in a program is...
Year
DOI
Venue
1993
10.1007/3-540-56891-3_71
PARLE
Keywords
Field
DocType
branch statements,hammock graphs
Discrete mathematics,Graph,Computer science,Dependence analysis,Algorithm,Theoretical computer science,Partition (number theory),MIMD
Conference
ISBN
Citations 
PageRank 
3-540-56891-3
1
0.59
References 
Authors
3
2
Name
Order
Citations
PageRank
Fubo Zhang1447.79
Erik H. D'Hollander228128.21