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

2013 acm sigplan International conference on Object Oriented programming Systems languages

作者： Gerakios, Prodromos Biboudis, Aggelos Smaragdakis, Yannis Univ Athens Dept Informat Athens 15784 Greece

ISBN: (纸本)9781450323741

We propose DelphJ: a Java-based OO language that eschews inheritance completely, in favor of a combination of class morphing and (deep) delegation. Compared to past delegation approaches, the novel aspect of our design is the ability to emulate the best aspects of inheritance while retaining maximum flexibility: using morphing, a class can select any of the methods of its delegatee and export them (if desired) or transform them (e.g., to add extra arguments or modify type signatures), yet without needing to name these methods explicitly and handle them one-by-one. Compared to past work on morphing, our approach adopts and adapts advanced delegation mechanisms, in order to add late binding capabilities and, thus, provide a full substitute of inheritance. Additionally, we explore complex semantic issues in the interaction of delegation with late binding. We present our language design both informally, with numerous examples, and formally in a core calculus.

关键词： languages meta-programming language extensions morphing object composition delegation static reflection

来源：评论

学校读者我要写书评

暂无评论

language Support for Dynamic, Hierarchical Data Partitioning

引用

acm sigplan NOTICES 2013年第10期48卷 495-514页

作者： Treichler, Sean Bauer, Michael Aiken, Alex Stanford Univ Stanford CA 94305 USA

Applications written for distributed-memory parallel architectures must partition their data to enable parallel execution. As memory hierarchies become deeper, it is increasingly necessary that the data partitioning also be hierarchical to match. Current language proposals perform this hierarchical partitioning statically, which excludes many important applications where the appropriate partitioning is itself data dependent and so must be computed dynamically. We describe Legion, a region-based programming system, where each region may be partitioned into subregions. Partitions are computed dynamically and are fully programmable. The division of data need not be disjoint and subregions of a region may overlap, or alias one another. Computations use regions with certain privileges (e.g., expressing that a computation uses a region read-only) and data coherence (e.g., expressing that the computation need only be atomic with respect to other operations on the region), which can be controlled on a per-region (or subregion) basis. We present the novel aspects of the Legion design, in particular the combination of static and dynamic checks used to enforce soundness. We give an extended example illustrating how Legion can express computations with dynamically determined relationships between computations and data partitions. We prove the soundness of Legion's type system, and show Legion type checking improves performance by up to 71% by eliding provably safe memory checks. In particular, we show that the dynamic checks to detect aliasing at runtime at the region granularity have negligible overhead. We report results for three real-world applications running on distributed memory machines, achieving up to 62.5X speedup on 96 GPUs on the Keeneland supercomputer.

关键词： Legion regions type system independence aliasing hierarchical scheduling data partitioning coherence

来源：评论

学校读者我要写书评

暂无评论

The Intel Labs Haskell Research Compiler

The Intel Labs Haskell Research Compiler

引用

acm sigplan Haskell Symposium Co-located with ICFP

作者： Liu, Hai Glew, Neal Petersen, Leaf Anderson, Todd A. Intel Labs United States

ISBN: (纸本)9781450323833

The Glasgow Haskell Compiler (GHC) is a well supported optimizing compiler for the Haskell programming language, along with its own extensions to the language and libraries. Haskell's lazy semantics imposes a runtime model which is in general difficult to implement efficiently. GHC achieves good performance across a wide variety of programs via aggressive optimization taking advantage of the lack of side effects, and by targeting a carefully tuned virtual machine. The Intel Labs Haskell Research Compiler uses GHC as a frontend, but provides a new whole-program optimizing backend by compiling the GHC intermediate representation to a relatively generic functional language compilation platform. We found that GHC's external Core language was relatively easy to use, but reusing GHC's libraries and achieving full compatibility were harder. For certain classes of programs, our platform provides substantial performance benefits over GHC alone, performing 2x faster than GHC with the LLVM backend on selected modern performance-oriented benchmarks;for other classes of programs, the benefits of GHC's tuned virtual machine continue to outweigh the benefits of more aggressive whole program optimization. Overall we achieve parity with GHC with the LLVM backend. In this paper, we describe our Haskell compiler stack, its implementation and optimization approach, and present benchmark results comparing it to GHC.

关键词： Functional language Compiler Compiler Optimization Haskell

来源：评论

学校读者我要写书评

暂无评论

Hasochism The Pleasure and Pain of Dependently Typed Haskell programming

Hasochism The Pleasure and Pain of Dependently Typed Haskell...

引用

acm sigplan Haskell Symposium Co-located with ICFP

作者： Lindley, Sam McBride, Conor Univ Strathclyde Glasgow G1 1XQ Lanark Scotland

ISBN: (纸本)9781450323833

Haskell's type system has outgrown its Hindley-Milner roots to the extent that it now stretches to the basics of dependently typed programming. In this paper, we collate and classify techniques for programming with dependent types in Haskell, and contribute some new ones. In particular, through extended examples-merge-sort and rectangular tilings-we show how to exploit Haskell's constraint solver as a theorem prover, delivering code which, as Agda programmers, we envy. We explore the compromises involved in simulating variations on the theme of the dependent function space in an attempt to help programmers put dependent types to work, and to inform the evolving language design both of Haskell and of dependently typed languages more broadly.

关键词： dependent types singletons data type promotion proof search invariants

来源：评论

学校读者我要写书评

暂无评论

Storage Strategies for Collections in Dynamically Typed languages 13

Storage Strategies for Collections in Dynamically Typed Lang...

引用

2013 acm sigplan International conference on Object Oriented programming Systems languages

作者： Bolz, Carl Friedrich Diekmann, Lukas Tratt, Laurence Univ Dusseldorf Dusseldorf Germany Hasso Plattner Inst Potsdam Potsdam Germany Kings Coll London London WC2R 2LS England

ISBN: (纸本)9781450323741

Dynamically typed language implementations often use more memory and execute slower than their statically typed cousins, in part because operations on collections of elements are unoptimised. This paper describes storage strategies, which dynamically optimise collections whose elements are instances of the same primitive type. We implement storage strategies in the PyPy virtual machine, giving a performance increase of 18% on wide-ranging benchmarks of real Python programs. We show that storage strategies are simple to implement, needing only 1500LoC in PyPy, and have applicability to a wide range of virtual machines.

关键词： Algorithms languages Performance implementation collection types memory optimization dynamic typing

来源：评论

学校读者我要写书评

暂无评论

Counting and occurrence sort for GPUs using an embedded language

Counting and occurrence sort for GPUs using an embedded lang...

引用

2nd acm sigplan Workshop on Functional High-Performance Computing, FHPC 2013 - Co-located with the 18th acm sigplan International conference on Functional programming, ICFP 2013

作者： Svenningsson, Josef Svensson, Bo Joel Sheeran, Mary Dept of Computer Science and Engineering Chalmers University of Technology Sweden

ISBN: (纸本)9781450323819

This paper investigates two sorting algorithms: counting sort and a variation, occurrence sort, which also removes duplicate elements, and examines their suitability for running on the GPU. The duplicate removing variation turns out to have a natural functional, dataparallel implementation which makes it particularly interesting for GPUs. The algorithms are implemented in Obsidian, a high-level domain specific language for GPU programming. Measurements show that our implementations in many cases outperform the sorting algorithm provided by the library Thrust. Furthermore, occurrence sort is another factor of two faster than ordinary counting sort. We conclude that counting sort is an important contender when considering sorting algorithms for the GPU, and that occurrence sort is highly preferable when applicable. We also show that Obsidian can produce very competitive code. Copyright © 2013 by the Association for Computing Machinery, Inc. (acm).

关键词： Sorting

来源：评论

学校读者我要写书评

暂无评论

LVars: Lattice-based data structures for deterministic parallelism

LVars: Lattice-based data structures for deterministic paral...

引用

2nd acm sigplan Workshop on Functional High-Performance Computing, FHPC 2013 - Co-located with the 18th acm sigplan International conference on Functional programming, ICFP 2013

作者： Kuper, Lindsey Newton, Ryan R. Indiana University United States

ISBN: (纸本)9781450323819

Programs written using a deterministic-by-construction model of parallel computation are guaranteed to always produce the same observable results, offering programmers freedom from subtle, hard-to-reproduce nondeterministic bugs that are the scourge of parallel software. We present LVars, a new model for deterministic by- construction parallel programming that generalizes existing single-assignment models to allow multiple assignments that are monotonically increasing with respect to a user-specified lattice. LVars ensure determinism by allowing only monotonic writes and "threshold" reads that block until a lower bound is reached. We give a proof of determinism and a prototype implementation for a language with LVars and describe how to extend the LVars model to support a limited form of nondeterminism that admits failures but never wrong answers. Copyright © 2013 by the Association for Computing Machinery, Inc. (acm).

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

programming mixed music in ReactiveML

Programming mixed music in ReactiveML

引用

2013 1st acm sigplan Workshop on Functional Art, Music, Modeling and design, FARM 2013 - Co-located with the 18th acm sigplan International conference on Functional programming, ICFP 2013

作者： Baudart, Guillaume Mandel, Louis Pouzet, Marc École Normale Supérieure de Cachan Antenne de Bretagne DI École Normale Supérieure France Univ. Paris-Sud 11 DI École Normale Supérieure INRIA Paris-Rocquencourt France Univ. Pierre et Marie Curie DI École Normale Supérieure INRIA Paris-Rocquencourt France

ISBN: (纸本)9781450323864

Mixed music is about live musicians interacting with electronic parts which are controlled by a computer during the performance. It allows composers to use and combine traditional instruments with complex synthesized sounds and other electronic devices. There are several languages dedicated to the writing of mixed music scores. Among them, the Antescofo language coupled with an advanced score follower allows a composer to manage the reactive aspects of musical performances: how electronic parts interact with a musician. However these domain specific languages do not offer the expressiveness of functional programming. We embed the Antescofo language in a reactive functional programming language, ReactiveML. This approach offers to the composer recursion, higher order, inductive types, as well as a simple way to program complex reactive behaviors thanks to the synchronous model of concurrency on which ReactiveML is built. This article presents how to program mixed music in ReactiveML through several examples. Copyright © 2013 acm.

关键词： Music

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerance via Idempotence

Fault Tolerance via Idempotence

引用

40th acm sigplan-SIGACT Symposium on Principles of programming languages

作者： Ramalingam, G. Vaswani, Kapil Microsoft Research Bangalore India

ISBN: (纸本)9781450318327

Building distributed services and applications is challenging due to the pitfalls of distribution such as process and communication failures. A natural solution to these problems is to detect potential failures, and retry the failed computation and/or resend messages. Ensuring correctness in such an environment requires distributed services and applications to be idempotent. In this paper, we study the inter-related aspects of process failures, duplicate messages, and idempotence. We first introduce a simple core language (based on lambda-calculus) inspired by modern distributed computing platforms. This language formalizes the notions of a service, duplicate requests, process failures, data partitioning, and local atomic transactions that are restricted to a single store. We then formalize a desired (generic) correctness criterion for applications written in this language, consisting of idempotence (which captures the desired safety properties) and failure-freedom (which captures the desired progress properties). We then propose language support in the form of a monad that automatically ensures failfree idempotence. A key characteristic of our implementation is that it is decentralized and does not require distributed coordination. We show that the language support can be enriched with other useful constructs, such as compensations, while retaining the coordination-free decentralized nature of the implementation. We have implemented the idempotence monad (and its variants) in F# and C# and used our implementation to build realistic applications on Windows Azure. We find that the monad has low runtime overheads and leads to more declarative applications.

关键词： Reliability languages design fault tolerance idempotence workflow transaction monad

来源：评论

学校读者我要写书评

暂无评论

Isolation for Nested Task Parallelism 13

Isolation for Nested Task Parallelism

引用

2013 acm sigplan International conference on Object Oriented programming Systems languages

作者： Zhao, Jisheng Lublinerman, Roberto Budimlic, Zoran Chaudhuri, Swarat Sarkar, Vivek Rice Univ Houston TX 77251 USA Google Inc Mountain View CA USA

ISBN: (纸本)9781450323741

Isolation-the property that a task can access shared data without interference from other tasks-is one of the most basic concerns in parallel programming. While there is a large body of past work on isolated task-parallelism, the integration of isolation, task-parallelism, and nesting of tasks has been a difficult and unresolved challenge. In this paper, we present a programming and execution model called Otello where isolation is extended to arbitrarily nested parallel tasks with irregular accesses to heap data. At the same time, no additional burden is imposed on the programmer, who only exposes parallelism by creating and synchronizing parallel tasks, leaving the job of ensuring isolation to the underlying compiler and runtime system. Otello extends our past work on Aida execution model and the delegated isolation mechanism [22] to the setting of nested parallelism. The basic runtime construct in Aida and Otello is an assembly: a task equipped with a region in the shared heap that it owns. When an assembly A conflicts with an assembly B, A transfers-or delegates-its code and owned region to a carefully selected assembly C in a way that will ensure isolation with B, leaving the responsibility of re-executing task A to C. The choice of C depends on the nesting relationship between A and B. We have implemented Otello on top of the Habanero Java (HJ) parallel programming language [8], and used this implementation to evaluate Otello on collections of nested task-parallel benchmarks and non-nested transactional benchmarks from past work. On the nested task-parallel bench-marks, Otello achieves scalability comparable to HJ programs without built-in isolation, and the relative overhead of Otello is lower than that of many published data-race detection algorithms that detect the isolation violations (but do not enforce isolation). For the transactional benchmarks, Otello incurs lower overhead than a state-of-the-art software transactional memory system (Deuce STM).

关键词： languages design Isolation programming abstractions Irregular parallelism Contention

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：