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

acm sigplan conference on programming language design and implementation

作者： Christophe Dubach Perry Cheng Rodric Rabbah David F. Bacon Stephen J. Fink University of Edinburgh IBM Research

ISBN: (纸本)9781450312059

languages such as OpenCL and CUDA offer a standard interface for general-purpose programming of GPUs. However, with these languages, programmers must explicitly manage numerous low-level details involving communication and synchronization. This burden makes programming GPUs difficult and error-prone, rendering these powerful devices inaccessible to most programmers. We desire a higher-level programming model that makes GPUs more accessible while also effectively exploiting their computational power. This paper presents features of Lime, a new Java-compatible language targeting heterogeneous systems, that allow an optimizing compiler to generate high quality GPU code. The key insight is that the language type system enforces isolation and immutability invariants that allow the compiler to optimize for a GPU without heroic compiler analysis. Our compiler attains GPU speedups between 75% and 140% of the performance of native OpenCL code.

关键词： design languages Performance GPU OpenCL Java Lime Streaming Map Reduce language Streaming GRAPPER PICK UP Graphics Processing Unit lime Reduce Java Java programming language compilers MAPPING(MATHEMATICAL) language form Computer personnel high level language(hll) Optimising compilers general purpose programming

来源：评论

学校读者我要写书评

暂无评论

programming languages in security: keynote 13

Programming languages in security: keynote

引用

Proceedings of the 34th acm sigplan conference on programming language design and implementation

作者： Fred B. Schneider Cornell University Ithaca NY USA

No abstract available.

ISBN: (纸本)9781450320146

No abstract available.

关键词： science of security

来源：评论

学校读者我要写书评

暂无评论

Automated Feedback Generation for Introductory programming Assignments 13

Automated Feedback Generation for Introductory Programming A...

引用

acm sigplan conference on programming language design and implementation

作者： Rishabh Singh Sumit Gulwani Armando Solar-Lezama MIT CSAIL Microsoft Research

ISBN: (纸本)9781450320146

We present a new method for automatically providing feedback for introductory programming problems. In order to use this method, we need a reference implementation of the assignment, and an error model consisting of potential corrections to errors that students might make. Using this information, the system automatically derives minimal corrections to student's incorrect solutions, providing them with a measure of exactly how incorrect a given solution was, as well as feedback about what they did wrong. We introduce a simple language for describing error models in terms of correction rules, and formally define a rule-directed translation strategy that reduces the problem of finding minimal corrections in an incorrect program to the problem of synthesizing a correct program from a sketch. We have evaluated our system on thousands of real student attempts obtained from the Introduction to programming course at MIT (6.00) and MITx (6.00x). Our results show that relatively simple error models can correct on average 64% of all incorrect submissions in our benchmark set.

关键词： Automated Grading Computer-Aided Education Program Synthesis error model computer-assisted education Feedback programming Students AUTOMATIC

来源：评论

学校读者我要写书评

暂无评论

Fine-grained interoperability through mirrors and contracts

引用

acm sigplan NOTICES 2005年第10期40卷 231-245页

作者： Gray, KE Findler, RB Flatt, M Univ Utah Salt Lake City UT 84112 USA Univ Chicago Chicago IL 60637 USA

As a value flows across the boundary between interoperating languages, it must be checked and converted to fit the types and representations of the target language. For simple forms of data, the checks and coercions can be immediate, for higher order data, such as functions and objects. some must be delayed until the value is used in a particular way. Typically, these coercions and checks are implemented by an ad-hoc mixture of wrappers, reflection, and dynamic predicates. We observe that 1) the wrapper and reflection operations fit the profile of mirrors, 2) the checks correspond to contracts, and 3) the timing and shape of mirror operations coincide with the timing and shape of contract operations. Based on these insights, we present a new model of interoperability that builds on the ideas of mirrors and contracts, and we describe an interoperable implementation of Java and Scheme that is guided by the model.

关键词： languages design interoperability mirrors contracts Java Scheme

来源：评论

学校读者我要写书评

暂无评论

Formal loop merging for signal transforms

引用

acm sigplan NOTICES 2005年第6期40卷 315-326页

作者： Franchetti, F Voronenko, Y Püschel, M Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA

A critical optimization in the domain of linear signal transforms, such as the discrete Fourier transform (DFT), is loop merging, which increases data locality and reuse and thus performance. In particular, this includes the conversion of shuffle operations into array reindexings. To date, loop merging is well understood only for the DFT, and only for Cooley-Tukey FFT based algorithms, which excludes DFT sizes divisible by large primes. In this paper, we present a formal loop merging framework for general signal transforms and its implementation within the SPIRAL code generator. The framework consists of Sigma-SPL, a mathematical language to express loops and index mappings;a rewriting system to merge loops in E-SPL;and a compiler that translates Sigma-SPL into code. We apply the framework to DFT sizes that cannot be handled using only the Cooley-Tukey FFT and compare our method to FFTW 3.0.1 and the vendor library Intel MKL 7.2.1. Compared to FFTW our generated code is a factor of 2-4 faster under equal implementation conditions (same algorithms, same unrolling threshold). For some sizes we show a speed-up of a factor of 9 using Bluestein's algorithm. Further, we give a detailed comparison against the Intel vendor library MKL;our generated code is between 2 times faster and 4.5 times slower.

关键词： linear signal transform discrete Fourier transform DFT loop optimization domain-specific language automatic performance tuning

来源：评论

学校读者我要写书评

暂无评论

Reconciling Exhaustive Pattern Matching with Objects 13

Reconciling Exhaustive Pattern Matching with Objects

引用

acm sigplan conference on programming language design and implementation

作者： Chinawat Isradisaikul Andrew C. Myers Department of Computer Science Cornell University

ISBN: (纸本)9781450320146

Pattern matching, an important feature of functional languages, is in conflict with data abstraction and extensibility, which are central to object-oriented languages. Modal abstraction offers an integration of deep pattern matching and convenient iteration abstractions into an object-oriented setting; however, because of data abstraction, it is challenging for a compiler to statically verify properties such as exhaustiveness. In this work, we extend modal abstraction in the JMatch language to support static, modular reasoning about exhaustiveness and redundancy. New matching specifications allow these properties to be checked using an SMT solver. We also introduce expressive pattern-matching constructs. Our evaluation shows that these new features enable more concise code and that the performance of checking exhaustiveness and redundancy is acceptable.

关键词： JMatch Pattern matching Named constructor Equality constructor Matching specification Exhaustiveness Redundancy Modal abstraction Java Data abstraction Subtyping design Verification languages

来源：评论

学校读者我要写书评

暂无评论

language for writing code generators

引用

sigplan Notices (acm Special Interest Group on programming languages) 1989年第7期24卷 238-245页

作者： Fraser, Christopher W. AT&T Bell Lab United States

This paper describes a programming language for writing code generators. The language abbreviates repetitive constructs, simplifies encoding, and assumes responsibility for making the code generator small and fast. As a result, a specification for the VAX takes 126 lines, one for the Motorola 68020 takes 156, and one for the MIPS R3000 takes 75. This project grew out of experience with a system that tracked the operation of a high-tech peephole optimizer and generated a hard-coded code generator from the trace. The current system generates similar code generators directly from a compact document that captures their entropy.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

LR substring parser for noncorrecting syntax error recovery

引用

sigplan Notices (acm Special Interest Group on programming languages) 1989年第7期24卷 161-169页

作者： Cormack, Gordon V. Univ of Waterloo Canada

For a context-free grammar G, a construction is given to produce an LR parser that recognizes any substring of the language generated by G. The construction yields a conflict-free (deterministic) parser for the bounded context class of grammars (Floyd, 1964). The same construction yields either a left-to-right or right-to-left substring parser, as required to implement Non-correcting Syntax Error Recovery as proposed by Richter (1985). Experience in constructing a substring parser for Pascal is described.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Refined types: highly differentiated type systems and their use in the design of intermediate languages 88

Refined types: highly differentiated type systems and their ...

引用

Proceedings of the acm sigplan 1988 conference on programming language design and implementation

作者： J. R. Rose Thinking Machines Corporation Cambridge MA

来源：评论

学校读者我要写书评

暂无评论

Automatic inversion generates divide-and-conquer parallel programs

引用

acm sigplan NOTICES 2007年第6期42卷 146-155页

作者： Morita, Kazutaka Morihata, Akimasa Matsuzaki, Kiminori Hu, Zhenjiang Takeichi, Masato Univ Tokyo Grad Sch Informat Sci & Technol Tokyo Japan

Divide-and-conquer algorithms are suitable for modern parallel machines, tending to have large amounts of inherent parallelism and working well with caches and deep memory hierarchies. Among others, list homomorphisms are a class of recursive functions on lists, which match very well with the divide-and-conquer paradigm. However, direct programming with list homomorphisms is a challenge for many programmers. In this paper, we propose and implement a novel system that can automatically derive cost-optimal list homomorphisms from a pair of sequential programs, based on the third homomorphism theorem. Our idea is to reduce extraction of list homomorphisms to derivation of weak right inverses. We show that a weak right inverse always exists and can be automatically generated from a wide class of sequential programs. We demonstrate our system with several nontrivial examples, including the maximum prefix sum problem, the prefix sum computation, the maximum segment sum problem, and the line-of-sight problem. The experimental results show practical efficiency of our automatic parallelization algorithm and good speedups of the generated parallel programs.

关键词： algorithms design languages divide-and-conquer parallelism inversion program transformation third homomorphism theorem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：