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

acm sigplan conference on programming language design and implementation

作者： Inoue, Hiroshi Komatsu, Hideaki Nakatani, Toshio IBM Tokyo Res Lab Yamato Kanagawa 2428502 Japan

ISBN: (纸本)9781605583921

More and more server workloads are becoming Web-based. In these Web-based workloads, most of the memory objects are used only during one transaction. We study the effect of the memory management approaches on the performance of such Web-based applications on two modern multicore processors. In particular, using six PHP applications, we compare a general-purpose allocator (the default allocator of the PHP runtime) and a region-based allocator, which can reduce the cost of memory management by not supporting per-object free. The region-based allocator achieves better performance for all workloads on one processor core due to its smaller memory management cost. However, when using eight cores, the region-based allocator suffers from hidden costs of increased bus traffics and the performance is reduced for many workloads by as much as 27.2% compared to the default allocator. This is because the memory bandwidth tends to become a bottleneck in systems with multicore processors. We propose a new memory management approach, defrag-dodging, to maximize the performance of the Web-based workloads on multicore processors. In our approach, we reduce the memory management cost by avoiding defragmentation overhead in the malloc and free functions during a transaction. We found that the transactions in Web-based applications are short enough to ignore heap fragmentation, and hence the costs of the defragmentation activities in existing general-purpose allocators outweigh their benefits. By comparing our approach against the region-based approach, we show that a per-object free capability can reduce bus traffic and achieve higher performance on multicore processors. We demonstrate that our defrag-dodging approach improves the performance of all the evaluated applications on both processors by up to 11.4% and 51.5% over the default allocator and the region-based allocator, respectively.

关键词： Dynamic memory management Region-based memory management Scripting language Web-based applications

来源：评论

学校读者我要写书评

暂无评论

A different kind of programming languages course

A different kind of programming languages course

引用

OOPSLA 2009 Companion - 24th Annual acm conference on Object-Oriented programming, Systems, languages and Applications, OOPSLA 2009

作者： Yeager, Dorian P. Grove City College Grove City PA United States

ISBN: (纸本)9781605587660

The complexity of the well-explored regions of the programming language design space has increased substantially in the last twenty-five years with the addition of a large number of object-oriented programming languages (OOPLs). This design domain was already known to be large and complex before OOPLs came on the scene, and many offerings of the standard programming languages course before that time did not even mention the object-oriented programming (OOP) paradigm. Now that OOP has become mainstream, undergraduate programs which include a course on programming language design and implementation have responded by expanding their existing course or by jettisoning some of the alternative ideas in favor of expanded coverage of OOPLs. There are two facts, however, which must be confronted as we consider what information we would like to pass on to our students in this fascinating area of our discipline. The first is that the design space represented by OOPLs is large enough to justify a separate course, and the second is that a large number of ideas from other language paradigms appear in subsets of well-known languages for OOP. This paper presents a course in the design and implementation of programming languages that (as OOP itself did in the late eighties) turns some accepted notions "inside out" by proposing that the entire course be presented from the OOP point of view. Such a course has been offered by Grove City College for a decade and has matured into a very effective means of communicating essential programming language design and implementation ideas to our students. The course could be offered as the only advanced course in the area, as one course in a two-semester sequence, or as an alternative to the traditional course. Copyright © 2009 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Effective Interactive Proofs for Higher-Order Imperative Programs

Effective Interactive Proofs for Higher-Order Imperative Pro...

引用

14th acm sigplan International conference on Functional programming

作者： Chlipala, Adam Malecha, Gregory Morrisett, Greg Shinnar, Avraham Wisnesky, Ryan Harvard Univ Cambridge MA 02138 USA

ISBN: (纸本)9781605583327

We present a new approach for constructing and verifying higher-order, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is based on Hoare Type Theory. That original system was a proof of concept, where every program verification was accomplished via laborious manual proofs, with much code devoted to uninteresting low-level details. In this paper, we present a re-implementation of Ynot which makes it possible to implement fully-verified, higher-order imperative programs with reasonable proof burden. At the same time, our new system is implemented entirely in Coq source files, showcasing the versatility of that proof assistant as a platform for research on language design and verification. Both versions of the system have been evaluated with case studies in the verification of imperative data structures, such as hash tables with higher-order iterators. The verification burden in our new system is reduced by at least an order of magnitude compared to the old system, by replacing manual proof with automation. The core of the automation is a simplification procedure for implications in higher-order separation logic, with hooks that allow programmers to add domain-specific simplification rules. We argue for the effectiveness of our infrastructure by verifying a number of data structures and a packrat parser, and we compare to similar efforts within other projects. Compared to competing approaches to data structure verification, our system includes much less code that must be trusted;namely, about a hundred lines of Coq code defining a program logic. All of our theorems and decision procedures have or build machine-checkable correctness proofs from first principles, removing opportunities for tool bugs to create faulty verifications.

关键词： functional programming interactive proof assistants dependent types separation logic

来源：评论

学校读者我要写书评

暂无评论

Multiparadigm programming in Object-Oriented languages: Current Research Report on the Workshop MPOOL'08 at ECOOP 2008

引用

22nd European conference on Object-Oriented programming (ECOOP 2008)

作者： Striegnitz, Joerg Davis, Kei Univ Appl Sci Regensburg D-93053 Regensburg Germany Los Alamos Natl Lab Los Alamos 87545 NM USA

ISBN: (纸本)9783642020469

While OO has, become ubiquitously employed for design;implementation, and even conceptualization, many practitioners recognize the concomitant need for other programming paradigms according to problem domain. Nevertheless, the choice of a programming paradigm is strongly influenced by the supporting programming language facilities. In turn, choice of programming language is usually highly constrained by practical considerations. We seek answers to the question of how to address the need for other programming paradigms, or even domain specific languages, in the general context of OO languages. It is clear that this field is active and fluid: novel, disparate approaches' and techniques are still being discovered or invented, And this very novelty adds a. significant element of intellectual entertainment. This article describes the cross section of research efforts reported at the, workshop on Multiparadigm programming in Object-Oriented languages held at, the 2008 European conference on Object-Oriented programming.

关键词： C# 3.0 CLOS Closures Delegates design patterns Eiffel Extension methods Function objects Functional programming Java 7 Multiparadigm programming Object-oriented programming OCaml Open classes Scala Smalltalk

来源：评论

学校读者我要写书评

暂无评论

PLDI'07: Proceedings of the 2007 acm sigplan conference on programming language design and implementation

PLDI'07: Proceedings of the 2007 ACM SIGPLAN Conference on P...

引用

PLDI'07: 2007 acm sigplan conference on programming language design and implementation

ISBN: (纸本)1595936335

The proceedings contain 45 papers. The topics discussed include: automatically classifying benign and harmful data racesallusing replay analysis;sound and precise analysis of web applications for injection vulnerabilities;fault-tolerant typed assembly language;a certified type-preserving compiler from lambda calculus to assembly language;certified self-modifying code;enforcing isolation and ordering in STM;improved error reporting for software that uses black-box components;thin slicing;static specification inference using predicate mining;automatic inference of optimizer flow functions from semantic meanings;automatic inversion generates divide-and-conquer parallel programs;sketching stencils;combining events and threads for scalable network services implementation;reliable and efficient programming abstractions for wireless sensor networks;and optimistic parallelism requires abstractions.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Checking Race Freedom via Linear programming 08

Checking Race Freedom via Linear Programming

引用

acm sigplan conference on programming language design and implementation

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

ISBN: (纸本)9781595938602

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 modem 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.

关键词： Fractional Capabilities Linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：