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

Integrating asynchronous task parallelism and data-centric atomicity 16

Integrating asynchronous task parallelism and data-centric a...

13th International conference on Principles and Practices of programming on the Java Platform: Virtual Machines, languages, and Tools, PPPJ 2016

作者： Kumar, Vivek Dolby, Julian Blackburn, Stephen M. Rice University United States IBM T.J. Watson Research United States Australian National University Australia

ISBN: (纸本)9781450341356

Processor design has turned toward parallelism and heterogeneous cores to achieve performance and energy efficiency. Developers find high-level languages attractive as they use abstraction to offer productivity and portability over these hardware complexities. Over the past few decades, researchers have developed increasingly advanced mechanisms to deliver performance despite the overheads naturally imposed by this abstraction. Recent work has demonstrated that such mechanisms can be exploited to attack overheads that arise in emerging high-level languages, which provide strong abstractions over parallelism. However, current implementation of existing popular high-level languages, such as Java, offer little by way of abstractions that allow the developer to achieve performance in the face of extensive hardware parallelism. In this paper, we present a small set of extensions to the Java programming language that aims to achieve both high performance and high productivity with minimal programmer effort. We incorporate ideas from languages like X10 and AJ to develop five annotations in Java for achieving asynchronous task parallelism and data-centric concurrency control. These annotations allow the use of a highly effcient implementation of a work-stealing scheduler for task parallelism. We evaluate our proposal by refactoring classes from a number of existing multithreaded open source projects to use our new annotations. Our results suggest that these annotations significantly reduce the programming effort while achieving performance improvements up to 30% compared to conventional approaches. © 2016 acm.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Input Responsiveness: Using Canary Inputs to Dynamically Steer Approximation

引用

acm sigplan NOTICES 2016年第6期51卷 161-176页

作者： Laurenzano, Michael A. Hill, Parker Samadi, Mehrzad Mahlke, Scott Mars, Jason Tang, Lingjia Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

This paper introduces Input Responsive Approximation ( IRA), an approach that uses a canary input - a small program input carefully constructed to capture the intrinsic properties of the original input - to automatically control how program approximation is applied on an input-by-input basis. Motivating this approach is the observation that many of the prior techniques focusing on choosing how to approximate arrive at conservative decisions by discounting substantial differences between inputs when applying approximation. The main challenges in overcoming this limitation lie in making the choice of how to approximate both effectively (e.g., the fastest approximation that meets a particular accuracy target) and rapidly for every input. With IRA, each time the approximate program is run, a canary input is constructed and used dynamically to quickly test a spectrum of approximation alternatives. Based on these runtime tests, the approximation that best fits the desired accuracy constraints is selected and applied to the full input to produce an approximate result. We use IRA to select and parameterize mixes of four approximation techniques from the literature for a range of 13 image processing, machine learning, and data mining applications. Our results demonstrate that IRA significantly outperforms prior approaches, delivering an average of 10.2x speedup over exact execution while minimizing accuracy losses in program outputs.

关键词： Performance Runtime Systems Compilers Approximate Computing Performance Experimentation design

来源：评论

学校读者我要写书评

暂无评论

Toward Compositional Verification of Interruptible OS Kernels and Device Drivers

引用

acm sigplan NOTICES 2016年第6期51卷 431-447页

作者： Chen, Hao Wu, Xiongnan (Newman) Shao, Zhong Lockerman, Joshua Gu, Ronghui Univ Elect Sci & Technol China UESTC Chengdu Peoples R China Yale Univ New Haven CT 06520 USA

An operating system (OS) kernel forms the lowest level of any system software stack. The correctness of the OS kernel is the basis for the correctness of the entire system. Recent efforts have demonstrated the feasibility of building formally verified general-purpose kernels, but it is unclear how to extend their work to verify the functional correctness of device drivers, due to the non-local effects of interrupts. In this paper, we present a novel compositional framework for building certified interruptible OS kernels with device drivers. We provide a general device model that can be instantiated with various hardware devices, and a realistic formal model of interrupts, which can be used to reason about interruptible code. We have realized this framework in the Coq proof assistant. To demonstrate the effectiveness of our new approach, we have successfully extended an existing verified non-interruptible kernel with our framework and turned it into an interruptible kernel with verified device drivers. To the best of our knowledge, this is the first verified interruptible operating system with device drivers.

关键词： Verification Reliability Security languages design Program Verification Certified OS Kernels Interrupts Device Drivers Abstraction Layer Modularity

来源：评论

学校读者我要写书评

暂无评论

Profile- Guided Meta-programming 15

Profile- Guided Meta-Programming

引用

36th acm sigplan conference on programming language design and implementation

作者： Bowman, William J. Miller, Swaha St-Amour, Vincent Dybvig, R. Kent Northeastern Univ Boston MA 02115 USA Cisco Syst Inc San Jose CA USA

ISBN: (纸本)9781450334686

Contemporary compiler systems such as GCC,. NET, and LLVM incorporate profile-guided optimizations (PGOs) on low-level intermediate code and basic blocks, with impressive results over purely static heuristics. Recent work shows that profile information is also useful for performing source-to-source optimizations via meta-programming. For example, using profiling information to inform decisions about data structures and algorithms can potentially lead to asymptotic improvements in performance. We present a design for profile-guided meta-programming in a general-purpose meta-programming system. Our design is parametric over the particular profiler and meta-programming system. We implement this design in two different meta-programming systems-the syntactic extensions systems of Chez Scheme and Racket- and provide several profile-guided meta-programs as usability case studies.

关键词： design Performance languages Optimization profiling profile-guided optimization PGO meta-programming

来源：评论

学校读者我要写书评

暂无评论

Example-Directed Synthesis: A Type-Theoretic Interpretation

引用

acm sigplan NOTICES 2016年第1期51卷 802-815页

作者： Frankle, Jonathan Osera, Peter-Michael Walker, David Zdancewic, Steve Princeton Univ Princeton NJ 08544 USA Grinnell Coll Grinnell IA 50112 USA Univ Penn Philadelphia PA 19104 USA

Input-output examples have emerged as a practical and user-friendly specification mechanism for program synthesis in many environments. While example-driven tools have demonstrated tangible impact that has inspired adoption in industry, their underlying semantics are less well-understood: what are "examples" and how do they relate to other kinds of specifications? This paper demonstrates that examples can, in general, be interpreted as refinement types. Seen in this light, program synthesis is the task of finding an inhabitant of such a type. This insight provides an immediate semantic interpretation for examples. Moreover, it enables us to exploit decades of research in type theory as well as its correspondence with intuitionistic logic rather than designing ad hoc theoretical frameworks for synthesis from scratch. We put this observation into practice by formalizing synthesis as proof search in a sequent calculus with intersection and union refinements that we prove to be sound with respect to a conventional type system. In addition, we show how to handle negative examples, which arise from user feedback or counterexample-guided loops. This theory serves as the basis for a prototype implementation that extends our core language to support ML-style algebraic data types and structurally inductive functions. Users can also specify synthesis goals using polymorphic refinements and import monomorphic libraries. The prototype serves as a vehicle for empirically evaluating a number of different strategies for resolving the nondeterminism of the sequent calculus bottom-up theorem-proving, term enumeration with refinement type checking, and combinations of both the results of which classify, explain, and validate the design choices of existing synthesis systems. It also provides a platform for measuring the practical value of a specification language that combines "examples" with the more general expressiveness of refinements.

关键词： languages Theory Functional programming Proof Search Sequent Calculus Program Synthesis Type Theory Refinement Types

来源：评论

学校读者我要写书评

暂无评论

Type-and-Example-Directed Program Synthesis 15

Type-and-Example-Directed Program Synthesis

引用

36th acm sigplan conference on programming language design and implementation

作者： Osera, Peter-Michael Zdancewic, Steve Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781450334686

This paper presents an algorithm for synthesizing recursive functions that process algebraic datatypes. It is founded on proof-theoretic techniques that exploit both type information and input-output examples to prune the search space. The algorithm uses refinement trees, a data structure that succinctly represents constraints on the shape of generated code. We evaluate the algorithm by using a prototype implementation to synthesize more than 40 benchmarks and several non-trivial larger examples. Our results demonstrate that the approach meets or outperforms the state-of-the-art for this domain, in terms of synthesis time or attainable size of the generated programs.

关键词： languages Theory Functional programming Proof Search Program Synthesis Type Theory

来源：评论

学校读者我要写书评

暂无评论

Relaxing Safely: Verified On-the-Fly Garbage Collection for x86-TSO 15

Relaxing Safely: Verified On-the-Fly Garbage Collection for ...

引用

36th acm sigplan conference on programming language design and implementation

作者： Gammie, Peter Hosking, Antony L. Engelhardt, Kai Purdue Univ W Lafayette IN 47907 USA UNSW Sydney NSW Australia

ISBN: (纸本)9781450334686

We report on a machine-checked verification of safety for a state-of-the-art, on-the-fly, concurrent, mark-sweep garbage collector that is designed for multi-core architectures with weak memory consistency. The proof explicitly incorporates the relaxed memory semantics of x86 multiprocessors. To our knowledge, this is the first fully machine-checked proof of safety for such a garbage collector. We couch the proof in a framework that system implementers will find appealing, with the fundamental components of the system specified in a simple and intuitive programming language. The abstract model is detailed enough for its correspondence with an assembly language implementation to be straightforward.

关键词： Algorithms design languages Reliability Verification formal verification machine-checked proof relaxed memory TSO

来源：评论

学校读者我要写书评

暂无评论

Asserting Reliable Convergence for Configuration Management Scripts

引用

acm sigplan NOTICES 2016年第10期51卷 328-343页

作者： Hanappi, Oliver Hummer, Waldemar Dustdar, Schahram Vienna Univ Technol Distributed Syst Grp Vienna Austria

The rise of elastically scaling applications that frequently deploy new machines has led to the adoption of DevOps practices across the cloud engineering stack. So-called configuration management tools utilize scripts that are based on declarative resource descriptions and make the system converge to the desired state. It is crucial for convergent configurations to be able to gracefully handle transient faults, e.g., network outages when downloading and installing software packages. In this paper we introduce a conceptual framework for asserting reliable convergence in configuration management. Based on a formal definition of configuration scripts and their resources, we utilize state transition graphs to test whether a script makes the system converge to the desired state under different conditions. In our generalized model, configuration actions are partially ordered, often resulting in prohibitively many possible execution orders. To reduce this problem space, we define and analyze a property called preservation, and we show that if preservation holds for all pairs of resources, then convergence holds for the entire configuration. Our implementation builds on Puppet, but the approach is equally applicable to other frameworks like Chef, Ansible, etc. We perform a comprehensive evaluation based on real world Puppet scripts and show the effectiveness of the approach. Our tool is able to detect all idempotence and convergence related issues in a set of existing Puppet scripts with known issues as well as some hitherto undiscovered bugs in a large random sample of scripts.

关键词： Configuration Management Idempotence Convergence DevOps Testing System Configuration Scripts Declarative language Puppet

来源：评论

学校读者我要写书评

暂无评论

acm International conference Proceeding Series

ACM International Conference Proceeding Series

引用

8th Workshop on Network Simulator (ns-3), WNS3 2016

ISBN: (纸本)9781450342162

The proceedings contain 18 papers. The topics discussed include: design and implementation of the traffic control module in ns-3;implementation and evaluation of proportional integral controller enhanced (PIE) algorithm in ns-3;an implementation of scalable, Vegas, Veno, and YeAH congestion control algorithms in ns-3;TCP evaluation suite for ns-3;OFSwitch13: enhancing ns-3 with OpenFlow 1.3 support;analysis of programming language overhead in DCE;implementation and validation of an IEEE 802.11ah module for ns-3;implementation and evaluation of a WLAN IEEE 802.11ad model in ns-3;investigation and improvements to the OFDM Wi-Fi physical layer abstraction in ns-3;LL SimpleWireless: a controlled MAC/PHY wireless model to enable network protocol research;a realistic MAC and energy model for 802.15.4;a framework for end-to-end evaluation of 5G mmWave cellular networks in ns-3;ns-3 web-based user interface - power grid communications planning and modeling tool;getting Kodo: network coding for the ns-3 simulator;improving ns-3 emulation performance for fast prototyping of network protocols;ns-3 based framework for simulating communication based train control (CBTC) systems;implementation of 3d obstacle compliant mobility models for UAV networks in ns-3;and topology simulation for aeronautical communication protocols with ns-3 and DCE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Asynchronous programming, analysis and testing with state machines 15

Asynchronous programming, analysis and testing with state ma...

引用

Proceedings of the 36th acm sigplan conference on programming language design and implementation

作者： Deligiannis, Pantazis Donaldson, Alastair F. Ketema, Jeroen Lal, Akash Thomson, Paul Imperial College London United Kingdom Microsoft Research India

ISBN: (纸本)9781450334686

programming efficient asynchronous systems is challenging because it can often be hard to express the design declaratively, or to defend against data races and interleaving-dependent assertion violations. Previous work has only addressed these challenges in isolation, by either designing a new declarative language, a new data race detection tool or a new testing technique. We present P#, a language for high-reliability asynchronous programming co-designed with a static data race analysis and systematic concurrency testing infrastructure. We describe our experience using P# to write several distributed protocols and port an industrial-scale system internal to Microsoft, showing that the combined techniques, by leveraging the design of P#, are effective in finding bugs. © 2015 acm.

关键词： Testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：