Name
Abstract | ||
|---|---|---|
Numerous efforts have been made on performing data dependence analysis on sequential programs and to parallelize them, especially the loops. However, program restructurers often have to make some conservative assumptions whether to parallelize them or not, due to insufficient information caused by procedure calls. Procedures that are called may be modifying some global variables and this inhibits any parallelism. This paper discusses the Inter-procedural analysis (IPA) based on the Bernstein Method [29]. IPA involves in collecting information regarding a procedure call and the effects of usage of variables in the body of the called procedure. A way to handle inter-procedural information by using the Bernstein Sets [10] is proposed. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1016/0167-8191(94)00082-L | Parallel Computing |
Keywords | Field | DocType |
procedure call,bernstein sets,data dependence analysis,parallel computing,aliasing,inter-procedural analysis,parallel computer | Computer science,Parallel computing,Theoretical computer science,Aliasing,Data dependence,Program analysis,Procedure calls,Global variable | Journal |
Volume | Issue | ISSN |
21 | 2 | Parallel Computing |
Citations | PageRank | References |
1 | 0.36 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Y. Mohd-Saman | 1 | 9 | 2.79 |
| D. J. Evans | 2 | 634 | 247.93 |