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

2011 acm International conference on Object Oriented programming Systems languages and Applications

作者： Lublinerman, Roberto Zhao, Jisheng Budimlic, Zoran Chaudhuri, Swarat Sarkar, Vivek Penn State Univ University Pk PA 16802 USA Rice Univ Houston TX 77251 USA

ISBN: (纸本)9781450309400

Isolation-the property that a task can access shared data without interference from other tasks-is one of the most basic concerns in parallel programming. In this paper, we present Aida, a new model of isolated execution for parallel programs that perform frequent, irregular accesses to pointer-based shared data structures. The three primary benefits of Aida are dynamism, safety and liveness guarantees, and programmability. First, Aida allows tasks to dynamically select and modify, in an isolated manner, arbitrary fine-grained regions in shared data structures, all the while maintaining a high level of concurrency. Consequently, the model can achieve scalable parallelization of regular as well as irregular shared-memory applications. Second, the model offers freedom from data races, deadlocks, and livelocks. Third, no extra burden is imposed on programmers, who access the model via a simple, declarative isolation construct that is similar to that for transactional memory. The key new insight in Aida is a notion of delegation among concurrent isolated tasks (known in Aida as assemblies). Each assembly A is equipped with a region in the shared heap that it owns-the only objects accessed by A are those it owns, guaranteeing race-freedom. The region owned by A can grow or shrink flexibly-however, when A needs to own a datum owned by B, A delegates itself, as well as its owned region, to B. From now on, B has the responsibility of re-executing the task A set out to complete. Delegation as above is the only inter-assembly communication primitive in Aida. In addition to reducing contention in a local, data-driven manner, it guarantees freedom from deadlocks and livelocks. We offer an implementation of Aida on top of the Habanero Java parallel programming language. The implementation employs several novel ideas, including the use of a union-find data structure to represent tasks and the regions that they own. A thorough evaluation using several irregular data-parallel bench

关键词： languages design Isolation programming abstractions Irregular parallelism Contention

来源：评论

学校读者我要写书评

暂无评论

Statically scoped object adaptation with expanders 06

Statically scoped object adaptation with expanders

引用

21st Annual acm sigplan conference on Object-oriented programming Systems, languages, and Applications, OOPSLA 2006

作者： Warth, Alessandro Stanojević, Milan Millstein, Todd Computer Science Department University of California Los Angeles

ISBN: (纸本)1595933484

This paper introduces the expander, a new object-oriented (OO) programming language construct designed to support object adaptation. Expanders allow existing classes to be noninvasively updated with new methods, fields, and superinterfaces. Each client can customize its view of a class by explicitly importing any number of expanders. This view then applies to all instances of that class, including objects passed to the client from other components. A form of expander overriding allows expanders to interact naturally with OO-style *** describe the design, implementation, and evaluation of eJava, an extension to Java supporting expanders. We illustrate eJava's syntax and semantics through several examples. The statically scoped nature of expander usage allows for a modular static type system that prevents several important classes of errors. We describe this modular static type system informally, formalize eJava and its type system in an extension to Featherweight Java, and prove a type soundness theorem for the formalization. We also describe a modular compilation strategy for eJava, which we have implemented using the Polyglot extensible compiler framework. Finally, we illustrate the practical benefits of eJava by using this compiler in two experiments. Copyright © 2006 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Idiomatic design

Idiomatic design

引用

10th Annual conference on Object-Oriented programming Systems, languages, and Applications, OOPSLA 1995

作者： Koenig, Andrew AT and T Bell Laboratories Murray HillNJ07974 United States

ISBN: (纸本)0897917219

Every problem has a context, which can include l community and culture implementation constraints language and system and probably other things too. A good design will take its context into account. If the culture demands it, that may mean, for example, using object-oriented techniques where they don't really apply or not using them in a case that seems to cry out for them. It may mean choosing a programming language without regard for its usual advantages or disadvantages. It may mean using a set of tools that some people may find cumbersome or outdated, It may call for all kinds of things that may seem nonsensical when viewed in isolation. But software systems do not exist in isolation. They would not be systems if they did. Any useful system must take its context into account. Unless we can answer the question "Good for what?" we cannot say whether or not a design is good.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Introducing acm sigplan International Workshop on Adaptive Self-Tuning Computing Systems for the Exaflop Era

ACM International Conference Proceeding Series

引用

acm International conference Proceeding Series 2011年 iii-iv页

作者： Fursin, Grigori Hundt, Robert Mars, Jason Kashnikov, Yuriy UVSQ France Google CA United States University of Virginia United States

来源：评论

学校读者我要写书评

暂无评论

Reliable and efficient programming abstractions for wireless sensor networks

引用

acm sigplan NOTICES 2007年第6期42卷 200-210页

作者： 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

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

来源：评论

学校读者我要写书评

暂无评论

ContextErlang: Introducing context-oriented programming in the actor model 12

ContextErlang: Introducing context-oriented programming in t...

引用

11th Annual International conference on Aspect Oriented Software Development, AOSD'12

作者： Salvaneschi, Guido Ghezzi, Carlo Pradella, Matteo DEEPSE Group DEI Politecnico di Milano Piazza L. Da Vinci 32 Milano Italy

ISBN: (纸本)9781450310925

Self-adapting systems are becoming widespread in emerging fields such as autonomic, mobile and ubiquitous computing. Context-oriented programming (COP) is a promising language-level solution for the implementation of context-aware, self-adaptive software. However, current COP approaches struggle to effectively manage the asynchronous nature of context provisioning. We argue that, to solve these issues, COP features should be designed to fit nicely in the concurrency model supported by the language. This work presents the design rationale of CONTEXTERLANG, which introduces COP in the Actor Model. We provide evidence that CONTEXTERLANG constitutes a viable solution to implement context-aware software in a highly concurrent and distributed setting. We discuss a case study and an evaluation of run-time performance. © 2012 acm.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

JAX Based Parallel Inference for Reactive Probabilistic programming 2022

JAX Based Parallel Inference for Reactive Probabilistic Prog...

引用

23rd International conference on languages, Compilers, and Tools for Embedded System (LCTES)

作者： Baudart, Guillaume Mandel, Louis Tekin, Reyyan PSL Univ DI ENS Ecole Normale Super CNRSInria Paris France IBM Res Armonk NY USA

ISBN: (纸本)9781450392662

ProbZelus is a synchronous probabilistic language for the design of reactive probabilistic models in interaction with an environment. Reactive inference methods continuously learn distributions over the unobserved parameters of the model from statistical observations. Unfortunately, this inference problem is in general intractable. Monte Carlo inference techniques thus rely on many independent executions to compute accurate approximations. These methods are expensive but can be parallelized. We propose to use JAX to parallelize ProbZelus reactive inference engine. JAX is a recent library to compile Python code which can then be executed on massively parallel architectures such as GPUs or TPUs. In this paper, we describe a new reactive inference engine implemented in JAX and the new associated JAX backend for ProbZelus. We show on existing benchmarks that our new parallel implementation outperforms the original sequential implementation for a high number of particles.

关键词： Probabilistic programming Reactive programming Streaming Inference Parallel Computing Compilation

来源：评论

学校读者我要写书评

暂无评论

ProSE: The Architecture and design of a Protein Discovery Engine 27

ProSE: The Architecture and Design of a Protein Discovery En...

引用

27th acm International conference on Architectural Support for programming languages and Operating Systems (ASPLOS)

作者： Robson, Eyes Xu, Ceyu Wills, Lisa Wu Univ Calif Berkeley Berkeley CA 94720 USA Duke Univ Durham NC USA

ISBN: (纸本)9781450392051

Protein language models have enabled breakthrough approaches to protein structure prediction, function annotation, and drug discovery. A primary limitation to the widespread adoption of these powerful models is the high computational cost associated with the training and inference of these models, especially at longer sequence lengths. We present the architecture, microarchitecture, and hardware implementation of a protein design and discovery accelerator, ProSE (Protein Systolic Engine). ProSE has a collection of custom heterogeneous systolic arrays and special functions that process transfer learning model inferences efficiently. The architecture marries SIMD-style computations with systolic array architectures, optimizing coarse-grained operation sequences across model layers to achieve efficiency without sacrificing generality. ProSE performs Protein BERT inference at up to 6.9x speedup and 48x power efficiency (performance/Watt) compared to one NVIDIA A100 GPU. ProSE achieves up to 5.5 x (12.7x) speedup and 173x (249x) power efficiency compared to TPUv3 (TPUv2).

关键词： Accelerators Neural Networks Transformers Domain-Specific Architecture NLP Protein design

来源：评论

学校读者我要写书评

暂无评论

1st acm sigplan/SIGSOFT International conference on Generative programming and Component Engineering, GPCE 2002

1st ACM SIGPLAN/SIGSOFT International Conference on Generati...

引用

1st acm sigplan/SIGSOFT International conference on Generative programming and Component Engineering, GPCE 2002

ISBN: (纸本)3540442847

The proceedings contain 20 papers. The special focus in this conference is on Generative programming and Component Engineering. The topics include: Program generation, termination, and binding-time analysis;generative programming for embedded systems;a specification and scripting language for binary data;memoization in type-directed partial evaluation;a protocol stack development tool using generative programming;building composable aspect-specific languages with logic metaprogramming;architectural refactoring in framework evolution;towards a modular program derivation via fusion and tupling;generative programming for embedded software;a framework for the detection and resolution of aspect interactions;bridging the gap between implementation and design;program termination analysis in polynomial time;generators for synthesis of qos adaptation in distributed real-time embedded systems;optimizing content management system pipelines;component-based programming for higher-order attribute grammars;altering java semantics via bytecode manipulation;meta-programming with concrete object syntax and managing dynamic changes in multi-stage program generation systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

design principles for internal domain-specific languages: A pattern catalog illustrated by Ruby 10

Design principles for internal domain-specific languages: A ...

引用

17th conference on Pattern languages of Programs, PLoP 2010

作者： Günther, Sebastian Cleenewerck, Thomas School of Computer Science University of Magdeburg Germany Software Language Engineering Lab Vrije Universiteit Brussel Belgium Universitätsplatz 2 D-39106 Magdeburg Germany Vrije Universiteit Brussel Faculty of Sciences DINF - SOFT Pleinlaan 2 B-1050 Brussels Belgium

ISBN: (纸本)9781450301077

Some programming languages, especially dynamic programming languages, offer suitable mechanisms for the construction of internal domain-specific languages (DSL). Internal DSLs inherit the facilities of their host language such as the availability of libraries, frameworks, tool support, and other DSLs. When developing an internal DSL, there are two challenges. First, to cope with the host language's syntactic and semantic restrictions. Careful and thoughtful extensions and modifications of the host language are crucial to overcome these restrictions without reverting to poor language design. Second, to support several design principles that are genuine for a DSL. Although there is an extensive body of knowledge about DSL design principles and desirable quality properties, it remains difficult to apply them, or to reason about whether a particular DSL exhibits specific desirable principles. Our objective is to put the two perspectives together. We research the most important design principles of a DSL and show how different patterns can be used to support these principles. This allows us to produce an extensive pattern catalog which is the foundation of principled approach for designing internal DSLs. The patterns can be used to assess the design quality of a DSL and structure its implementation. In particular, we show a complex DSL example illustrating each principle and the corresponding patterns. While we stick to Ruby for the explanation and application of the patterns, we also name known uses in Python, Scala, and Smalltalk. Patterns are explained with their context, problem, forces, solution, and consequences. We also explain the patterns with the classical structure of intent, motivation, forces, implementation and their consequences. Finally we reflect upon the pattern utilization by discussing their strengths and weaknesses.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：