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

2001 conference on array-programming languages: an arrays odyssey, apl 2001

作者： Reichard, George Technical University Of Graz Lessingstrasse 25 GrazA-8010 Austria

Based on the seven levels of principals of object-oriented programming described by B. Meyer [2], it is shown that with today's apl interpreters it is possible to combine array processing and object-oriented progr... 详细信息

ISBN: (纸本)1581134193

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 2001 conference on apl: An arrays odyssey, apl 2001

Proceedings of the 2001 Conference on APL: An Arrays Odyssey...

引用

2001 conference on array-programming languages: an arrays odyssey, apl 2001

ISBN: (纸本)1581134193

The proceedings contain 14 papers. The topics discussed include: correctly detecting intrinsic type errors in typeless languages such as MATLAB;an array-oriented (apl) wish list: ideas I think may be useful;good taste in color and soft palettes;embedding a Tcl web server into apl;is there a way of combining array-processing and object-oriented programming? array form representation of idiom recognition system for numerical programs;suggestions for a method of analyzing binary images using Langlet's parity logic;and a canon for the representation of multivariate arrays in the apl2 computing language.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A canon for the representation of multivariate arrays in the apl2 computing language

A canon for the representation of multivariate arrays in the...

引用

2001 conference on array-programming languages: an arrays odyssey, apl 2001

作者： Stockbridge, Richard Drexel The Johns Hopkins University Applied Physics Laboratory LaurelMD20723-6099 United States

ISBN: (纸本)1581134193

A uniform structure for multivariate data constructs that employs the nested array features of apl2 has been successfully developed and implemented. This array Canonical Form (ACF) succinctly describes its own contents, an important feature for the apl2 functions and operators that accept ACF arrays as arguments. An extensive library of apl2 procedures has been created over the course of many years and projects to perform routine as well as specialized analytical, archival, descriptive, and graphical operations on any ACF. A self-describing uniform array structure is useful for satisfying requirements of reusable, common code and for requiring self-documentation of multivariate data. The ACF structure described in this paper satisfies these requirements in a concise, logically intuitive elemental structure that depends upon and fully utilizes the apl2 language features for nested array construction and manipulation. © 2001 ACM.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An array-Oriented (apl) Wish List Ideas I Think May be Useful

An Array-Oriented (APL) Wish List Ideas I Think May be Usefu...

引用

2001 conference on array-programming languages: an arrays odyssey, apl 2001

作者： Lucas, Jim

ISBN: (纸本)1581134193

The fundamental, data structure in apl is the array. arrays are, in most apl dialects, the only data structure, from scalars as arrays with no dimensions to the complex structures of nested arrays. But there are other ways in which array concepts could be applied, yet so far they have not. These are the top items on my "array-Oriented Wish List".Less fundamental-but far easier to implement-should be certain operators and functions I propose, which I think would enhance the power of existing array operations. Some of these already exist in one or more dialects of apl, and I think all would benefit if they were universally *** this suite of proposals, some are general, others more specific, and some could interact with each other in positive synergy, but none of them requires any of the others to be useful. In some cases, I suggest potential variants, each reasonable in its own *** purpose of this paper is to present the concepts. In most cases, I don't attempt to go into details of implementation. That would require a much more extensive treatment of each concept. I hope that others-especially implementers-might take up the challenge. © 2001 ACM.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

array form representation of idiom recognition system for numerical programs

Array form representation of idiom recognition system for nu...

引用

2001 conference on array-programming languages: an arrays odyssey, apl 2001

作者： Hiroyuki, Sato The University Of Tokyo 2-11-16 Yayoi Bunkyo-ku Tokyo113-8658 Japan

ISBN: (纸本)1581134193

Today, PSE emerges as a promising approach for providing programmers with high-level abstract functions Particularly for numerical programs which essentially handle large arrays, abstract representation of array-handling functions is very important. Idiom recognition can be a bridge between abstract source programs and concrete architectures. It can remove obstacles of gaps between the two that cannot be bridged by today's state of the art compilers. A major problem in idiom recognition is intermediate representation. This paper applies term rewriting theory-a very general framework-to an idiom recognition system. Specifically, we apply it to the idiom recognition problem of Fortran90/95 matrix manipulations, and show that the Fortran90/95 system is never a trivial system. Straight forms are introduced to make the idiom recognition system more powerful. We make a completion procedure based on this Fortran90/95 system, and show some non-trivial idiom recognition using our theory. © 2001 ACM.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Correctly detecting intrinsic type errors in typeless languages such as MATLAB

Correctly detecting intrinsic type errors in typeless langua...

引用

2001 conference on array-programming languages: an arrays odyssey, apl 2001

作者： Joisha, Pramod G. Banerjee, Prithviraj Center For Parallel And Distributed Computing Electrical And Computer Engineering Department Technological Institute Northwestern University 2145 Sheridan Road IL60208-3118 United States

ISBN: (纸本)1581134193

Among the main impediments that languages such as MATLAB and apl present to a compiler is the lack of an explicit declaration for a variable's type, The determination of this important attribute could allow a compiler to generate more efficient code, and is a problem that has been extensively studied in the past. This paper revisits this problem but unlike prior efforts, the objective is a uniform approach to type estimation that also accommodates type incorrect programs in a way that facilitates stronger type error detection through the exact localization of the type error at run time. We also show how our methodology makes it possible to further reduce the run-time overhead due to type conformability checking. The techniques are clearly demonstrated by applying them to deduce the intrinsic types of program variables in the MATLAB language. © 2001 ACM.

关键词： MATLAB

来源：评论

学校读者我要写书评

暂无评论

array operation synthesis to optimize HPF programs on distributed memory machines

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2001年第4期61卷 467-500页

作者： Hwang, GH Lee, JK Ju, RDC Natl Chi Nan Univ Dept Informat Management Nantou Taiwan Natl Tsing Hua Univ Dept Comp Sci Hsinchu 30043 Taiwan Intel Corp Microprocessor Res Labs Santa Clara CA 95052 USA

An increasing number of programming languages;such as Fortran 90, HPF, and apl, provide a rich set of intrinsic array functions and array expressions. These constructs, which constitute an important part of data parallel languages, provide excellent opportunities for compiler optimizations. The synthesis of consecutive array operations or array expressions into a composite access function of the source arrays at compile time has been shown (A, T, Budd, ACM Trans. Programm. Lang, Syst. 6 (July 1984), 297-313;G. H. Hwang et al,, bz "Proc. of ACM SIGPLAN conference on Principles and Practice of Parallel programming, 1995," pp. 112-122) to be an effective scheme for optimizing programs on flat shared memory parallel architectures. It remains, however, to be studied how the synthesis scheme can be incorporated into optimizing HPF-like programs on distributed memory machines by taking into account communication costs. In this paper, we propose solutions to address this issue. We first show how to perform array operation synthesis on HPF programs, and we demonstrate its performance benefits on distributed memory machines with real applications. In addition, to prevent a situation we call "synthesis anomaly," we present an optimal solution to guide the array synthesis process on distributed memory machines. Due to the optimal problem being NP-hard, we further develop a practical strategy that compilers can use on distributed memory machines with HPF programs. Our synthesis engine is implemented as a Web-based tool, called Syntool, and experimental results show significant performance improvement over the base codes for HPF code fragments from real applications on parallel machines. Our experiments were performed on three distributed memory machines: an 8-node DEC Alpha Farm, a 16-node TBM SP-2, and a 16-node nCUBE/2. (C) 2001 Academic Press.

关键词： HPF compiler array operation synthesis distributed memory machines compiler optimization parallelizing compiler

来源：评论

学校读者我要写书评

暂无评论

Functional array fusion 01

Functional array fusion

引用

6th International conference on Functional programming (ICFP 2001)

作者： Chakravarty, MMT Keller, G Univ New S Wales Sch Engn & Comp Sci Sydney NSW Australia Univ Technol Sydney NSW Australia

ISBN: (纸本)9781581134155

This paper introduces a new approach to optimising array algorithms in functional languages. We are specifically aiming at an efficient implementation of irregular array algorithms that are hard to implement in conventional array languages such as Fortran. We optimise the storage layout of arrays containing complex data structures and reduce the running time of functions operating on these arrays by means of equational program transformations. In particular, this paper discusses a novel form of combinator loop fusion, which by removing intermediate structures optimises the use of the memory hierarchy. We identify a combinator named loopP that provides a general scheme for iterating over an array and that in conjunction with an array constructor replicateP is sufficient to express a wide range of array algorithms. On this basis, we define equational transformation rules that combine traversals of loopP and replicateP as well as sequences of applications of loopP into a single loopP traversal. Our approach naturally generalises to a parallel implementation and includes facilities for optimising load balancing and communication. A prototype implementation based on the rewrite rule pragma of the Glasgow Haskell Compiler is significantly faster than standard Haskell arrays and approaches the speed of hand coded C for simple examples.

关键词： Algorithmic languages

来源：评论

学校读者我要写书评

暂无评论

Is there a way of combining array-processing and object-oriented programming? 01

Is there a way of combining array-processing and object-orie...

引用

Proceedings of the 2001 conference on apl: an arrays odyssey

作者： George Reichard Technical University of Graz Lessingstrasse 25 A-8010 Graz Austria

ISBN: (纸本)9781581134193

关键词：

来源：评论

学校读者我要写书评

暂无评论

Spar: a set of extensions to Java for scientific computation

Spar: a set of extensions to Java for scientific computation

引用

ACM 2001 Java Grande/International Symposium on Computing in Object-Oriented Parallel Environments

作者： van Reeuwijk, C Kuijlman, F Sips, HJ Delft Univ Technol NL-2628 CD Delft Netherlands

ISBN: (纸本)1581133596

We present a set of language extensions that improve the expressiveness and performance of Java for scientific computation. The language extensions allow the manipulation of multi-dimensional arrays to be expressed more naturally, and to be implemented more efficiently. Furthermore, data-parallel programming is supported, allowing efficient parallelization of a large class of operations on arrays. We also provide language extensions to construct specialized array representations, such as symmetric, block, and sparse matrices. These extensions are: tuples, parameterized types, array subscript overloading, and the inline modifier. These extensions are not only useful in the construction of special array representations, but are also useful in their own right. Finally, we add complex numbers as a primitive type to the language. We evaluate our language extensions using performance results. We also compare relevant code fragments of our extended language with standard Java implementations and language extensions proposed by others. Copyright (C) 2003 John Wiley Sons, Ltd.

关键词： Java multi-dimensional array tuple parameterized type

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：