检索结果-内蒙古大学图书馆

1998 International Conference on Computer Languages

作者： Knoop, J Univ Passau Fak Math & Informat D-94030 Passau Germany

ISBN: (纸本)0780350057

Formal callability is the problem of determining for every formal procedure call of a program the set of procedures it may call at run-time. The's information is the key for constructing the procedure call graph of a program, a common prerequisite of static analyses of programs with procedures. Moreover, under specific side-conditions it reduces in interprocedural data-flow analysis the analysis of programs with formal procedure calls to the analysis of programs without formal calls by treating formal calls as higher-order branch statements. We demonstrate that formal callability yields as a by-product the solution of the well-known formal reachability problem. This directly implies that formal callability is in general not decidable. However, we show that formal callability is decidable for programs, where formal procedure parameters do not occur in procedures, which are local to the procedure of their declaration (usually known as programs without global (formal) procedure parameters), but within a time bound which is exponential in the program size. Thus, we complement the new decidability result by introducing in addition a safe approximation of formal callability called potential passability, which can efficiently be computed. Moreover, for programs of mode depth 2 (i.e., formal procedures do not have procedures as parameters) without global procedure parameters, formal callability and potential passability coincide.

关键词： formal callability formal reachability call graph analysis interprocedural data-flow analysis program optimization

来源：评论

学校读者我要写书评

暂无评论

interprocedural analysis VS PROCEDURE INTEGRATION

引用

INFORMATION PROCESSING LETTERS 1989年第3期32卷 137-142页

作者： RICHARDSON, S GANAPATHI, M Cent. Integrated Syst. Stanford Univ. Stanford CA 94305 USA

We contrast approaches to interprocedural analysis with those for procedure integration. The latter becomes a baseline for interprocedural optimizations. A set of experimental results show the exact run-time improvement due to both procedure integration and the use of interprocedural data-flow information, as well as the relative impact on compilation time and object code size. In addition, examination of the results produces a definition for a measure of improvement attributable to interprocedural interactions.

关键词： Compiler code optimization interprocedural data-flow analysis procedure integration

来源：评论

学校读者我要写书评

暂无评论

A METHODOLOGY FOR PROCEDURE CLONING

引用

COMPUTER LANGUAGES 1993年第2期19卷 105-117页

作者： COOPER, KD HALL, MW KENNEDY, K STANFORD UNIV CTR INTEGRATED SYSTSTANFORDCA 94305 RICE UNIV DEPT COMP SCIHOUSTONTX 77251

Procedure cloning is an interprocedural transformation where the compiler creates specialized copies of procedure bodies. The compiler divides incoming calls between the original procedure and its copies. By carefully partitioning the calls, the compiler ensures that each clone inherits an environment that allows for better code optimization. This paper presents a three-phase algorithm for deciding when to clone a procedure. The algorithm seeks to avoid unnecessary code growth by considering how the information exposed by cloning will be used during optimization. We present a set of assumptions that bound both the algorithm's running time and code expansion.

关键词： CLONING SPECIALIZATION interprocedural data-flow analysis interprocedural OPTIMIZATION

来源：评论

学校读者我要写书评

暂无评论

interprocedural parallelization analysis in SUIF

引用

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 2005年第4期27卷 662-731页

作者： Hall, MW Amarasinghe, SP Murphy, BR Liao, SW Lam, MS Univ So Calif Inst Informat Sci Marina Del Rey CA 90292 USA MIT Comp Sci Lab Cambridge MA 02139 USA Stanford Univ Comp Sci Lab Stanford CA 94305 USA Intel Corp Santa Clara CA 95051 USA

As shared-memory multiprocessor systems become widely available, there is an increasing need for tools to simplify the task of developing parallel programs. This paper describes one such tool, the automatic parallelization system in the Stanford SUIF compiler. This article represents a culmination of a several-year research effort aimed at making parallelizing compilers significantly more effective. We have developed a system that performs full interprocedural parallelization analyses, including array privatization analysis, array reduction recognition, and a suite of scalar dataflow analyses including symbolic analysis. These analyses collaborate in an integrated fashion to exploit coarse-grain parallel loops, computationally intensive loops that can execute on multiple processors independently with no cross-processor synchronization or communication. The system has successfully parallelized large interprocedural loops over a thousand lines of code completely automatically from sequential applications. This article provides a comprehensive description of the analyses in the SUIF system. We also present extensive empirical results on four benchmark suites, showing the contribution of individual analysis techniques both in executing more of the computation in parallel, and in increasing the granularity of the parallel computations. These results demonstrate the importance of interprocedural array data-flow analysis, array privatization and array reduction recognition;a third of the programs spend more than 50% of their execution time in computations that are parallelized with these techniques. Overall, these results indicate that automatic parallelization can be effective on sequential scientific computations, but only if the compiler incorporates all of these analyses.

关键词： algorithms analysis experimentation performance data dependence analysis interprocedural data-flow analysis parallelization symbolic analysis

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT COMPUTATION OF interprocedural DEFINITION-USE CHAINS

引用

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 1994年第2期16卷 175-204页

作者： HARROLD, MJ SOFFA, ML UNIV PITTSBURGH DEPT COMP SCIPITTSBURGHPA 15260

The dependencies that exist among definitions and uses of variables in a program are required by many language-processing tools. This paper considers the computation of definition-use and use-definition chains that extend across procedure boundaries at call and return sites. Intraprocedural definition and use information is abstracted for each procedure and is used to construct an interprocedural flow graph. This intraprocedural data-flow information is then propagated throughout the program via the interprocedural flow graph to obtain sets of reaching definitions and/or reachable uses for each interprocedural control point, including procedure entry, exit, call, and return. interprocedural definition-use and/or use-definition chains are computed from this reaching information. The technique handles the interprocedural effects of the data flow caused by both reference parameters and global variables, while preserving the calling context of called procedures. Additionally, recursion, aliasing, and separate compilation are handled. The technique has been implemented using a Sun-4 Workstation and incorporated into an interprocedural data-flow tester. Results from experiments indicate the practicality of the technique, both in terms of the size of the interprocedural flow graph and the size of the data-flow sets.

关键词： data-flow TESTING interprocedural data-flow analysis interprocedural DEFINITION-USE CHAINS interprocedural REACHABLE USES interprocedural REACHING DEFINITIONS

来源：评论

学校读者我要写书评

暂无评论

interprocedural Distribution Assignment Placement: More Than Just Enhancing Intraprocedural Placing Techniques 97

Interprocedural Distribution Assignment Placement: More Than...

引用

Proceedings of the 1997 International Conference on Parallel Architectures and Compilation Techniques

作者： J. Knoop E. Mehofer

ISBN: (纸本)9780818680908

Avoiding unnecessary remappings at run-time by means of a strategic distribution assignment placement (DAP) is a major means for improving the run-time efficiency of data-parallel programs on distributed-memory architectures. In Proc. Euro-Par '97, pp. 364-73 (1997), we presented a novel and aggressive intraprocedural algorithm achieving this by eliminating partially redundant and partially dead distribution assignments. In this paper, we show how to enhance this approach interprocedurally. Surprisingly at first sight, it turns out that a straightforward adaption of the intraprocedural approach fails because central properties being valid for the intraprocedural case do not carry over to the interprocedural one, revealing severe anomalies. After discussing the essential differences and analogies of DAP in the interprocedural and interprocedural cases, we show how to overcome these anomalies in order to arrive at a powerful and flexible approach for interprocedural DAP (IDAP). As in the interprocedural case, we get a hierarchy of IDAP algorithms of varying power and efficiency supporting user-customized solutions. First practical experiences underline its importance and effectivity.

关键词： unnecessary run-time remappings optimization dynamic data redistribution intraprocedural placing techniques run-time efficiency anomalies partially redundant distribution assignment elimination data-parallel programs High Performance Fortran user-customized solutions parallel programming interprocedural data-flow analysis algorithm hierarchy partially dead distribution assignment elimination interprocedural distribution assignment placement distributed-memory architectures

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：