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

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

来源：评论

学校读者我要写书评

暂无评论

A practical automatic polyhedral parallelizer and locality optimizer

引用

acm sigplan NOTICES 2008年第6期43卷 101-113页

作者： Bondhugula, Uday Hartono, Albert Ramanujam, J. Sadayappan, P. Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA Louisiana State Univ Dept Elect & Comp Engn Baton Rouge LA 70803 USA Louisiana State Univ CCT Baton Rouge LA 70803 USA

We present the design and implementation of an automatic polyhedral source-to-source transformation framework that can optimize regular programs ( sequences of possibly imperfectly nested loops) for parallelism and locality simultaneously. Through this work, we show the practicality of analytical model-driven automatic transformation in the polyhedral model-far beyond what is possible by current production compilers. Unlike previous works, our approach is an end-to-end fully automatic one driven by an integer linear optimization framework that takes an explicit view of finding good ways of tiling for parallelism and locality using affine transformations. The framework has been implemented into a tool to automatically generate OpenMP parallel code from C program sections. Experimental results from the tool show very high speedups for local and parallel execution on multi-cores over state-of-the-art compiler frameworks from the research community as well as the best native production compilers. The system also enables the easy use of powerful empirical/iterative optimization for general arbitrarily nested loop sequences.

关键词： algorithms design experimentation performance automatic parallelization locality optimization polyhedral model loop transformations affine transformations tiling

来源：评论

学校读者我要写书评

暂无评论

design and evaluation of a compiler for embedded stream programs

引用

acm sigplan NOTICES 2008年第7期43卷 131-140页

作者： Newton, Ryan R. Girod, Lewis D. Craig, Michael B. Madden, Samuel R. Morrisett, J. Greg MIT CSAIL Cambridge MA 02139 USA Harvard Univ Cambridge MA 02138 USA

Applications that combine live data streams with embedded, parallel, and distributed processing are becoming more commonplace. WaveScript is a domain-specific language that brings high-level, type-safe, garbage-collected programming to these domains. This is made possible by three primary implementation techniques, each of which leverages characteristics of the streaming domain. First, we employ a novel evaluation strategy that uses a combination of interpretation and reification to partially evaluate programs into stream dataflow graphs. Second, we use profile-driven compilation to enable many optimizations that are normally only available in the synchronous (rather than asynchronous) dataflow domain. Finally, we incorporate an extensible system for rewrite rules to capture algebraic properties in specific domains (such as signal processing). We have used our language to build and deploy a sensor-network for the acoustic localization of wild animals, in particular, the Yellow-Bellied marmot. We evaluate WaveScript's performance on this application, showing that it yields good performance on both embedded and desktop-class machines, including distributed execution and substantial parallel speedups. Our language allowed us to implement the application rapidly, while outperforming a previous C implementation by over 35%, using fewer than half the lines of code. We evaluate the contribution of our optimizations to this success.

关键词： design languages performance stream processing language sensor networks

来源：评论

学校读者我要写书评

暂无评论

Orchestrating the Execution of Stream Programs on Multicore Platforms 08

Orchestrating the Execution of Stream Programs on Multicore ...

引用

acm sigplan conference on programming language design and implementation

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

ISBN: (纸本)9781595938602

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.

关键词： StreamIt Cell processor multicore stream programming software pipelining

来源：评论

学校读者我要写书评

暂无评论

Expressive and safe static reflection with MorphJ 08

Expressive and safe static reflection with MorphJ

引用

acm sigplan conference on programming language design and implementation

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

ISBN: (纸本)9781595938602

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

来源：评论

学校读者我要写书评

暂无评论

The design and implementation of Typed Scheme

The Design and Implementation of Typed Scheme

引用

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

作者： Tobin-Hochstadt, Sam Felleisen, Matthias Northeastern Univ PLT Boston MA 02115 USA

ISBN: (纸本)9781595936899

When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)discover critical pieces of design information every time they wish to change a program. This analysis step both slows down the maintenance process and may even introduce mistakes due to the violation of undiscovered invariants. This paper presents Typed Scheme, an explicitly typed extension of an untyped scripting language. Its type system is based on the novel notion of occurrence typing, which we formalize and mechanically prove sound. The implementation of Typed Scheme additionally borrows elements from a range of approaches, including recursive types, true unions and subtyping, plus polymorphism combined with a modicum of local inference. Initial experiments with the implementation suggest that Typed Scheme naturally accommodates the programming style of the underlying scripting language, at least for the first few thousand lines of ported code. © 2008 acm.

关键词： Type Systems Scheme

来源：评论

学校读者我要写书评

暂无评论

A study of concurrent real-time garbage collectors 08

A study of concurrent real-time garbage collectors

引用

acm sigplan conference on programming language design and implementation

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

ISBN: (纸本)9781595938602

关键词： algorithms design performance reliability

来源：评论

学校读者我要写书评

暂无评论

Automatic volume management for programmable microfluidics

引用

acm sigplan NOTICES 2008年第6期43卷 56-67页

作者： Amin, Ahmed M. Thottethodi, Mithuna Vijaykumar, T. N. Wereley, Steven Jacobson, Stephen C. Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA Purdue Univ Sch Mech Engn W Lafayette IN 47907 USA Indiana Univ Dept Chem Bloomington IN 47405 USA

Microfluidics has enabled lab-on-a-chip technology to miniaturize and integrate biological and chemical analyses to a single chip comprising channels, valves, mixers, heaters, separators, and sensors. Recent papers have proposed programmable labs-on-a-chip as an alternative to traditional application-specific chips to reduce design effort, time, and cost. While these previous papers provide the basic support for programmability, this paper identifies and addresses a practical issue, namely, fluid volume management. Volume management addresses the problem that the use of a fluid depletes it and unless the given volume of a fluid is distributed carefully among all its uses, execution may run out of the fluid before all its uses are complete. Additionally, fluid volumes should not overflow (i.e., exceed hardware capacity) or underflow (i.e., fall below hardware resolution). We show that the problem can be formulated as a linear programming problem ( LP). Because LP's complexity and slow execution times in practice may be a concern, we propose another approach, called DAGSolve, which over-constrains the problem to achieve linear complexity while maintaining good solution quality. We also propose two optimizations, called cascading and static replication, to handle cases involving extreme mix ratios and numerous fluid uses which may defeat both LP and DAGSolve. Using some real-world assays, we show that our techniques produce good solutions while being faster than LP.

关键词： algorithms design microfluidics programmable lab-on-a-chip fluid volume management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：