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

23rd acm conference on Object-Oriented programming Systems, languages, and Applications, OOPSLA 2008

作者： Ni, Yang Welc, Adam Adl-Tabatabai, Ali-Reza Bach, Moshe Berkowits, Sion Cownie, James Geva, Robert Kozhukow, Sergey Narayanaswamy, Ravi Olivier, Jeffrey Preis, Serguei Saha, Bratin Tal, Ady Tian, Xinmin Intel Corporation Santa Clara CA USA Intel Corporation Haifa Israel Intel Corporation Glasgow United Kingdom Intel Corporation Novosibirsk Russian Fed. Intel Corporation Champaign IL USA Intel Coporation Novosibirsk Russian Fed.

ISBN: (纸本)9781605582153

This paper presents a software transactional memory system that introduces first-class C++ language constructs for transactional programming. We describe new C++ language extensions, a production-quality optimizing C++ compiler that translates and optimizes these extensions, and a high-performance STM runtime library. The transactional language constructs support C++ language features including classes, inheritance, virtual functions, exception handling, and templates. The compiler automatically instruments the program for transactional execution and optimizes TM overheads. The runtime library implements multiple execution modes and implements a novel STM algorithm that supports both optimistic and pessimistic concurrency control. The runtime switches a transaction's execution mode dynamically to improve performance and to handle calls to precompiled functions and I/O libraries. We present experimental results on 8 cores (two quad-core CPUs) running a set of 20 non-trivial parallel programs. Our measurements show that our system scales well as the numbers of cores increases and that our compiler and runtime optimizations improve scalability. Copyright © 2008 acm.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Aspects and class-based security A survey of interactions between adviceWeaving and the java 2 security model

Aspects and class-based security A survey of interactions be...

引用

2nd Workshop on Virtual Machines and Intermediate languages for Emerging Modularization Mechanisms, VMIL 2008

作者： Sewe, Andreas Bockisch, Christoph Mezini, Mira Technische Universität Darmstadt Hochschulstr. 10 64289 Darmstadt Germany

ISBN: (纸本)9781605583846

Various aspect-oriented languages, e.g., AspectJ, Aspect- Werkz, and JAsCo, have been proposed as extensions to one particular object-oriented base language, namely Java. But these extensions do not fully take the interactions with the Java 2 security model into account. In particular, the implementation technique of advice weaving gives rise to two security issues: the erroneous assignment of aspects to protection domains and the violation of namespace separation. Therefore, a comprehensive discussion of the design choices available with respect to interactions with the dynamic class loading facilities of the Java VM is provided. ©2008.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

Checking race freedom via linear programming

引用

acm sigplan NOTICES 2008年第6期43卷 1-10页

作者： Terauchi, Tachio Tohoku Univ Sendai Miyagi 980 Japan

We present a new static analysis for race freedom and race detection. The analysis checks race freedom by reducing the problem to ( rational) linear programming. Unlike conventional static analyses for race freedom or race detection, our analysis avoids explicit computation of locksets and lock linearity/must-aliasness. Our analysis can handle a variety of synchronization idioms that more conventional approaches often have difficulties with, such as thread joining, semaphores, and signals. We achieve efficiency by utilizing modern linear programming solvers that can quickly solve large linear programming instances. This paper reports on the formal properties of the analysis and the experience with applying an implementation to real world C programs.

关键词： algorithms languages theory verification fractional capabilities linear programming

来源：评论

学校读者我要写书评

暂无评论

Principles of a reversible programming language 08

Principles of a reversible programming language

引用

2008 conference on Computing Frontiers, CF'08

作者： Yokoyama, Tetsuo Axelsen, Holger Bock Glück, Robert Graduate School of Information Science Nagoya University Furo-cho Chikusa-ku Nagoya 464-8601 Japan DIKU Department of Computer Science University of Copenhagen Universitetsparken 1 DK-2100 Copenhagen Ø Denmark

ISBN: (纸本)9781605580777

The principles of reversible programming languages are explicated and ilhistrated with reference to the design of a high-level imperative language, Janus. The fundamental properties for such languages include backward as well as forward determinism and reversible updates of data. The unique design features of the language include explicit postcondition assertions, direct access to an inverse semantics and the possibility of clean (i.e., garbage-free) computation of injective functions. We suggest the clean simulation of reversible Turing machines as a criterion for computing strength of reversible languages, and demonstrate this for Janus. We show the practicality of the language by implementation of a reversible fast Fourier transform. Our results indicate that the reversible programming paradigm has fundamental properties that are relevant to many different areas of computer science. Copyright 2008 acm.

关键词： Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Implicitly-threaded parallelism in Manticore

引用

acm sigplan NOTICES 2008年第9期43卷 119-130页

作者： Fluet, Matthew Rainey, Mike Reppy, John Shaw, Adam Toyota Technol Inst Chicago IL 60637 USA Univ Chicago Chicago IL 60637 USA

The increasing availability of commodity multicore processors is making parallel computing available to the masses. Traditional parallel languages are largely intended for large-scale scientific computing and tend not to be well-suited to programming the applications one typically finds on a desktop system. Thus we need new parallel-language designs that address a broader spectrum of applications. In this paper, we present Manticore, a language for building parallel applications on commodity multicore hardware including a diverse collection of parallel constructs for different granularities of work. We focus on the implicitly-threaded parallel constructs in our high-level functional language. We concentrate on those elements that distinguish our design from related ones, namely, a novel parallel binding form, a nondeterministic parallel case form, and exceptions in the presence of data parallelism. These features differentiate the present work from related work on functional data parallel language designs, which has focused largely on parallel problems with regular structure and the compiler transformations - most notably, flattening - that make such designs feasible. We describe our implementation strategies and present some detailed examples utilizing various mechanisms of our language.

关键词： design languages implicitly-threaded parallelism data parallelism parallel binding parallel case exceptions

来源：评论

学校读者我要写书评

暂无评论

Expressive and safe static reflection with MorphJ

引用

acm sigplan NOTICES 2008年第6期43卷 79-89页

作者： Huang, Shan Shan Smaragdakis, Yannis Georgia Inst Technol Coll Comp Atlanta GA 30332 USA Univ Oregon Dept Comp & Informat Sci Eugene OR 97403 USA

Recently, language extensions have been proposed for Java and C# to support pattern-based reflective declaration. These extensions introduce a disciplined form of meta-programming and aspect-oriented programming to mainstream languages: They allow members of a class (i.e., fields and methods) to be declared by statically iterating over and pattern-matching on members of other classes. Such techniques, however, have been unable to safely express simple, but common, idioms such as declaring getter and setter methods for fields. In this paper, we present a mechanism that addresses the lack of expressiveness in past work without sacrificing safety. Our technique is based on the idea of nested patterns that elaborate the outer-most pattern with blocking or enabling conditions. We implemented this mechanism in a language, MorphJ. We demonstrate the expressiveness of MorphJ with real-world applications. In particular, the MorphJ reimplementation of DSTM2, a software transactional memory library, reduces 1,107 lines of Java reflection and bytecode engineering library calls to just 374 lines of MorphJ code. At the same time, the MorphJ solution is both high level and safer, as MorphJ can separately type check generic classes and catch errors early. We present and formalize the MorphJ type system, and offer a type-checking algorithm.

关键词： languages object-oriented programming structural abstraction class morphing aspect-oriented programming meta-programming language extensions

来源：评论

学校读者我要写书评

暂无评论

Orchestrating the execution of stream programs on multicore platforms

引用

acm sigplan NOTICES 2008年第6期43卷 114-124页

作者： Kudlur, Manjunath Mahlke, Scott Univ Michigan Adv Comp Architecture Lab Ann Arbor MI 48109 USA

While multicore hardware has become ubiquitous, explicitly parallel programming models and compiler techniques for exploiting parallelism on these systems have noticeably lagged behind. Stream programming is one model that has wide applicability in the multimedia, graphics, and signal processing domains. Streaming models execute as a set of independent actors that explicitly communicate data through channels. This paper presents a compiler technique for planning and orchestrating the execution of streaming applications on multicore platforms. An integrated unfolding and partitioning step based on integer linear programming is presented that unfolds data parallel actors as needed and maximally packs actors onto cores. Next, the actors are assigned to pipeline stages in such a way that all communication is maximally overlapped with computation on the cores. To facilitate experimentation, a generalized code generation template for mapping the software pipeline onto the Cell architecture is presented. For a range of streaming applications, a geometric mean speedup of 14.7x is achieved on a 16-core Cell platform compared to a single core.

关键词： languages algorithms performance StreamIt cell processor multicore stream programming software pipelining

来源：评论

学校读者我要写书评

暂无评论

EventScript: An event-processing language based on regular expressions with actions

引用

acm sigplan NOTICES 2008年第7期43卷 111-120页

作者： Cohen, Norman H. Kalleberg, Karl Trygve IBM Thomas J Watson Res Ctr Hawthorne NY USA Univ Bergen N-5020 Bergen Norway

EventScript is a simple but powerful language for programming reactive processes. A stream of incoming events is matched against a regular expression. Actions embedded within the regular expression are executed in response to the matching of patterns of events. These actions include assigning computed values to variables and emitting output events. The definition of EventScript presented a number of novel and interesting language-design choices. EventScript has an efficient implementation, and has been used in a development environment for complex event-based applications. We have used EventScript to program both small examples and large industrial applications. Readers of EventScript programs find them easy to understand, and are comfortable with the familiar model of matching regular expressions.

关键词： algorithms performance design experimentation languages theory event processing regular expressions reactive programs sensors actuators

来源：评论

学校读者我要写书评

暂无评论

Sketching concurrent data structures

引用

acm sigplan NOTICES 2008年第6期43卷 136-148页

作者： Solar-Lezama, Armando Jones, Christopher Grant Bodik, Rastislav Univ Calif Berkeley Berkeley CA 94720 USA

We describe PSKETCH, a program synthesizer that helps programmers implement concurrent data structures. The system is based on the concept of sketching, a form of synthesis that allows programmers to express their insight about an implementation as a partial program: a sketch. The synthesizer automatically completes the sketch to produce an implementation that matches a given correctness criteria. PSKETCH is based on a new counterexample-guided inductive synthesis algorithm (CEGIS) that generalizes the original sketch synthesis algorithm from [ 20] to cope efficiently with concurrent programs. The new algorithm produces a correct implementation by iteratively generating candidate implementations, running them through a verifier, and if they fail, learning from the counterexample traces to produce a better candidate;converging to a solution in a handful of iterations. PSKETCH also extends SKETCH with higher-level sketching constructs that allow the programmer to express her insight as a "soup" of ingredients from which complicated code fragments must be assembled. Such sketches can be viewed as syntactic descriptions of huge spaces of candidate programs ( over 1 0 8 candidates for some sketches we resolved). We have used the PSKETCH system to implement several classes of concurrent data structures, including lock-free queues and concurrent sets with fine-grained locking. We have also sketched some other concurrent objects including a sense-reversing barrier and a protocol for the dining philosophers problem;all these sketches resolved in under an hour.

关键词： languages design sketching synthesis concurrency SAT SPIN

来源：评论

学校读者我要写书评

暂无评论

A study of concurrent real-time garbage collectors

引用

acm sigplan NOTICES 2008年第6期43卷 33-44页

作者： Pizlo, Filip Petrank, Erez Steensgaard, Bjarne Purdue Univ W Lafayette IN 47907 USA Microsoft Res Redmond WA 98052 USA

Concurrent garbage collection is highly attractive for real-time systems, because offloading the collection effort from the executing threads allows faster response, allowing for extremely short deadlines at the microseconds level. Concurrent collectors also offer much better scalability over incremental collectors. The main problem with concurrent real-time collectors is their complexity. The first concurrent real-time garbage collector that can support fine synchronization, STOPLESS, has recently been presented by Pizlo et al. In this paper, we propose two additional ( and different) algorithms for concurrent real-time garbage collection: CLOVER and CHICKEN. Both collectors obtain reduced complexity over the first collector STOPLESS, but need to trade a benefit for it. We study the algorithmic strengths and weaknesses of CLOVER and CHICKEN and compare them to STOPLESS. Finally, we have implemented all three collectors on the Bartok compiler and runtime for C# and we present measurements to compare their efficiency and responsiveness.

关键词： algorithms design performance reliability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：