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

1995 ACM/IEEE Supercomputing Conference (SC 95)

作者： Gu, JJ Li, ZY Lee, G Univ of Minnesota Minneapolis United States

ISBN: (纸本)0897918622

array dataflow information plays an important role for successful automatic parallelization of Fortran programs. This paper proposes a powerful symbolic array dataflow analysis to support array privatization and loop parallelization for programs with arbitrary control flow graphs and acyclic call graphs. Our scheme summarizes array access information using guarded array regions and propagates such regions over a Hierarchical Supergraph (HSG). The use of guards allows us to use the information in IF conditions to sharpen the array dataflow analysis and thereby to handle difficult cases which elude other existing techniques. The guarded array regions retain the simplicity of set operations for regular array regions in common cases, and they enhance regular array regions in complicated cases by using guards to handle complex symbolic expressions and array shapes. Scalar values that appear in array subscripts and loop limits are substituted on the fly during the array information propagation, which disambiguates the symbolic values precisely for set operations. We present efficient algorithms that implement our scheme. Initial experiments of applying our analysis to Perfect Benchmarks show promising results of improved array privatization. Copyright 1995 by the Association for Computing Machinery, Inc. (ACM).

关键词： parallelizing compiler array dataflow analysis interprocedural analysis array privatization symbolic analysis

来源：评论

学校读者我要写书评

暂无评论

Constraint-based array dependence analysis

引用

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 1998年第3期20卷 635-678页

作者： Pugh, W Wonnacott, D Univ Maryland Inst Adv Comp Studies Dept Comp Sci College Pk MD 20742 USA Haverford Coll Dept Comp Sci Haverford PA 19041 USA

Traditional array dependence analysis, which detects potential memory aliasing of array references, is a key analysis technique for automatic parallelization. Recent studies of benchmark codes indicate that limitations of analysis cause many compilers to overlook large amounts of potential parallelism, and that exploiting this parallelism requires algorithms to answer new questions about array references, not just get better answers to the old question of aliasing. We need to ask about the flow of values in arrays, to check the legality of array privatization, and about the conditions under which a dependence exists, to obtain information about conditional parallelism. In some cases, we must answer these questions about code containing nonlinear terms in loop bounds or subscripts. This article describes techniques for phrasing these questions in terms of systems of constraints. Conditional dependence analysis can be performed with a constraint operation we call the "gist" operation. When subscripts and loop bounds are affine, questions about the flow of values in array variables can be phrased in terms of a subset of Presburger Arithmetic. When the constraints describing a dependence are not affine, we introduce uninterpreted function symbols to represent the nonaffine terms. Our constraint language also provides a rich language for communication with the dependence analyzer, by either the programmer or other phases of the compiler. This article also documents our investigations of the practicality of our approach. The worst-case complexity of Presburger Arithmetic indicates that it might be unsuitable for any practical application. However, we have found that analysis of benchmark programs does not cause the exponential growth in the number of constraints that could occur in :he worst case. We have studied the constraints produced during our analysis, and identified characteristics that keep our algorithms free of exponential behavior in practice.

关键词： array dataflow analysis dependence abstraction dependence analysis parallelization Presburger Arithmetic static analysis

来源：评论

学校读者我要写书评

暂无评论

Automatic storage management for parallel program

引用

PARALLEL COMPUTING 1998年第3-4期24卷 649-671页

作者： Lefebvre, V Feautrier, P Univ Versailles St Quentin Lab PRiSM F-78035 Versailles France

This article deals with automatic parallelization of static control programs. During the parallelization process the removal of memory related dependences is usually performed by translating the original program into single assignment form. This total data expansion has a very high memory cost. We present a technique of partial data expansion which leaves untouched the performances of the parallelization process, with the help of algebra techniques given by the polytope model. (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： automatic parallelization memory management array dataflow analysis scheduling

来源：评论

学校读者我要写书评

暂无评论

A simple framework to calculate the reaching definition of array references and its use in subscript array analysis

引用

CONCURRENCY-PRACTICE AND EXPERIENCE 2000年第2-3期12卷 125-135页

作者： Lin, Y Padua, D Univ Illinois Dept Comp Sci Urbana IL 61801 USA

The property analysis of subscript arrays can be used to facilitate the automatic detection of parallelism in sparse/irregular programs that use indirectly accessed arrays, In order for property analysis to work, array reaching definition information is needed. In this paper, we present a framework to efficiently calculate the array reaching definition. This method is designed to handle the common program patterns in real programs. We use some available techniques as the building components, such as data dependence tests and array summary set representations and operations, Our method is more efficient as well as more flexible than the existing techniques. Copyright (C) 2000 John Wiley & Sons, Ltd.

关键词： array reaching definition array dataflow analysis data dependence test automatic parallelization array property analysis sparse irregular computation

来源：评论

学校读者我要写书评

暂无评论

A simple framework to calculate the reaching definition of array references and its use in subscript array analysis

引用

Concurrency and Computation: Practice and Experience 2000年第2‐3期12卷

作者： Yuan Lin David Padua 3319 DCL 1304 West Springfield Avenue Urbana IL 61801 U.S.A. Department of Computer Science University of Illinois at Urbana-Champaign IL 61801 U.S.A.

The property analysis of subscript arrays can be used to facilitate the automatic detection of parallelism in sparse/irregular programs that use indirectly accessed arrays. In order for property analysis to work, array reaching definition information is needed. In this paper, we present a framework to efficiently calculate the array reaching definition. This method is designed to handle the common program patterns in real programs. We use some available techniques as the building components, such as data dependence tests and array summary set representations and operations. Our method is more efficient as well as more flexible than the existing techniques. Copyright © 2000 John Wiley & Sons, Ltd.

关键词： array reaching definition array dataflow analysis data dependence test automatic parallelization array property analysis sparse irregular computation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：