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

Merge: A programming model for heterogeneous multi-core systems

acm sigplan NOTICES 2008年第3期43卷 287-296页

作者： Linderman, Michael D. Collins, Jamison D. Wang, Hong Meng, Teresa H. Stanford Univ Dept Elect Engn Stanford CA 94305 USA Intel Corp Microarchitecture Res Lab Santa Cruz CA USA

In this paper we propose the Merge framework, a general purpose programming model for heterogeneous multi-core systems. The Merge framework replaces current ad hoc approaches to parallel programming on heterogeneous platforms with a rigorous, library-based methodology that can automatically distribute computation across heterogeneous cores to achieve increased energy and performance efficiency. The Merge framework provides (1) a predicate dispatch-based library system for managing and invoking function variants for multiple architectures;(2) a high-level, library-oriented parallel language based on map-reduce;and (3) a compiler and runtime which implement the map-reduce language pattern by dynamically selecting the best available function implementations for a given input and machine configuration. Using a generic sequencer architecture interface for heterogeneous accelerators, the Merge framework can integrate function variants for specialized accelerators, offering the potential for to-the-metal performance for a wide range of heterogeneous architectures, all transparent to the user. The Merge framework has been prototyped on a heterogeneous platform consisting of an Intel Core 2 Duo CPU and an 8-core 32-thread Intel Graphics and Media Accelerator X3000, and a homogeneous 32-way Unisys SNIP system with Intel Xeon processors. We implemented a set of benchmarks using the Merge framework and enhanced the library with X3000 specific implementations, achieving speedups of 3.6x - 8.5x using the X3000 and 5.2x - 22x using the 32-way system relative to the straight C reference implementation on a single IA32 core.

关键词： performance design languages heterogeneous multi-core GPGPU predicate dispatch

来源：评论

学校读者我要写书评

暂无评论

Understanding the propagation of hard errors to software and implications for resilient system design

引用

acm sigplan NOTICES 2008年第3期43卷 265-276页

作者： Li, Man-Lap Ramachandran, Pradeep Sahoo, Swarup K. Adve, Sarita V. Adve, Vikram S. Zhou, Yuanyuan Univ Illinois Dept Comp Sci Urbana IL 61801 USA

With continued CMOS scaling, future shipped hardware will be increasingly vulnerable to in-the-field faults. To be broadly deployable, the hardware reliability solution must incur low overheads, precluding use of expensive redundancy. We explore a cooperative hardware-software solution that watches for anomalous software behavior to indicate the presence of hardware faults. Fundamental to such a solution is a characterization of how hardware faults in different micro architectural structures of a modern processor propagate through the application and OS. This paper aims to provide such a characterization, resulting in identifying low-cost detection methods and providing guidelines for implementation of the recovery and diagnosis components of such a reliability solution. We focus on hard faults because they are increasingly important and have different system implications than the much studied transients. We achieve our goals through fault injection experiments with a micro architecture-level full system timing simulator. Our main results are: (1) we are able to detect 95% of the unmasked faults in 7 out of 8 studied micro architectural structures with simple detectors that incur zero to little hardware overhead;(2) over 86% of these detections are within latencies that existing hardware checkpointing schemes can handle, while others require software checkpointing;and (3) a surprisingly large fraction of the detected faults corrupt OS state, but almost all of these are detected with latencies short enough to use hardware checkpointing, thereby enabling OS recovery in virtually all such cases.

关键词： reliability experimentation design error detection architecture permanent fault fault injection

来源：评论

学校读者我要写书评

暂无评论

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

PLDI 2006 - Proceedings of the 2006 ACM SIGPLAN Conference o...

引用

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

ISBN: (纸本)1595933204

The proceedings contain 36 papers. The topics discussed include: optimizing memory transactions;better extensibility through modular syntax;practical dynamic software updating for C;shared memory programming for large scale machines;SAFECode: enforcing allias analysis for weakly typed languages;pruning dynamic slices with confidence;context-sensitive domain-independent algorithm composition and selection;a global progressive register allocator;accurate, efficient, and adaptive calling context profiling;eventrons: a safe programming construct for high-frequency hard real time applications;continuations and transducer composition;effective static race detection for Java;profile-guided proactive garbage collection for locality optimization;refinement-based context-sensitive points - to analysis for Java;modular verification of assembly code with stack-based control abstractions;and termination proofs for systems code.

关键词： Data storage equipment

来源：评论

学校读者我要写书评

暂无评论

Regularly annotated set constraints 07

Regularly annotated set constraints

引用

conference on programming language design and implementation

作者： Kodumal, John Aiken, Alex Univ Calif Berkeley Coverity Inc Berkeley CA 94720 USA Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781595936332

A general class of program analyses are a combination of context-free and regular language reachability. We define regularly annotated set constraints, a constraint formalism that captures this class. Our results extend the class of reachability problems expressible naturally in a single constraint formalism, including such diverse applications as interprocedural dataflow analysis, precise type-based flow analysis, and pushdown model checking.

关键词： set constraints context-free language reachability flow analysis annotated inclusion constraints pushdown model checking

来源：评论

学校读者我要写书评

暂无评论

Combining events and threads for scalable network services - implementation and evaluation of monadic, application-level concurrency primitives 07

Combining events and threads for scalable network services -...

引用

conference on programming language design and implementation

作者： Li, Peng Zdancewic, Steve Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781595936332

This paper proposes to combine two seemingly opposed programming models for building massively concurrent network services: the event-driven model and the multithreaded model. The result is a hybrid design that offers the best of both worlds-the ease of use and expressiveness of threads and the flexibility and performance of events. This paper shows how the hybrid model can be implemented entirely at the application level using concurrency monads in Haskell, which provides type-safe abstractions for both events and threads. This approach simplifies the development of massively concurrent software in a way that scales to real-world network services. The Haskell implementation supports exceptions, symmetrical multiprocessing, software transactional memory, asynchronous I/O mechanisms and application-level network protocol stacks. Experimental results demonstrate that this monad-based approach has good performance: the threads are extremely lightweight (scaling to ten million threads), and the I/O performance compares favorably to that of Linux NPTL.

关键词： languages design experimentation performance measurement event thread concurrency networking programming scalability implementation monad haskell

来源：评论

学校读者我要写书评

暂无评论

A certified type-preserving compiler from lambda calculus to assembly language 07

A certified type-preserving compiler from lambda calculus to...

引用

conference on programming language design and implementation

作者： Chlipala, Adam Univ Calif Berkeley Berkeley CA 94720 USA

ISBN: (纸本)9781595936332

We present a certified compiler from the simply-typed lambda calculus to assembly language. The compiler is certified in the sense that it comes with a machine-checked proof of semantics preservation, performed with the Coq proof assistant. The compiler and the terms of its several intermediate languages are given dependent types that guarantee that only well-typed programs are representable. Thus, type preservation for each compiler pass follows without any significant "proofs" of the usual kind. Semantics preservation is proved based on denotational semantics assigned to the intermediate languages. We demonstrate how working with a type-preserving compiler enables type-directed proof search to discharge large parts of our proof obligations automatically.

关键词： languages verification compiler verification interactive proof assistants dependent types denotational semantics

来源：评论

学校读者我要写书评

暂无评论

Thread-modular shape analysis 07

Thread-modular shape analysis

引用

conference on programming language design and implementation

作者： Gotsman, Alexey Berdine, Josh Cook, Byron Sagiv, Mooly Univ Cambridge Cambridge CB2 1TN England Microsoft Corp Redmond WA 98052 USA

ISBN: (纸本)9781595936332

We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource invariant associated with each lock that describes the part of the heap protected by the lock. This allows us to use a sequential shape analysis on each thread. We show that resource invariants of a certain class can be characterized as least fixed points and computed via repeated applications of shape analysis only on each individual thread. Based on this approach, we have implemented a thread-modular shape analysis tool and applied it to concurrent heap-manipulating code from Windows device drivers.

关键词： abstract interpretation concurrent programming shape analysis static analysis

来源：评论

学校读者我要写书评

暂无评论

Mace: language support for building distributed systems 07

Mace: Language support for building distributed systems

引用

conference on programming language design and implementation

作者： Killian, Charles Anderson, James W. Braud, Ryan Jhala, Ranjit Vahdat, Amin Univ Calif San Diego La Jolla CA 92093 USA

ISBN: (纸本)9781595936332

Building distributed systems is particularly difficult because of the asynchronous, heterogeneous, and failure-prone environment where these systems must run. Tools for building distributed systems must strike a compromise between reducing programmer effort and increasing system efficiency. We present Mace, a C++ language extension and source-to-source compiler that translates a concise but expressive distributed system specification into a C++ implementation. Mace overcomes the limitations of low-level languages by providing a unified framework for networking and event handling, and the limitations of high-level languages by allowing programmers to write program components in a controlled and structured manner in C++. By imposing structure and restrictions on how applications can be written, Mace supports debugging at a higher level, including support for efficient model checking and causal-path debugging. Because Mace programs compile to C++, programmers can use existing C++ tools, including optimizers, profilers, and debuggers to analyze their systems.

关键词： languages reliability performance Mace domain specific languages model checking debugging distributed systems concurrency event driven programming

来源：评论

学校读者我要写书评

暂无评论

Reliable and efficient programming abstractions for wireless sensor networks 07

Reliable and efficient programming abstractions for wireless...

引用

conference on programming language design and implementation (PLDI)

作者： Kothari, Nupur Gummadi, Ramakrishna Millstein, Todd Govindan, Ramesh Univ So Calif Los Angeles CA 90089 USA Univ Calif Los Angeles Los Angeles CA 90024 USA

ISBN: (纸本)9781595936332

It is currently difficult to build practical and reliable programming systems out of distributed and resource-constrained sensor devices. The state of the art in today's sensornet programming is centered around a component-based language called nesC. nesC is a node-level language-a program is written for an individual node in the network-and nesC programs use the services of an operating system called TinyOS. We are pursuing an approach to programming sensor networks that significantly raises the level of abstraction over this practice. The critical change is one of perspective: rather than writing programs from the point of view of an individual node, programmers implement a central program that conceptually has access to the entire network. This approach pushes to the compiler the task of producing node-level programs that implement the desired behavior. We present the Pleiades programming language, its compiler, and its runtime. The Pleiades language extends the C language with constructs that allow programmers to name and access node-local state within the network and to specify simple forms of concurrent execution. The compiler and runtime system cooperate to implement Pleiades programs efficiently and reliably. First, the compiler employs a novel program analysis to translate Pleiades programs into message-efficient units of work implemented in nesC. The Pleiades runtime system orchestrates execution of these units, using TinyOS services, across a network of sensor nodes. Second, the compiler and runtime system employ novel locking, deadlock detection, and deadlock recovery algorithms that guarantee serializability in the face of concurrent execution. We illustrate the readability, reliability and efficiency benefits of the Pleiades language through detailed experiments, and demonstrate that the Pleiades implementation of a realistic application performs similar to a hand-coded nesC version that contains more than ten times as much code.

关键词： performance design languages reliability experimentation wireless sensor networks macroprogramming energy efficiency serializability deadlocks

来源：评论

学校读者我要写书评

暂无评论

Perl 6: Reconciling the Irreconcilable 07

Perl 6: Reconciling the Irreconcilable

引用

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

作者： Tang, Audrey Pugscode Org Taipei Taiwan

ISBN: (纸本)9781595935755

Perl is a general-purpose language, known for its vast number of freely available libraries. The Perl 6 project was started to improve the language's support for multi-paradigmatic programming, while retaining compatibility with the existing code base. This talk discusses how Perl 6 attempts to reconcile various competing paradigms in the field of programming language design, such as static vs. dynamic typechecking, nominal vs. structural subtyping, prototype vs. class-based objects, and lazy vs. eager evaluation. Moreover, this talk also covers the design and development of Pugs, a self-hosting Perl 6 implementation bootstrapped from Haskell, targeting multiple runtime environments, including Perl 5, JavaScript and Parrot.

关键词： design Experimentation Human factors languages Reliability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：