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

Persistent Asynchronous Adaptive Specialization for generic Array programming

INTERNATIONAL JOURNAL OF PARALLEL programming 2019年第2期47卷 164-183页

作者： Grelck, Clemens Wiesinger, Heinrich Univ Amsterdam Amsterdam Netherlands

generic array programming systematically abstracts from structural array properties such as shape and rank. As usual, generic programming comes at the price of lower runtime performance. The idea of asynchronous adaptive specialization is to exploit parallel computing facilities to reconcile these conflicting objectives through the continuous adaptation of running applications to the ranks and shapes of their arrays. A key parameter for the effectiveness of our approach is the time it takes from requesting a certain specialization until its availability to the running application. We describe the ins and outs of a persistence layer that keeps specialized variants in a repository for future use and thus effectively reduces the average waiting time for re-compilation to nearly zero. A number of critical issues that, among others, stem from the interplay between function specialization and function overloading catch our special attention. We describe the solutions adopted and illustrate the benefits of persistent asynchronous adaptive specialization by a series of experiments.

关键词： generic programming Array programming Dynamic compilation Multi-core computing Single Assignment C Persistence

来源：评论

学校读者我要写书评

暂无评论

generic Parallel programming for Massive Remote Sensing Data Processing

Generic Parallel Programming for Massive Remote Sensing Data...

引用

IEEE International Conference on Cluster Computing

作者： Ma, Yan Wang, Lizhe Liu, Dingsheng Liu, Peng Wang, Jun Tao, Jie Chinese Acad Sci Ctr Earth Observat & Digital Earth Beijing 100864 Peoples R China Univ Cent Florida Dept Elect Engn & Comp Sci Orlando FL USA Karlsruhe Inst Technol Steinbuch Ctr Comp Karlsruhe Germany

ISBN: (纸本)9781467324229

Remote Sensing (RS) data processing is characterized by massive remote sensing images and increasing amount of algorithms of higher complexity. Parallel programming for data-intensive applications like massive remote sensing image processing on parallel systems is bound to be especially trivial and challenging. We propose a C++ template mechanism enabled generic parallel programming skeleton for these remote sensing applications in high performance clusters. It provides both programming templates for distributed RS data and generic parallel skeletons for RS algorithms. Through one-side communication primitives provided by MPI, the distributed RS data template could provide a global view of the big RS data whose sliced data blocks are scattered among the distributed memory of cluster nodes. Moreover, by data serialization and RMA (Remote Memory Access), the data templates could also offer a simple and effective way to distribute and communicate massive remote sensing data with complex data structures. Furthermore, the generic parallel skeletons implement the recurring patterns of computation, performance optimization and pass the user-defined sequential functions as parameters of templates for type genericity. With the implemented skeletons, Developers without extensive parallel computing technologies can implement efficient parallel remote sensing programs without concerning for parallel computing details. Through experiments on remote sensing applications, we confirmed that our templates were productive and efficient.

关键词： parallel programming generic programming data-intensive computing remote sensing image processing

来源：评论

学校读者我要写书评

暂无评论

Fast Constraint Synthesis for C++ Function Templates

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2025年第OOPSLA1期9卷 225-252页

作者： Ding, Shuo Zhang, Qirun Georgia Inst Technol Atlanta GA 30332 USA

C++ templates are a powerful feature for generic programming and compile-time computations, but C++ compilers often emit overly verbose template error messages. Even short error messages often involve unnecessary and confusing implementation details, which are difficult for developers to read and understand. To address this problem, C++20 introduced constraints and concepts, which impose requirements on template parameters. The new features can define clearer interfaces for templates and can improve compiler diagnostics. However, manually specifying template constraints can still be non-trivial, which becomes even more challenging when working with legacy C++ projects or with frequent code changes. This paper bridges the gap and proposes an automatic approach to synthesizing constraints for C++ function templates. We utilize a lightweight static analysis to analyze the usage patterns within the template body and summarize them into constraints for each type parameter of the template. The analysis is inter-procedural and uses disjunctions of constraints to model function overloading. We have implemented our approach based on the Clang frontend and evaluated it on two C++ libraries chosen separately from two popular library sets: algorithm from the Standard Template Library (STL) and special_functions from the Boost library, both of which extensively use templates. Our tool can process over 110k lines of C++ code in less than 1.5 seconds and synthesize non-trivial constraints for 30%-40% of the function templates. The constraints synthesized for algorithm align well with the standard documentation, and on average, the synthesized constraints can reduce error message lengths by 56.6% for algorithm and 63.8% for special_functions. CCS Concepts: center dot Software and its engineering-Compilers;center dot Theory of computation-Type structures.

关键词： generic programming compile-time computations program analysis

来源：评论

学校读者我要写书评

暂无评论

Automating embedded analysis capabilities and managing software complexity in multiphysics simulation, Part II: Application to partial differential equations

引用

SCIENTIFIC programming 2012年第3期20卷 327-345页

作者： Pawlowski, Roger P. Phipps, Eric T. Salinger, Andrew G. Owen, Steven J. Siefert, Christopher M. Staten, Matthew L. Sandia Natl Labs Dept Numer Anal & Applicat Albuquerque NM 87185 USA

A template-based generic programming approach was presented in Part I of this series of papers [Sci. Program. 20 (2012), 197-219] that separates the development effort of programming a physical model from that of computing additional quantities, such as derivatives, needed for embedded analysis algorithms. In this paper, we describe the implementation details for using the template-based generic programming approach for simulation and analysis of partial differential equations (PDEs). We detail several of the hurdles that we have encountered, and some of the software infrastructure developed to overcome them. We end with a demonstration where we present shape optimization and uncertainty quantification results for a 3D PDE application.

关键词： generic programming templating operator overloading automatic differentiation partial differential equations finite element analysis optimization uncertainty quantification

来源：评论

学校读者我要写书评

暂无评论

Effective strategic programming for Java developers

引用

SOFTWARE-PRACTICE & EXPERIENCE 2014年第2期44卷 129-162页

作者： Balland, Emilie Moreau, Pierre-Etienne Reilles, Antoine INRIA Bordeaux France Univ Lorraine F-54600 Loria Villers Les Nan France Inria F-54600 Villers Les Nancy France Dassault Syst Paris France

In object programming languages, the Visitor design pattern allows separation of algorithms and data structures. When applying this pattern to tree-like structures, programmers are always confronted with the difficulty of making their code evolve. One reason is that the code implementing the algorithm is interwound with the code implementing the traversal inside the visitor. When implementing algorithms such as data analyses or transformations, encoding the traversal directly into the algorithm turns out to be cumbersome as this type of algorithm only focuses on a small part of the data-structure model (e.g., program optimization). Unfortunately, typed programming languages like Java do not offer simple solutions for expressing generic traversals. Rewrite-based languages like ELAN or Stratego have introduced the notion of strategies to express both generic traversal and rule application control in a declarative way. Starting from this approach, our goal was to make the notion of strategic programming available in a widely used language such as Java and thus to offer generic traversals in typed Java structures. In this paper, we present the strategy language SL that provides programming support for strategies in Java. Copyright (c) 2012 John Wiley & Sons, Ltd.

关键词： generic programming term rewriting tree traversal strategies object-oriented programming

来源：评论

学校读者我要写书评

暂无评论

programming errors in traversal programs over structured data

引用

SCIENCE OF COMPUTER programming 2013年第10期78卷 1770-1808页

作者： Laemmel, Ralf Thompson, Simon Kaiser, Markus Univ Koblenz Landau Koblenz Germany Univ Kent Canterbury CT2 7NZ Kent England

Traversal strategies a la Stratego (also a la Strafunski and 'Scrap Your Boilerplate') provide an exceptionally versatile and uniform means of querying and transforming deeply nested and heterogeneously structured data including terms in functional programming and rewriting, objects in OO programming, and XML documents in XML programming. However, the resulting traversal programs are prone to programming errors. We are specifically concerned with errors that go beyond conservative type errors;examples we examine include divergent traversals, prematurely terminated traversals, and traversals with dead code. Based on an inventory of possible programming errors we explore options of static typing and static analysis so that some categories of errors can be avoided. This exploration generates suggestions for improvements to strategy libraries as well as their underlying programming languages. Haskell is used for illustrations and specifications with sufficient explanations to make the presentation comprehensible to the non-specialist. The overall ideas are language-agnostic and they are summarized accordingly. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Traversal strategies Traversal programming Term rewriting Stratego Strafunski generic programming Scrap your boilerplate Type systems Static program analysis Functional programming XSLT Haskell

来源：评论

学校读者我要写书评

暂无评论

programming with C plus plus concepts

引用

SCIENCE OF COMPUTER programming 2010年第7期75卷 596-614页

作者： Jaervi, Jaakko Marcus, Mat Smith, Jacob N. Texas A&M Univ College Stn TX 77843 USA Adobe Syst Inc Seattle WA USA

This paper explores the definition, applications, and limitations of concepts and concept maps in C++, with a focus on library composition. We also compare and contrast concepts to adaptation mechanisms in other languages. Efficient, non-intrusive adaptation mechanisms are essential when adapting data structures to a library's API. Development with reusable components is a widely practiced method of building software. Components vary in form, ranging from source code to non-modifiable binary libraries. The Concepts language features, slated to appear in the next version of C++, have been designed with such compositions in mind, promising an improved ability to create generic, non-intrusive, efficient, and identity-preserving adapters. We report on two cases of data structure adaptation between different libraries, and illustrate best practices and idioms. First, we adapt GUI widgets from several libraries, with differing APIs, for use with a generic layout engine. We further develop this example to describe the run-time concept idiom, extending the applicability of concepts to domains where run-time polymorphism is required. Second, we compose an image processing library and a graph algorithm library, by making use of a transparent adaptation layer, enabling the efficient application of graph algorithms to the image processing domain. We use the adaptation layer to realize a few key algorithms, and report little or no performance degradation. (C) 2009 Elsevier B.V. All rights reserved.

关键词： C plus Concepts Software libraries Component adaptation generic programming Polymorphism

来源：评论

学校读者我要写书评

暂无评论

programming Errors in Traversal Programs Over Structured Data

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2009年第5期238卷 135-153页

作者： Laemmel, Ralf Thompson, Simon Kaiser, Markus Univ Koblenz Landau Mainz Germany Univ Kent Canterbury Kent England

Traversal strategies provide an established means of describing automated queries, analyses, transformations, and other non-trivial computations on deeply structured data (including, most notably, data representations of software artifacts such as programs). The resulting traversal programs are prone to programming errors. We are specifically concerned with errors that go beyond classic type errors, in particular: (i) divergence of traversal, (ii) unintentional extent of traversal into data, (iii) trivial traversal results, (iv) inapplicability of the constituents of a traversal program along traversal. We deliver a taxonomy of programming errors, and start attacking some of them by refinements of traversal programming.

关键词： Traversal strategies Traversal programming Term rewriting Stratego Strafunski generic programming Scrap Your Boilerplate Type systems Static program analysis

来源：评论

学校读者我要写书评

暂无评论

Associated Effects Flexible Abstractions for Effectful programming

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2024年第PLDI期8卷 394-416页

作者： Lutze, Matthew Madsen, Magnus Aarhus Univ Aarhus Denmark

We present associated effects, a programming language feature that enables type classes to abstract over the effects of their function signatures, allowing each type class instance to specify its concrete effects. Associated effects significantly increase the flexibility and expressive power of a programming language that combines a type and effect system with type classes. In particular, associated effects allow us to (i) abstract over total and partial functions, where partial functions may throw exceptions, (ii) abstract over immutable data structures and mutable data structures that have heap effects, and (iii) implement adaptors that combine type classes with algebraic effects. We implement associated effects as an extension of the Flix programming language and refactor the Flix Standard Library to use associated effects, significantly increasing its flexibility and expressive power. Specifically, we add associated effects to 11 type classes, which enables us to add 28 new type class instances.

关键词： effect systems associated effects associated types generic programming type classes type functions ad-hoc polymorphism

来源：评论

学校读者我要写书评

暂无评论

Advanced programming techniques applied to CGAL's arrangement package

引用

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2007年第1-2期38卷 37-63页

作者： Wein, Ron Fogel, Efi Zukerman, Baruch Halperin, Dan Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel

Arrangements of planar curves are fundamental structures in computational geometry. Recently, the arrangement package of CGAL, the Computational Geometry Algorithms Library, has been redesigned and re-implemented exploiting several advanced programming techniques. The resulting software package, which constructs and maintains planar arrangements, is easier to use, to extend, and to adapt to a variety of applications. It is more efficient space- and time-wise, and more robust. ne implementation is complete in the sense that it handles degenerate input, and it produces exact results. In this paper we describe how various programming techniques were used to accomplish specific tasks within the context of computational geometry in general and arrangements in particular. These tasks are exemplified by several applications, whose robust implementation is based on the arrangement package. Together with a set of benchmarks they assured the successful application of the various programming techniques. Crown Copyright (c) 2007 Published by Elsevier B.V. All rights reserved.

关键词： CGAL arrangements generic programming design patients exact computation

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：