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

Descend: A Safe GPU Systems programming language

proceedings OF THE acm ON programming languageS-PacmPL 2024年第PLDI期8卷 841-864页

作者： Koepcke, Bastian Gorlatch, Sergei Steuwer, Michel Univ Munster Munster Germany Tech Univ Berlin Berlin Germany

Graphics Processing Units (GPU) offer tremendous computational power by following a throughput oriented paradigm where many thousand computational units operate in parallel. programming such massively parallel hardware is challenging. Programmers must correctly and efficiently coordinate thousands of threads and their accesses to various shared memory spaces. Existing mainstream GPU programming languages, such as CUDA and OpenCL, are based on C/C++ inheriting their fundamentally unsafe ways to access memory via raw pointers. This facilitates easy to make, but hard to detect bugs, such as data races and deadlocks. In this paper, we present Descend: a safe GPU programming language. In contrast to prior safe high-level GPU programming approaches, Descend is an imperative GPU systems programming language in the spirit of Rust, enforcing safe CPU and GPU memory management in the type system by tracking Ownership and Lifetimes. Descend introduces a new holistic GPU programming model where computations are hierarchically scheduled over the GPU's execution resources: grid, blocks, warps, and threads. Descend's extended Borrow checking ensures that execution resources safely access memory regions without data races. For this, we introduced views describing safe parallel access patterns of memory regions, as well as atomic variables. For memory accesses that can't be checked by our type system, users can annotate limited code sections as unsafe. We discuss the memory safety guarantees offered by Descend and evaluate our implementation using multiple benchmarks, demonstrating that Descend is capable of expressing real-world GPU programs showing competitive performance compared to manually written CUDA programs lacking Descend's safety guarantees.

关键词： GPU programming language design memory safety type systems

来源：评论

学校读者我要写书评

暂无评论

Java without the coffee breaks: A nonintrusive multiprocessor garbage collector 01

Java without the coffee breaks: A nonintrusive multiprocesso...

引用

acm sigplan conference on programming language design and implementation (PLDI)

作者： Bacon, DF Attanasio, CR Lee, HB Rajan, VT Smith, S IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA

ISBN: (纸本)9781581134148

The deployment of Java as a concurrent programming language has created a critical need for high-performance, concurrent, and incremental multiprocessor garbage collection. We present the Recycler, a fully concurrent pure reference counting garbage collector that we have implemented in the Jalapeno Java virtual machine running on shared memory multiprocessors. While a variety of multiprocessor collectors have been proposed and some have been implemented, experimental data is limited and there is little quantitative basis for comparison between different algorithms. We present measurements of the Recycler and compare it against a non-concurrent but parallel load-balancing mark-and-sweep collector (that we also implemented in Jalapeno), and evaluate the classical tradeoff between response time and throughput. When processor or memory resources are limited, the Recycler runs at about 90% of the speed of the mark-and-sweep collector. However, with an extra processor to run collection and with a moderate amount of memory headroom, the Recycler is able to operate without ever blocking the mutators and achieves a maximum measured mutator delay of only 2.6 milliseconds for our benchmarks. End-to-end execution time is usually within 5%.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Valgrind: A framework for heavyweight dynamic binary instrumentation 07

Valgrind: A framework for heavyweight dynamic binary instrum...

引用

conference on programming language design and implementation

作者： Nethercote, Nicholas Seward, Julian Natl ICT Australia Melbourne Vic Australia OpenWorks LLP Cambridge England

ISBN: (纸本)9781595936332

Dynamic binary instrumentation (DBI) frameworks make it easy to build dynamic binary analysis (DBA) tools such as checkers and profilers. Much of the focus on DBI frameworks has been on performance;little attention has been paid to their capabilities. As a result, we believe the potential of DBI has not been fully exploited. In this paper we describe Valgrind, a DBI framework designed for building heavyweight DBA tools. We focus on its unique support for shadow values - a powerful but previously little-studied and difficult-to-implement DBA technique, which requires a tool to shadow every register and memory value with another value that describes it. This support accounts for several crucial design features that distinguish Valgrind from other DBI frameworks. Because of these features, lightweight tools built with Valgrind run comparatively slowly, but Valgrind can be used to build more interesting, heavyweight tools that are difficult or impossible to build with other DBI frameworks such as Pin and DynamoRIO.

关键词： design performance experimentation Valgrind Memcheck dynamic binary instrumentation dynamic binary analysis shadow values

来源：评论

学校读者我要写书评

暂无评论

Declarative programming over Eventually Consistent Data Stores 15

Declarative Programming over Eventually Consistent Data Stor...

引用

36th acm sigplan conference on programming language design and implementation

作者： Sivaramakrishnan, K. C. Kaki, Gowtham Jagannathan, Suresh Univ Cambridge Cambridge CB2 1TN England Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9781450334686

User-facing online services utilize geo-distributed data stores to minimize latency and tolerate partial failures, with the intention of providing a fast, always-on experience. However, geo-distribution does not come for free;application developers have to contend with weak consistency behaviors, and the lack of abstractions to composably construct high-level replicated data types, necessitating the need for complex application logic and invariably exposing inconsistencies to the user. Some commercial distributed data stores and several academic proposals provide a lattice of consistency levels, with stronger consistency guarantees incurring increased latency and throughput costs. However, correctly assigning the right consistency level for an operation requires subtle reasoning and is often an error-prone task. In this paper, we present QUELEA, a declarative programming model for eventually consistent data stores (ECDS), equipped with a contract language, capable of specifying fine-grained application-level consistency properties. A contract enforcement system analyses contracts, and automatically generates the appropriate consistency protocol for the method protected by the contract. We describe an implementation of QUELEA on top of an off-the-shelf ECDS that provides support for coordination-free transactions. Several benchmarks including two large web applications, illustrate the effectiveness of our approach.

关键词： languages Performance Eventual Consistency Availability CRDTs Axiomatic Contracts Contract Classification Distributed Transactions SMT solvers Decidable Logic Quelea Cassandra Haskell

来源：评论

学校读者我要写书评

暂无评论

The ATOMOσ transactional programming language

The ATOMOσ transactional programming language

引用

PLDI 2006 - 2006 acm sigplan conference on programming language design and implementation

作者： Carlstrom, Brian D. McDonald, Austen Chafi, Hassan Chung, JaeWoong Minh, Chi Cao Kozyrakis, Christos Olukotun, Kunle Computer Systems Laboratory Stanford University

ISBN: (纸本)1595933204

Atomos is the first programming language with implicit transactions, strong atomicity, and a scalable multiprocessor implementation. Atomos is derived from Java, but replaces its synchronization and conditional wailing constructs with simpler transactional alternatives. The Atomos watch statement allows programmers to specify fine-grained watch sets used with the Atomos retry conditional wailing statement for efficient transactional conflict-driven wakeup even in transactional memory systems with a limited number of transactional contexts. Aloinos supports open-nested transactions, which are necessary for building both scalable application programs and virtual machine implementations. The implementation of the Atomos scheduler demonstrates the use of open nesting within the virtual machine and introduces the concept of transactional memory violation handlers that allow programs to recover from data dependency violations without rolling back. Atomos programming examples are given to demonstrate the usefulness of transactional programming primitives. Atomos and Java are compared through the use of several benchmarks. The results demonstrate both the improvements in parallel programming ease and parallel program performance provided by Atomos. Copyright © 2006 acm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Globally Precise-restartable Execution of Parallel Programs 14

Globally Precise-restartable Execution of Parallel Programs

引用

35th acm sigplan conference on programming language design and implementation (PLDI)

作者： Gupta, Gagan Sridharan, Srinath Sohi, Gurindar S. Univ Wisconsin Madison WI 53706 USA

ISBN: (纸本)9781450327848

Emerging trends in computer design and use are likely to make exceptions, once rare, the norm, especially as the system size grows. Due to exceptions, arising from hardware faults, approximate computing, dynamic resource management, etc., successful and error-free execution of programs may no longer be assured. Yet, designers will want to tolerate the exceptions so that the programs execute completely, efficiently and without external intervention. Modern computers easily handle exceptions in sequential programs, using precise interrupts. But they are ill-equipped to handle exceptions in parallel programs, which are growing in prevalence. In this work we introduce the notion of globally precise-restartable execution of parallel programs, analogous to precise-interruptible execution of sequential programs. We present a software runtime recovery system based on the approach to handle exceptions in suitably-written parallel programs. Qualitative and quantitative analyses show that the proposed system scales with the system size, especially when exceptions are frequent, unlike the conventional checkpoint-and-recovery method.

关键词： design Experimentation Measurement Performance Reliability Deterministic Multithreading Precise Exceptions

来源：评论

学校读者我要写书评

暂无评论

Kill-safe synchronization abstractions

Kill-safe synchronization abstractions

引用

proceedings of the 2004 acm sigplan conference on programming language design and implementation (PLDI'04)

作者： Flatt, Matthew Findler, Robert Bruce University of Utah United States University of Chicago United States

When an individual task can be forcefully terminated at any time, cooperating tasks must communicate carefully. For example, if two tasks share an object, and if one task is terminated while it manipulates the object, the object may remain in an inconsistent or frozen state that incapacitates the other task. To support communication among terminable tasks, language run-time systems (and operating systems) provide kill-safe abstractions for inter-task communication. No kill-safe guarantee is available, however, for abstractions that are implemented outside the run-time system. In this paper, we show how a run-time system can support new kill-safe abstractions without requiring modification to the run-time system, and without requiring the run-time system to trust any new code. Our design frees the run-time implementor to provide only a modest set of synchronization primitives in the trusted computing base, while still allowing tasks to communicate using sophisticated abstractions.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Extensible algebraic datatypes with defaults 01

Extensible algebraic datatypes with defaults

引用

6th International conference on Functional programming (ICFP 2001)

作者： Zenger, M Odersky, M Swiss Fed Inst Technol INR Ecublens CH-1015 Lausanne Switzerland

ISBN: (纸本)9781581134155

A major problem for writing extensible software arises when recursively defined datatypes and operations on these types have to be extended simultaneously without modifying existing code. This paper introduces Extensible Algebraic Datatypes with Defaults which promote a simple programming pattern to solve this well known problem. We show that it is possible to encode extensible algebraic datatypes in an object-oriented language, using a new design pattern for extensible visitors. Extensible algebraic datatypes have been successfully applied in the implementation of an extensible Java compiler. Our technique allows for the reuse of existing components in compiler extensions without the need for any adaptations.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Fast code generation using automatically-generated decision trees 90

Fast code generation using automatically-generated decision ...

引用

proceedings of the acm sigplan '90 conference on programming language design and implementation

作者： Wendt, Alan L. Colorado State Univ Fort Collins United States

ISBN: (纸本)0897913647

Several recent code generators [4,5,6,8] use dagrewriting rules to accomplish both code generation and peephole optimization, and they compile these rules into hard code to generate code quickly. The chop system [6], for example, runs twice as fast as both pcc and the GNU C compiler gcc on a Sun 3/50 system and generates comparable code. These figures are for entire compilers;the code generators themselves run about seven times faster than comparable code generators. This paper describes a new system, currently under development, that further increases the speed of automatically-generated retargetable code generation. It offers two principal advantages over its predecessors.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

DOPPIO: Breaking the Browser language Barrier 14

DOPPIO: Breaking the Browser Language Barrier

引用

35th acm sigplan conference on programming language design and implementation (PLDI)

作者： Vilk, John Berger, Emery D. Univ Massachusetts Sch Comp Sci Amherst MA 01003 USA

ISBN: (纸本)9781450327848

Web browsers have become a de facto universal operating system, and JavaScript its instruction set. Unfortunately, running other languages in the browser is not generally possible. Translation to JavaScript is not enough because browsers are a hostile environment for other languages. Previous approaches are either non-portable or require extensive modifications for programs to work in a browser. This paper presents DOPPIO, a JavaScript-based runtime system that makes it possible to run unaltered applications written in general-purpose languages directly inside the browser. DOPPIO provides a wide range of runtime services, including a file system that enables local and external (cloud-based) storage, an unmanaged heap, sockets, blocking I/O, and multiple threads. We demonstrate DOPPIO's usefulness with two case studies: we extend Emscripten with DOPPIO, letting it run an unmodified C++ application in the browser with full functionality, and present DOPPIOJVM, an interpreter that runs unmodified JVM programs directly in the browser. While substantially slower than a native JVM (between 24 x and 42 x slower on CPU-intensive benchmarks in Google Chrome), DOPPIOJVM makes it feasible to directly reuse existing, non compute-intensive code.

关键词： languages design Web Browsers programming languages JVM Operating Systems JavaScript

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：