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

24th International Symposium on Logic-Based Program Synthesis and transformation (LOPSTR)

作者： Elsawy, Ahmed Zaki, Amira Abdennadher, Slim German Univ Cairo Cairo Egypt Univ Ulm D-89069 Ulm Germany

ISBN: (纸本)9783319178226;9783319178219

Constraint Handling Rules (CHR) is a committed-choice rule-based programming language. Rules rewrite a global multi-set of constraints to another. Overlapping sets of constraints within the rules and the order of constraints within rules and queries entail different derivation paths. In this work, a novel operational strategy is proposed which enables a high-level form of execution control that empowers a comprehensive and customizable execution strategy. It allows full space exploration for any CHR program, thus finding all possible results to a query which is interesting for many non-confluent programs. The proposed transformation is performed as a source-to-source transformation from any CHR program to one utilizing disjunction to force an exhaustive explorative execution strategy. The work is complemented by formal arguments to prove the correctness and completeness of the transformation.

关键词： Constraint Handling Rules Execution flow control Exhaustive execution Search space exploration source-to-source transformation

来源：评论

学校读者我要写书评

暂无评论

Towards the Implementation of a source-to-source transformation Tool for CHR Operational Semantics 1

引用

23rd International Symposium on Logic-based Program Synthesis and transformation (LOPSTR)

作者： Fakhry, Ghada Sharaf, Nada Abdennadher, Slim German Univ Cairo Dept Comp Sci & Engn Cairo Egypt

ISBN: (数字)9783319141251

ISBN: (纸本)9783319141251;9783319141244

Constraint Handling Rules (CHR) is a high-level committed-choice language based on multi-headed and guarded rules. Over the past decades, several extensions to CHR and variants of operational semantics were introduced. In this paper, we present a generic approach to simulate the execution of a set of different CHR operational semantics. The proposed approach uses source-to-source transformation to convert programs written under different CHR operational semantics into equivalent programs in the CHR refined operational semantics without the need to change the compiler or the runtime system.

关键词： source-to-source transformation Constraint Handling Rules Operational Semantics

来源：评论

学校读者我要写书评

暂无评论

PROGRAM IMPROVEMENT BY source-to-source transformation

引用

JOURNAL OF THE ACM 1977年第1期24卷 121-145页

作者： LOVEMAN, DB MASSACHUSETTS COMP ASSOC INC WAKEFIELDMA 01880

The use of source-to-source program transformations has proved valuable in improving program performance. The concept of program manipulation is elucidated by describing its role in both conventional optimization and high level modification of conditional, looping, and procedure structures. An example program fragment written in an Algol-like language is greatly improved by transformations enabled by a user-provided assertion about a data array. A compilation model based on the use of source-to-source program transformations is used to provide a framework for discussing issues of code generation, compilation of high level languages such as APL, and eliminating overhead commonly associated with modular structured programming. Application of the compilation model to several different languages is discussed.

关键词： compilation program improvement program mannpulatlon program optimization program transformation source-to-source transformation

来源：评论

学校读者我要写书评

暂无评论

Program improvement by source to source transformation 76

Program improvement by source to source transformation

引用

Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages

作者： David B. Loveman

ISBN: (纸本)9781450374774

We treat a program as an object of manipulation, determine items of program constancy, and simplify the program based on the constancy. Some motivation for program manipulation is presented, along with two examples of “higher level optimization” written in an Algol-like language. A collection of program transformations and a model of the compilation process in terms of source-to-source transformations are presented. Finally a description of the application of these ideas to an existing programming language is given.

关键词： Program manipulation Optimization Program improvement source-to-source transformation Compilation

来源：评论

学校读者我要写书评

暂无评论

Runtime Verification of Memory Safety via source transformation 18

Runtime Verification of Memory Safety via Source Transformat...

引用

40th ACM/IEEE International Conference on Software Engineering (ICSE)

作者： Chen, Zhe Yan, Junqi Li, Wenming Qian, Ju Huang, Zhiqiu Nanjing Univ Aeronaut & Astronaut Coll Comp Sci & Technol Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781450356633

The unsafe features of C often lead to memory errors that can result in vulnerabilities. Many runtime verification tools are widely used to detect memory errors. However, existing tools lack DO178C compliance, show limited performance, and demonstrate poor accessibility, e.g., lacking platform-independence. In this paper, we propose to implement dynamic analysis tools using source-to-source transformation, which operates on the original source code to insert code fragments written in ANSI C, and generates source files similar to the original files in structure. We show that source transformation can effectively avoid the mentioned drawbacks of existing tools, but it also faces many new challenges in implementation.

关键词： runtime verification dynamic analysis memory safety C programs source-to-source transformation

来源：评论

学校读者我要写书评

暂无评论

source-to-source transformations for Parallel Optimizations in STAPL

Source-to-Source Transformations for Parallel Optimizations ...

引用

作者： Kelley, Brian M Texas A&M University

Programs that use the STAPL C++ parallel programming library express their control and data flow explicitly through the use of skeletons. Skeletons can be simple parallel operations like map and reduce, or the result of composing several skeletons. Composition is implemented by tracking the dependencies among individual data elements in the STAPL runtime system. However, the operations and dependencies within a compose skeleton can be determined at compile time from the C++ abstract syntax tree. This enables the use of source-to-source transformations to fuse the composed skeletons. transformations can also be used to replace skeletons entirely with equivalent code. Both transformations greatly reduce STAPL runtime overhead, and zip fusion also allows a compiler to optimize the work functions as a single unit. We present a Clang compiler plugin and wrapper that automatically perform these transformations, and demonstrate its ability to improve performance.

关键词： source-to-source transformation algorithmic skeletons Thesis

来源：评论

学校读者我要写书评

暂无评论

Understanding source-to-source transformations for Frequent Porting of Applications on Changing Cloud Architectures 3

Understanding Source-to-Source Transformations for Frequent ...

引用

International Conference Parallel Distributed Grid Computing

作者： Khan, Mohsin Priyanka, N. Ahmed, Waseem Radhika, N. Pavithra, M. Parimala, K. HKBK Coll Engn Dept Comp Sci & Engn Bangalore Karnataka India

ISBN: (纸本)9781479976836

Writing code for heterogeneous architectures with processors and accelerators from multiple vendors from scratch or translating existing serial code, a lot of effort and investment will be required from the application developer. This problem will become more prominent when HPC applications are moved into the Cloud as Cloud providers frequently update their architectures to keep with market trends. In these scenarios, automatic parallelization tools will definitely have an important role to play. An important constituent of these tools would be the ability to perform pertinent domain decomposition of the serial code to maximize utilization of the available computational elements. One of the first steps in this direction is to understand the role of the number and type of computational element in a heterogeneous architecture to the overall performance of an application. This paper presents observations made on architectures with different types and number of computational elements using two case studies on five different architectures with different types and number of computational elements. Results show that the perceived speedup and actual speedup are not related.

关键词： Heterogeneous Architectures source-to-source transformation Parallel Computing GPGPU CUDA

来源：评论

学校读者我要写书评

暂无评论

SkePU 2: Flexible and Type-Safe Skeleton Programming for Heterogeneous Parallel Systems

引用

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2018年第1期46卷 62-80页

作者： Ernstsson, August Li, Lu Kessler, Christoph Linkoping Univ Dept Comp & Informat Sci PELAB Linkoping Sweden

In this article we present SkePU 2, the next generation of the SkePU C++ skeleton programming framework for heterogeneous parallel systems. We critically examine the design and limitations of the SkePU 1 programming interface. We present a new, flexible and type-safe, interface for skeleton programming in SkePU 2, and a source-to-source transformation tool which knows about SkePU 2 constructs such as skeletons and user functions. We demonstrate how the source-to-source compiler transforms programs to enable efficient execution on parallel heterogeneous systems. We show how SkePU 2 enables new use-cases and applications by increasing the flexibility from SkePU 1, and how programming errors can be caught earlier and easier thanks to improved type safety. We propose a new skeleton, Call, unique in the sense that it does not impose any predefined skeleton structure and can encapsulate arbitrary user-defined multi-backend computations. We also discuss how the source-to-source compiler can enable a new optimization opportunity by selecting among multiple user function specializations when building a parallel program. Finally, we show that the performance of our prototype SkePU 2 implementation closely matches that of SkePU 1.

关键词： Skeleton programming SkePU source-to-source transformation C++11 Heterogeneous parallel systems Portability

来源：评论

学校读者我要写书评

暂无评论

High-level specifications for automatically generating parallel code

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2013年第7期25卷 989-1012页

作者： Acosta, Alejandro Almeida, Francisco Pelaez, Ignacio Univ La Laguna Dept Stat & Comp Sci E-38207 San Cristobal la Laguna Spain

The arrival of multicore systems, along with the speed-up potential available in graphics processing units, has given us unprecedented low-cost computing power. These systems address some of the known architecture problems but at the expense of considerably increased programming complexity. Heterogeneity, at both the architectural and programming levels, poses a great challenge to programmers. Many proposals have been put forth to facilitate the job of programmers. Leaving aside proposals based on the development of new programming languages because of the effort this represents for the user (effort to learn and reuse code), the remaining proposals are based on transforming sequential code into parallel code, or on transforming parallel code designed for one architecture into parallel code designed foranother. A different approach relies on the use of skeletons. The programmer has available set of parallel standards that comprise the basis for developing parallel code while programming sequential code. In this context, we propose a methodology for developing an automatic source-to-source transformation in a specific domain. This methodology is instantiated in a framework aimed at solving dynamic programming problems. Using this framework, the final user (a physician, mathematician, biologist, etc.) can express her problem using an equation in Latex, and the system will automatically generate the optimal parallel code for homogeneous or heterogeneous architectures. This approach allows for great portability toward these new emerging architectures and for great productivity, as evidenced by the computational *** (c) 2012 John Wiley & Sons, Ltd.

关键词： source-to-source transformation skeletal programming dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Combining Data and Computation Distribution Directives for Hybrid Parallel Programming : A transformation System

引用

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2016年第6期44卷 1268-1295页

作者： Habel, Rachid Silber-Chaussumier, Frederique Irigoin, Franois Brunet, Elisabeth Trahay, Francois TELECOM SudParis 9 Rue Charles Fourier F-91011 Evry France MINES ParisTech 35 Rue St Honor F-77305 Fontainebleau France

This paper describes dSTEP, a directive-based programming model for hybrid shared and distributed memory machines. The originality of our work is the definition and an implementation of a unified high-level programming model addressing both data and computation distributions, providing a particularly fine control of the computation. The goal is to improve the programmer productivity while providing good performances in terms of execution time and memory usage. We define a generic compilation scheme for computation mapping and communication generation. We implement the solution in a source-to-source compiler together with a runtime library. We provide a series of optimizations to improve the performance of the generated code, with a special focus on reducing the communications time. We evaluate our solution on several scientific kernels as well as on the more challenging NAS BT benchmark, and compare our results with the hand written Fortran MPI and UPC implementations. The results show first that our solution allows to make explicit the non trivial parallel execution of the NAS BT benchmark using the dSTEP directives. Second, the results show that our generated MPI+OpenMP BT program runs with a 83.35 speedup over the original NAS OpenMP C benchmark on a hybrid cluster composed of 64 quadricores (256 cores). Overall, our solution dramatically reduces the programming effort while providing good time execution and memory usage performances. This programming model is suitable for a large variety of machines as multi-core and accelerator clusters.

关键词： Distributed-memory Shared-memory source-to-source transformation OpenMP MPI Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：