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

Exploration of Spatial Pipeline Computation for Heuristic Access Coarse-Grained Reconfigurable Cells

International Conference on Mechanical Engineering and Technology (ICMET 2011)

作者： Liu, Xinning Ge, Wei Du, Yue Southeast Univ Natl ASIC Syst Engn Res Ctr Nanjing 210096 Jiangsu Peoples R China

ISBN: (纸本)9783642273285;9783642273292

Spatial pipelined approach can be an effective technique for efficient improvement of coarse-grained reconfigurable cells. Take advantage of the characteristics, data-driven and "shadow variable", of Dynamic Giant Reconfigurable Cells (DGRC). This paper shows the exploration of spatial computation approach. Experimental results show that the proposed spatial pipeline approach can achieve the highest 5x times improvement in performance and reduce the configuration resources.

关键词： spatial pipeline computation heuristic access coarse-grained reconfigurable program optimization

来源：评论

学校读者我要写书评

暂无评论

Autobahn 2.0: Minimizing Bangs while Maintaining Performance (System Demonstration) 11

Autobahn 2.0: Minimizing Bangs while Maintaining Performance...

引用

Haskell Conference

作者： Sun, Marilyn Fisher, Kathleen Tufts Univ Medford MA 02155 USA

ISBN: (纸本)9781450358354

Lazy evaluation has many advantages, but it can cause bad performance. Consequently, Haskell allows users to force eager evaluation at certain program points by inserting strictness annotations, known and written as bangs (!). Unfortunately, manual bang placement is difficult. Autobahn 1.0 uses a genetic algorithm to infer bang annotations that improve performance. However, Autobahn 1.0 often generates large numbers of superfluous bangs, which is problematic because users must inspect each such bang to determine whether it is safe. We introduce Autobahn 2.0, which uses GHC profiling information to reduce the number of superfluous bangs. When evaluated on the NoFib benchmark suite, Autobahn 2.0 reduced the number of inferred bangs by 90.2% on average, while only degrading program performance by 15.7% compared with the performance produced by Autobahn 1.0. In a case study on a garbage collection simulator, Autobahn 2.0 eliminated 81.8% of the recommended bangs, with the same 15.7% optimization degradation.

关键词： program optimization Lazy Evaluation Bang Patterns Genetic Algorithms

来源：评论

学校读者我要写书评

暂无评论

Code motion and code placement:: Just synonyms? 7th

Code motion and code placement:: Just synonyms?

引用

7th European Symposium on programming (ESOP'98) at the Joint European Conferences on Theory and Practice of Software (ETAPS'98)

作者： Knoop, J Rüthing, O Steffen, B Univ Passau D-94030 Passau Germany Univ Dortmund D-44221 Dortmund Germany

ISBN: (纸本)3540643028

We prow that there is no difference between code motion (CM) and code placement (CP) in the traditional syntactic setting, however, a dramatic difference in the semantic setting. We demonstrate this by re-investigating semantic CM under the perspective of the recent development of syntactic CM. Besides clarifying and highlighting the analogies and essential differences between the syntactic and the semantic approach, this leads as a side-effect to a drastical reduction of the conceptual complexity of the value-flow based procedure for semantic CM of [20], as the original bidirectional analysis is decomposed into purely unidirectional components. On the theoretical side, this establishes a natural semantical understanding in terms of the Herbrand interpretation (transparent equivalence), and thus eases the proof of correctness;moreover, it shows the frontier of semantic CM, and gives reason for the lack of algorithms going beyond. On the practical side, it simplifies the implementation and increases the efficiency, which, hire for its syntactic counterpart, can be the catalyst for its migration from academia into industrial practice.

关键词： program optimization data-flow analysis code motion code placement partial redundancy elimination transparent equivalence Herbrand interpretation

来源：评论

学校读者我要写书评

暂无评论

optimization of very high level languages-II. Deducing relationships of inclusion and membership

引用

Computer Languages 1975年第3期1卷 197-218页

作者： Schwartz, J.T Computer Science Department Courant Institute of Mathematical Sciences NY United States

SETL is a set-theoretically oriented language of very high level whose reportoire of semantic objects includes finite sets, ordered n-tuples, and sets of ordered n-tuples useable as mappings. This two-part paper studies the optimization problems associated with such a language. The first issue studied is that of copy optimization, i.e. the discovery of cases in which changes to a compound data object can be made "differentially" without recopying the whole of the object. The second part of the paper sets forth techniques for the automatic discovery of relationships of inclusion and membership on which automatic data-structure choice may be based. The methods used extend known techniques of data-flow analysis and of logical program analysis. © 1975.

关键词： Automatic programming Data Structure Choice High Level Languages program optimization Set-Theoretic Languages

来源：评论

学校读者我要写书评

暂无评论

Automatic Array Transformation to Columnar Storage at Run Time 19

Automatic Array Transformation to Columnar Storage at Run Ti...

引用

19th International Conference on Managed programming Languages and Runtimes (MPLR)

作者： Makor, Lukas Kloibhofer, Sebastian Leopoldseder, David Bonetta, Daniele Stadler, Lukas Mossenbock, Hanspeter Johannes Kepler Univ Linz Linz Austria Oracle Labs Linz Austria Oracle Labs Amsterdam Netherlands

ISBN: (纸本)9781450396967

Today's huge memories make it possible to store and process large data structures in memory instead of in a database. Hence, accesses to this data should be optimized, which is normally relegated either to the runtimes and compilers or is left to the developers, who often lack the knowledge about optimization strategies. As arrays are often part of the language, developers frequently use them as an underlying storage mechanism. Thus, optimization of arrays may be vital to improve performance of data-intensive applications. While compilers can apply numerous optimizations to speed up accesses, it would also be beneficial to adapt the actual layout of the data in memory to improve cache utilization. However, runtimes and compilers typically do not perform such memory layout optimizations. In this work, we present an approach to dynamically perform memory layout optimizations on arrays of objects to transform them into a columnar memory layout, a storage layout frequently used in analytical applications that enables faster processing of read-intensive workloads. By integration into a state-of-the-art JavaScript runtime, our approach can speed up queries for large workloads by up to 9x, where the initial transformation overhead is amortized over time.

关键词： Columnar Storage Array Storage program optimization Dynamic Language Dynamic Compilation

来源：评论

学校读者我要写书评

暂无评论

Optimizing Parallel Java Streams 26

Optimizing Parallel Java Streams

引用

26th International Conference on Engineering of Complex Computer Systems (ICECCS)

作者： Basso, Matteo Schiavio, Filippo Rosa, Andrea Binder, Walter Univ Svizzera Italiana USI Fac Informat Lugano Switzerland

ISBN: (纸本)9781665401623

The Java Stream API increases developer productivity and greatly simplifies exploiting parallel computation by providing a high-level abstraction on top of complex data processing, parallelization, and synchronization algorithms. However, the usage of the Java Stream API often incurs significant runtime overhead. Method inlining and the automated translation of code using the Java Stream API into imperative code using loops can reduce such overhead;however, existing approaches and tools are applicable only to sequential stream pipelines, leaving the optimization of parallel streams an open issue. We bridge this gap by presenting a novel method to exploit high-level static analysis to characterize stream pipelines, detect parallel streams, and apply transformations removing the abstraction overhead. We evaluate our method on a set of benchmarks, showing that our approach significantly reduces execution time and memory allocation.

关键词： Java Parallel Streams Functional programming program optimization Bytecode Transformation

来源：评论

学校读者我要写书评

暂无评论

Precimonious: Tuning Assistant for Floating-Point Precision 13

Precimonious: Tuning Assistant for Floating-Point Precision

引用

International Conference for High Performance Computing, Networking, Storage and Analysis (SC)

作者： Rubio-Gonzalez, Cindy Cuong Nguyen Hong Diep Nguyen Demmel, James Kahan, William Sen, Koushik Bailey, David H. Iancu, Costin Hough, David Univ Calif Berkeley Dept EECS Berkeley CA 94720 USA Lawrence Berkeley Natl Lab Berkeley CA USA Oracle Corp Redwood City CA USA

ISBN: (纸本)9781450323789

Given the variety of numerical errors that can occur, floating-point programs are difficult to write, test and debug. One common practice employed by developers without an advanced background in numerical analysis is using the highest available precision. While more robust, this can degrade program performance significantly. In this paper we present PRECIMONIOUS, a dynamic program analysis tool to assist developers in tuning the precision of floating-point programs. PRECIMONIOUS performs a search on the types of the floating-point program variables trying to lower their precision subject to accuracy constraints and performance goals. Our tool recommends a type instantiation that uses lower precision while producing an accurate enough answer without causing exceptions. We evaluate PRECIMONIOUS on several widely used functions from the GNU Scientific Library, two NAS Parallel Benchmarks, and three other numerical programs. For most of the programs analyzed, PRECIMONIOUS reduces precision, which results in performance improvements as high as 41%.

关键词： floating-point arithmetic mixed precision program optimization delta-debugging algorithm dynamic program analysis

来源：评论

学校读者我要写书评

暂无评论

Impact of Parallel Code optimization on Computer Power Consumption

引用

LOBACHEVSKII JOURNAL OF MATHEMATICS 2023年第12期44卷 5306-5319页

作者： Kiselev, E. A. Telegin, P. N. Baranov, A. V. Russian Acad Sci Joint Supercomp Ctr Sci Res Inst Syst Anal Moscow 119334 Russia

The increase in performance and power of computing systems requires the wider use of program optimizations. The goal of performing optimizations is not only to reduce program runtime, but also to reduce other computer resources including power consumption. The goal of the study was to evaluate the impact of different optimization levels and various optimization strategies on power consumption. In a series of experiments, it was established that the average power consumption tends to peak for the programs with optimized source code. The articles also describes the impact of changing computer architecture on power consumption graphs. The relationships between the average and median values of power consumption by example programs are considered. The possibility of creating program energy consumption profile for a parallel program is shown.

关键词： supercomputer energy efficiency power consumption profile parallel program high performance computing system HPC program optimization

来源：评论

学校读者我要写书评

暂无评论

Automatically Transforming Arrays to Columnar Storage at Run Time 19

Automatically Transforming Arrays to Columnar Storage at Run...

引用

19th International Conference on Managed programming Languages and Runtimes (MPLR)

作者： Kloibhofer, Sebastian Makor, Lukas Leopoldseder, David Bonetta, Daniele Stadler, Lukas Mossenbock, Hanspeter Johannes Kepler Univ Linz Linz Austria Oracle Labs Linz Austria Oracle Labs Apeldoorn Netherlands

ISBN: (纸本)9781450396967

Picking the right data structure for the right job is one of the key challenges for every developer. However, especially in the realm of object-oriented programming, the memory layout of data structures is often still suboptimal for certain data access patterns, due to objects being scattered across the heap. Therefore, this work presents an approach for the automated transformation of arrays of objects into a contiguous format (called columnar arrays). At run time, we identify suitable arrays, perform the transformation and use a dynamic compiler to gain performance improvements. In the evaluation, we show that our approach can improve the performance of certain queries over large, uniform arrays.

关键词： Columnar Storage Array Storage program optimization Dynamic Language Dynamic Compilation

来源：评论

学校读者我要写书评

暂无评论

Uniform equivalence of logic programs under the stable model semantics

引用

19th International Conference on Logic programming

作者： Eiter, T Fink, M Vienna Univ Technol Inst Informat Syst Abt Wissensbasierte Syst A-1040 Vienna Austria

ISBN: (纸本)3540206426

In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P boolean OR R and Q boolean OR R have the same stable models for any other program R. This property strengthens equivalence of P and Q with respect to stable models (which is the particular case for R = 0), and has an application in program optimization. In this paper, we consider the more liberal notion of uniform equivalence, in which R ranges only over the sets of facts rather than all sets of rules. This notion, which is well-known, is particularly useful for assessing whether programs P and Q are equivalent as components in a logic program which is modularly structured. We provide semantical characterizations of uniform equivalence for disjunctive logic programs and some restricted classes, and analyze the computational cost of uniform equivalence in the propositional (ground) case. Our results, which naturally extend to answer set semantics, complement the results on strong equivalence of logic programs and pave the way for optimizations in answer set solvers as a tool for input-based problem solving.

关键词： uniform equivalence strong equivalence stable models answer set semantics computational complexity program optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：