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

Generating Safe Boundary APIs between Typed EDSLs and Their Environments 2015

Generating Safe Boundary APIs between Typed EDSLs and Their ...

14th acm sigplan International conference on Generative-programming - Concepts and Experiences (GPCE) co-located with SPLASH conference

作者： Reynders, Bob Devriese, Dominique Piessens, Frank Katholieke Univ Leuven iMinds Distrinet Leuven Belgium

ISBN: (纸本)9781450336871

Embedded domain specific languages (EDSLs) are used to represent special-purpose code in a general-purpose language and they are used for applications like vector calculations and run-time code generation. Often, code in an EDSL is compiled to a target (e.g. GPU languages, JVM bytecode, assembly, JavaScript) and needs to interface with other code that is available at that level but uses other data representations or calling conventions. We present an approach for safely making available such APIs in a typed EDSL, guaranteeing correct conversions between data representations and the respect for calling conventions. When the code being interfaced with is the result of static compilation of host language code, we propose a way to auto-generate the needed boilerplate using meta-programming. We instantiate our technique with JavaScript as the target language, JS-Scala as the EDSL, *** as the static compiler and Scala macros to generate the boilerplate, but our design is more generally applicable. We provide evidence of usefulness of our approach through a prototype implementation that we have applied in a non-trivial code base.

关键词： embedded domain specific languages Scala meta-programming

来源：评论

学校读者我要写书评

暂无评论

EXPLORER : Query- and Demand-Driven Exploration of Interprocedural Control Flow Properties 2015

EXPLORER : Query- and Demand-Driven Exploration of Interproc...

引用

acm sigplan International conference on Object-Oriented programming, Systems, languages, and Applications (OOPSLA)

作者： Feng, Yu Wang, Xinyu Dillig, Isil Lin, Calvin Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781450336895

This paper describes a general framework-and its implementation in a tool called EXPLORER-for statically answering a class of interprocedural control flow queries about Java programs. EXPLORER allows users to formulate queries about feasible callstack configurations using regular expressions, and it employs a precise, demand-driven algorithm for answering such queries. Specifically, EXPLORER constructs an automaton A that is iteratively refined until either the language accepted by A is empty (meaning that the query has been refuted) or until no further refinement is possible based on a precise, context-sensitive abstraction of the program. We evaluate EXPLORER by applying it to three different program analysis tasks, namely, (1) analysis of the observer design pattern in Java, (2) identification of a class of performance bugs, and (3) analysis of inter-component communication in Android applications. Our evaluation shows that EXPLORER is both efficient and precise.

关键词： Algorithms languages Program analysis Demand-driven analysis points-to analysis query language control flow properties

来源：评论

学校读者我要写书评

暂无评论

LaminarIR: Compile-Time Queues for Structured Streams 15

LaminarIR: Compile-Time Queues for Structured Streams

引用

36th acm sigplan conference on programming language design and implementation

作者： Ko, Yousun Burgstaller, Bernd Scholz, Bernhard Yonsei Univ Seoul 120749 South Korea Univ Sydney Sydney NSW 2006 Australia

ISBN: (纸本)9781450334686

Stream programming languages employ FIFO (first-in, first-out) semantics to model data channels between producers and consumers. A FIFO data channel stores tokens in a buffer that is accessed indirectly via read-and write-pointers. This indirect token-access decouples a producer's write-operations from the read-operations of the consumer, thereby making dataflow implicit. For a compiler, indirect token-access obscures data-dependencies, which renders standard optimizations ineffective and impacts stream program performance negatively. In this paper we propose a transformation for structured stream programming languages such as StreamIt that shifts FIFO buffer management from run-time to compile-time and eliminates splitters and joiners, whose task is to distribute and merge streams. To show the effectiveness of our lowering transformation, we have implemented a StreamIt to C compilation framework. We have developed our own intermediate representation (IR) called LaminarIR, which facilitates the transformation. We report on the enabling effect of the LaminarIR on LLVM's optimizations, which required the conversion of several standard StreamIt benchmarks from static to randomized input, to prevent computation of partial results at compile-time. We conducted our experimental evaluation on the Intel i7-2600K, AMD Opteron 6378, Intel Xeon Phi 3120A and ARM Cortex-A15 platforms. Our LaminarIR reduces data-communication on average by 35.9% and achieves platform-specific speedups between 3.73x and 4.98x over StreamIt. We reduce memory accesses by more than 60% and achieve energy savings of up to 93.6% on the Intel i7-2600K.

关键词： languages Algorithms Performance stream programming synchronous data flow program transformation performance analysis compiler optimization

来源：评论

学校读者我要写书评

暂无评论

POP-PL: A Patient-Oriented Prescription programming language 2015

POP-PL: A Patient-Oriented Prescription Programming Language

引用

14th acm sigplan International conference on Generative-programming - Concepts and Experiences (GPCE) co-located with SPLASH conference

作者： Florence, Spencer P. Fetscher, Bruke Flatt, Matthew Temps, William H. Kiguradze, Tina West, Dennis P. Niznik, Charlotte Yarnold, Paul R. Findler, Robert Bruce Belknap, Steven M. Northwestern Univ Dept Elect Engn & Comp Sci Evanston IL 60208 USA Univ Utah Sch Comp Salt Lake City UT USA Northwestern Univ Dept Dermatol Feinberg Sch Med Chicago IL USA Optimal Data Anal LLC San Diego CA USA Northwestern Univ Dept Med Div Gen Internal Med & Geriatr Feinberg Sch Med Chicago IL USA

ISBN: (纸本)9781450336871

Medical professionals have long used algorithmic thinking to describe and implement health care processes without the benefit of the conceptual framework provided by a programming language. Instead, medical algorithms are expressed using English, flowcharts, or data tables. This results in prescriptions that are difficult to understand, hard to debug, and awkward to reuse. This paper reports on the design and evaluation of a domain-specific programming language, POP-PL, for expressing medical algorithms. The design draws on the experience of researchers in two disciplines, programming languages and medicine. The language is based around the idea that programs and humans have complementary strengths, that when combined can make for safer, more accurate performance of prescriptions. We implemented a prototype of our language and evaluated its design by writing prescriptions in the new language and administering a usability survey to medical professionals. This formative evaluation suggests that medical prescriptions can be conveyed by a programming language's mode of expression and provides useful information for refining the language. Analysis of the survey results suggests that medical professionals can understand and correctly modify programs in POP-PL.

关键词： DSL design Medical programming languages Medical Prescriptions Empirical Evaluation

来源：评论

学校读者我要写书评

暂无评论

Hybrid STM/HTM for Nested Transactions on OpenJDK

引用

acm sigplan NOTICES 2016年第10期51卷 660-676页

作者： Chapman, Keith Hosking, Antony L. Moss, J. Eliot B. Purdue Univ W Lafayette IN 47907 USA Australian Natl Univ Data61 Canberra ACT Australia Univ Massachusetts Amherst MA USA

Transactional memory (TM) has long been advocated as a promising pathway to more automated concurrency control for scaling concurrent programs running on parallel hardware. Software TM (STM) has the benefit of being able to run general transactional programs, but at the significant cost of overheads imposed to log memory accesses, mediate access conflicts, and maintain other transaction metadata. Recently, hardware manufacturers have begun to offer commodity hardware TM (HTM) support in their processors wherein the transaction metadata is maintained "for free" in hardware. However, HTM approaches are only best-effort: they cannot successfully run all transactional programs, whether because of hardware capacity issues (causing large transactions to fail), or compatibility restrictions on the processor instructions permitted within hardware transactions (causing transactions that execute those instructions to fail). In such cases, programs must include failure-handling code to attempt the computation by some other software means, since retrying the transaction would be futile. Thus, a canonical use of HTM is lock elision: replacing lock regions with transactions, retrying some number of times in the case of conflicts, but falling back to locking when HTM fails for other reasons. Here, we describe how software and hardware schemes can combine seamlessly into a hybrid system in support of transactional programs, allowing use of low-cost HTM when it works, but reverting to STM when it doesn't. We describe heuristics used to make this choice dynamically and automatically, but allowing the transition back to HTM opportunistically. Our implementation is for an extension of Java having syntax for both open and closed nested transactions, and boosting, running on the OpenJDK, with dynamic injection of STM mechanisms (into code variants used under STM) and HTM instructions (into code variants used under HTM). Both schemes are compatible to allow different threads to run concur

关键词： transactional memory nested transactions hardware transactional memory software transactional memory Java design Experimentation languages Measurement Performance

来源：评论

学校读者我要写书评

暂无评论

Functional Pearl: A SQL to C Compiler in 500 Lines of Code 2015

Functional Pearl: A SQL to C Compiler in 500 Lines of Code

引用

20th acm sigplan International conference on Functional programming (ICFP)

作者： Rompf, Tiark Amin, Nada Ecole Polytech Fed Lausanne Lausanne Switzerland

ISBN: (纸本)9781450336697

We present the design and implementation of a SQL query processor that outperforms existing database systems and is written in just about 500 lines of Scala code - a convincing case study that high-level functional programming can handily beat C for systems-level programming where the last drop of performance matters. The key enabler is a shift in perspective towards generative programming. The core of the query engine is an interpreter for relational algebra operations, written in Scala. Using the open-source LMS Framework (Lightweight Modular Staging), we turn this interpreter into a query compiler with very low effort. To do so, we capitalize on an old and widely known result from partial evaluation known as Futamura projections, which state that a program that can specialize an interpreter to any given input program is equivalent to a compiler. In this pearl, we discuss LMS programming patterns such as mixed-stage data structures (e.g. data records with static schema and dynamic field components) and techniques to generate low-level C code, including specialized data structures and data loading primitives.

关键词： SQL Query Compilation Staging Generative programming Futamura Projections

来源：评论

学校读者我要写书评

暂无评论

Contract-Based General-Purpose GPU programming 2015

Contract-Based General-Purpose GPU Programming

引用

14th acm sigplan International conference on Generative-programming - Concepts and Experiences (GPCE) co-located with SPLASH conference

作者： Kolesnichenko, Alexey Poskitt, Christopher M. Nanz, Sebastian Meyer, Bertrand ETH Ziirich Dept Comp Sci Zurich Switzerland Politecn Milan Milan Italy Innopolis Univ Kazan Russia

ISBN: (纸本)9781450336871

Using GPUs as general-purpose processors has revolutionized parallel computing by offering, for a large and growing set of algorithms, massive data-parallelization on desktop machines. An obstacle to widespread adoption, however, is the difficulty of programming them and the low-level control of the hardware required to achieve good performance. This paper suggests a programming library, SafeGPU, that aims at striking a balance between programmer productivity and performance, by making GPU data-parallel operations accessible from within a classical object-oriented programming language. The solution is integrated with the design-by-contract approach, which increases confidence in functional program correctness by embedding executable program specifications into the program text. We show that our library leads to modular and maintainable code that is accessible to GPGPU non-experts, while providing performance that is comparable with hand-written CUDA code. Furthermore, runtime contract checking turns out to be feasible, as the contracts can be executed on the GPU.

关键词： GPGPU parallel computing runtime code generation programming object-orientation design-by-contract program correctness

来源：评论

学校读者我要写书评

暂无评论

Remote-Scope Promotion: Clarified, Rectified, and Verified 2015

Remote-Scope Promotion: Clarified, Rectified, and Verified

引用

acm sigplan International conference on Object-Oriented programming, Systems, languages, and Applications (OOPSLA)

作者： Wickerson, John Batty, Mark Beckmann, Bradford M. Donaldson, Alastair F. Univ London Imperial Coll Sci Technol & Med London SW7 2AZ England Univ Kent Canterbury CT2 7NZ Kent England Adv Micro Devices Inc Sunnyvale CA 94088 USA

ISBN: (纸本)9781450336895

Modern accelerator programming frameworks, such as OpenCL (TM), organise threads into work-groups. Remote-scope promotion (RSP) is a language extension recently proposed by AMD researchers that is designed to enable applications, for the first time, both to optimise for the common case of intra-work-group communication (using memory scopes to provide consistency only within a work-group) and to allow occasional inter-work-group communication (as required, for instance, to support the popular load-balancing idiom of work stealing). We present the first formal, axiomatic memory model of OpenCL extended with RSP. We have extended the HERD memory model simulator with support for OpenCL kernels that exploit RSP, and used it to discover bugs in several litmus tests and a work-stealing queue, that have been used previously in the study of RSP. We have also formalised the proposed GPU implementation of RSP. The formalisation process allowed us to identify bugs in the description of RSP that could result in well-synchronised programs experiencing memory inconsistencies. We present and prove sound a new implementation of RSP that incorporates bug fixes and requires less non-standard hardware than the original implementation. This work, a collaboration between academia and industry, clearly demonstrates how, when designing hardware support for a new concurrent language feature, the early application of formal tools and techniques can help to prevent errors, such as those we have found, from making it into silicon.

关键词： Formal methods graphics processing unit (GPU) Isabelle OpenCL programming language implementation weak memory models work stealing

来源：评论

学校读者我要写书评

暂无评论

Ziria: A DSL for wireless systems programming 15

Ziria: A DSL for wireless systems programming

引用

Proceedings of the Twentieth International conference on Architectural Support for programming languages and Operating Systems

作者： Stewart, Gordon Gowda, Mahanth Mainland, Geoffrey Radunović, Božidar Vytiniotis, Dimitrios Agulló, Cristina Luengo Princeton University United States UIUC United States Drexel University United States MSR Cambridge United States Universitat Politècnica de Catalunya Spain

ISBN: (纸本)9781450328357

Software-defined radio (SDR) brings the flexibility of software to wireless protocol design, promising an ideal platform for innovation and rapid protocol deployment. However, implementing modern wireless protocols on existing SDR platforms often requires careful hand-tuning of low-level code, which can undermine the advantages of software. Ziria is a new domain-specific language (DSL) that offers programming abstractions suitable for wireless physical (PHY) layer tasks while emphasizing the pipeline reconfiguration aspects of PHY programming. The Ziria compiler implements a rich set of specialized optimizations, such as lookup table generation and pipeline fusion. We also offer a novel-due to pipeline reconfiguration-algorithm to optimize the data widths of computations in Ziria pipelines. We demonstrate the programming flexibility of Ziria and the performance of the generated code through a detailed evaluation of a line-rate Ziria WiFi 802.11a/g implementation that is on par and in many cases outperforms a hand-tuned state-of-the-art C++ implementation on commodity CPUs. Copyright © 2015 acm.

关键词： Table lookup

来源：评论

学校读者我要写书评

暂无评论

PolyMage: Automatic Optimization for Image Processing Pipelines 15

PolyMage: Automatic Optimization for Image Processing Pipeli...

引用

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

作者： Mullapudi, Ravi Teja Vasista, Vinay Bondhugula, Uday Indian Inst Sci Dept Comp Sci & Automat Bangalore 560012 Karnataka India

ISBN: (纸本)9781450328357

This paper presents the design and implementation of PolyMage, a domain-specific language and compiler for image processing pipelines. An image processing pipeline can be viewed as a graph of interconnected stages which process images successively. Each stage typically performs one of point-wise, stencil, reduction or data-dependent operations on image pixels. Individual stages in a pipeline typically exhibit abundant data parallelism that can be exploited with relative ease. However, the stages also require high memory bandwidth preventing effective utilization of parallelism available on modern architectures. For applications that demand high performance, the traditional options are to use optimized libraries like OpenCV or to optimize manually. While using libraries precludes optimization across library routines, manual optimization accounting for both parallelism and locality is very tedious. The focus of our system, PolyMage, is on automatically generating high-performance implementations of image processing pipelines expressed in a high-level declarative language. Our optimization approach primarily relies on the transformation and code generation capabilities of the polyhedral compiler framework. To the best of our knowledge, this is the first model-driven compiler for image processing pipelines that performs complex fusion, tiling, and storage optimization automatically. Experimental results on a modern multicore system show that the performance achieved by our automatic approach is up to 1.81x better than that achieved through manual tuning in Halide, a state-of-the-art language and compiler for image processing pipelines. For a camera raw image processing pipeline, our performance is comparable to that of a hand-tuned implementation.

关键词： Domain-specific language image processing polyhedral optimization locality parallelism tiling multicores vectorization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：