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

just-in-time compiler System in Aspect-Oriented Programming based Building Block Platform for constructing Domain-Specific Language for HPC Application 10

Just-In-Time Compiler System in Aspect-Oriented Programming ...

引用

10th International Symposium on Computing and Networking (CANDAR)

作者： Ishimura, Osamu Yoshimoto, Yoshihide Univ Tokyo Tokyo Japan

ISBN: (纸本)9781665475327

The recent complexity of high-performance computing (HPC) systems to create efficient programs is becoming more difficult because of the lagging of processors' performance. Domain Specific Language (DSL) is a promising approach that offers a productive environment and creates a high-efficient program. However, DSLs lack portability and make developers incur high costs. An Aspect-Oriented Programming (AOP) based platform for building DSL processing systems is proposed to solve the problem. By combining reusable aspect modules, DSL processing systems can be built into each HPC system to assist developers in creating programs with various systems configurations. The platform is achieved by putting the application programming interface into the user's kernel code and controlling the kernel's execution according to the platform conventions. However, the platform has some problems. It is impossible to perform optimization that intervenes in the kernel code. It is also impossible to use SIMD and GPGPU efficiently. This study proposes a modification of the kernel code by introducing a just-In-time (JIT) compilation system into the platform and using SIMD and GPGPU. We also created benchmarks and confirmed a performance improvement of 94% for reducing the execution time compared with the based platform and an improvement of 9% compared with handwritten code for auto compiler optimization.

关键词： Domain-Specific Language Aspect-Oriented Programming High-Performance Computing just-in-time compiler

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Java just-in-time compiler

引用

Journal of Computer Science & Technology 2000年第6期15卷 584-590页

作者：丁宇新梅嘉程虎 Institute of Software Chinese Academy of Sciences Beijing P.R. China

Early Java implementations relied on interpretation, leading to poor performance compared to compiled programs. Java just-in-time (JIT) compiler can compile Java programs at runtime, so it not only improves Java's performance prominently, but also preserves Java's portability. In this paper the design and implementing techniques of Java JIT compiler based on Chinese open system are discussed in detail. To enhance the portability, a translating method which combines the static simulating method and macro expansion method is adopted. The optimization technique for JIT compiler is also discussed and a way to evaluate the hotspots in Java programs is presented. Experiments have been conducted to verify JIT compilation technique as an efficient way to accelerate Java.

关键词： Java just-in-time compiler virtual machine

来源：评论

学校读者我要写书评

暂无评论

HOPE: A Python just-in-time compiler for astrophysical computations

引用

ASTRONOMY AND COMPUTING 2015年 10卷 1-8页

作者： Akeret, J. Gamper, L. Amara, A. Refregier, A. ETH Inst Astron Dept Phys CH-8093 Zurich Switzerland

The Python programming language is becoming increasingly popular for scientific applications due to its simplicity, versatility, and the broad range of its libraries. A drawback of this dynamic language, however, is its low runtime performance which limits its applicability for large simulations and for the analysis of large data sets, as is common in astrophysics and cosmology. While various frameworks have been developed to address this limitation, most focus on covering the complete language set, and either force the user to alter the code or are not able to reach the full speed of an optimised native compiled language. In order to combine the ease of Python and the speed of C++, we developed HOPE, a specialised Python just-in-time (JIT) compiler designed for numerical astrophysical applications. HOPE focuses on a subset of the language and is able to translate Python code into C++ while performing numerical optimisation on mathematical expressions at runtime. To enable the JIT compilation, the user only needs to add a decorator to the function definition. We assess the performance of HOPE by performing a series of benchmarks and compare its execution speed with that of plain Python, C++ and the other existing frameworks. We find that HOPE improves the performance compared to plain Python by a factor of 2 to 120, achieves speeds comparable to that of C++, and often exceeds the speed of the existing solutions. We discuss the differences between HOPE and the other frameworks, as well as future extensions of its capabilities. The fully documented HOPE package is available at http://*** and is published under the GPLv3 license on PyPI and GitHub. (C) 2014 The Authors. Published by Elsevier BY.

关键词： Python just-in-time compiler Benchmark

来源：评论

学校读者我要写书评

暂无评论

Effectiveness of cross-platform optimizations for a Java just-in-time compiler

Effectiveness of cross-platform optimizations for a Java Jus...

引用

18th Annual Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA 2003)

作者： Ishizaki, K Takeuchi, M Kawachiya, K Suganuma, T Gohda, O Inagaki, T Koseki, A Ogata, K Kawahito, M Yasue, T Ogasawara, T Onodera, T Komatsu, H Nakatani, T Tokyo Res Lab IBM Res Yamato Kanagawa 2428502 Japan

This paper describes the system over-view of our Java just-In-time (JIT) compiler, which is the basis for the latest production version of IBM Java JIT compiler that supports a diversity of processor architectures including both 32-bit and 64-bit modes, CISC, RISC, and VLIW architectures. In particular, we focus on the design and evaluation of the cross-platform optimizations that are common across different architectures. We studied the effectiveness of each optimization by selectively disabling it in our JIT compiler on three different platforms: IA-32, IA-64, and PowerPC. Our detailed measurements allowed us to rank the optimizations in terms of the greatest performance improvements with the smallest compilation times. The identified set includes method inlining only for tiny methods, exception check eliminations using forward dataflow analysis and partial redundancy elimination, scalar replacement for instance and class fields using dataflow analysis, optimizations for type inclusion checks, and the elimination of merge points in the control flow graphs. These optimizations can achieve 90% of the peak performance for two industry-standard benchmark programs on these platforms with only 34% of the compilation time compared to the case for using all of the optimizations.

关键词： algorithms measurement performance experimentation languages Java just-in-time compiler optimization

来源：评论

学校读者我要写书评

暂无评论

A Novel Lightweight Instruction Scheduling Algorithm for just-in-time compiler

A Novel Lightweight Instruction Scheduling Algorithm for Jus...

引用

World Congress on Software Engineering

作者： Shi, Xiaohua Guo, Peng Beihang Univ Sch Comp Sci Beijing Peoples R China Intel Corp Microprocessor Technol Labs Santa Clara CA 95054 USA

ISBN: (纸本)9780769535708

In this paper, we present a lightweight algorithm of instruction scheduling to reduce the pipeline stalls on XScale. The algorithm is designed for and implemented in a J2ME just-In-time (JET) compiler. It is not based on Directed Acyclic Graphs (DAGs) or expression trees, but a novel data structure namely extended dependency matrix (EDM). The algorithm has almost linear time complexity to one order of magnitude less of the code length in practice, and linear to the code length in the worst cases. It consumes only about 1 KB constant memory space. On the benchmarks we studied, it can eliminate up to 41% data dependency stalls at runtime. The algorithm is on average 2 times faster than a list scheduling implementation, in terms of compilation time. On all benchmarks we studied, the performance is more than 90% as efficient as that obtained using more time and memory consuming algorithms on average.

关键词： Instrution Scheduling just-in-time compiler

来源：评论

学校读者我要写书评

暂无评论

Design, implementation, and evaluation of optimizations in a Java™ just-in-time compiler

引用

CONCURRENCY-PRACTICE AND EXPERIENCE 2000年第6期12卷 457-475页

作者： Ishizaki, K Kawahito, M Yasue, T Takeuchi, M Ogasawara, T Suganuma, T Onodera, T Komatsu, H Nakatani, T IBM Corp Tokyo Res Lab Kanagawa 2428502 Japan

The Java language incurs a runtime overhead for exception checks and object accesses, which are executed without an interior pointer in order to ensure safety. It also requires type inclusion test, dynamic class loading, and dynamic method calls in order to ensure flexibility, A 'just-In-time' (JIT) compiler generates native code from Java byte code at runtime. It must improve the runtime performance without compromising the safety and flexibility of the Java language. We designed and implemented effective optimizations for a JIT compiler, such as exception check elimination, common subexpression elimination, simple type inclusion test, method inlining, and devirtualization of dynamic method call, We evaluate the performance benefits of these optimizations based on various statistics collected using SPECjvm98, its candidates, and two JavaSoft applications with byte code sizes ranging from 23 000 to 280 000 bytes, Each optimization contributes to an improvement in the performance of the programs, Copyright (C) 2000 John Wiley & Sons, Ltd.

关键词： Java just-in-time compiler exception checking common subexpression elimination type inclusion test method inlining devirtualization

来源：评论

学校读者我要写书评

暂无评论

Effectiveness of cross-platform optimizations for a java just-in-time compiler 03

Effectiveness of cross-platform optimizations for a java jus...

引用

Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications

作者： Kazuaki Ishizaki Mikio Takeuchi Kiyokuni Kawachiya Toshio Suganuma Osamu Gohda Tatsushi Inagaki Akira Koseki Kazunori Ogata Motohiro Kawahito Toshiaki Yasue Takeshi Ogasawara Tamiya Onodera Hideaki Komatsu Toshio Nakatani IBM Research Kanagawa Japan

ISBN: (纸本)9781581137125

This paper describes the system overview of our Java just-In-time (JIT) compiler, which is the basis for the latest production version of IBM Java JIT compiler that supports a diversity of processor architectures including both 32-bit and 64-bit modes, CISC, RISC, and VLIW architectures. In particular, we focus on the design and evaluation of the cross-platform optimizations that are common across different architectures. We studied the effectiveness of each optimization by selectively disabling it in our JIT compiler on three different platforms: IA-32, IA-64, and PowerPC. Our detailed measurements allowed us to rank the optimizations in terms of the greatest performance improvements with the smallest compilation times. The identified set includes method inlining only for tiny methods, exception check eliminations using forward dataflow analysis and partial redundancy elimination, scalar replacement for instance and class fields using dataflow analysis, optimizations for type inclusion checks, and the elimination of merge points in the control flow graphs. These optimizations can achieve 90% of the peak performance for two industry-standard benchmark programs on these platforms with only 34% of the compilation time compared to the case for using all of the optimizations.

关键词： just-in-time compiler Java optimization

来源：评论

学校读者我要写书评

暂无评论

Exceptionization: A Java VM Optimization for Non-Java Languages

引用

ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION 2017年第1期14卷 1–25页

作者： Yang, Byung-Sun Kim, Jae-Yun Moon, Soo-Mook Seoul Natl Univ Dept Elect Engn & Comp Sci Seoul 08826 South Korea

Java virtual machine (JVM) has recently evolved into a general-purpose language runtime environment to execute popular programming languages such as JavaScript, Ruby, Python, and Scala. These languages have complex non-Java features, including dynamic typing and first-class function, so additional language runtimes (engines) arc provided on top of the JVM to support them with by extensions. Although there are high-performance JVMs with powerful just-in-time (-HT) compilers, running these languages efficiently on the JVM is still a challenge. This article introduces a simple and novel technique for the JVM JIT compiler called exeeptionization to improve the performance of JVM-based language runtimes. We observed that the JVM executing some non-Java languages encounters at least 2 times more branch bytecodes than Java, most of which are highly biased to take only one target. Exceptionization treats such a highly biased branch as some implicit exception throwing instruction. This allows the JVM JIT compiler to prune the infrequent target of the branch from the frequent control flow, thus compiling the frequent control flow more aggressively with better optimization. If a pruned path were taken, then it would run like a Java exception handler, that is, a catch block. We also devised de-exceptionization, a mechanism to cope with the case when a pruned path is executed more often than expected. Since exceptionization is a generic JVM optimization, independent of any specific language runtime, it would be generally applicable to other language runtimes on the JVM. Our experimental result shows that exceptionization accelerates the performance of several non-Java languages. For example, JavaScript-onJVM runs faster by as much as 60% and by 6% on average, when experimented with the Octane benchmark suite on Oracle's latest Nashorn JavaScript engine and HotSpot ***. Furthermore, the performance of Ruby-on-JVM shows an improvement by as much as 60% and by 6% on average, wh

关键词： Javascript Java virtual machine just-in-time compiler non Java languages

来源：评论

学校读者我要写书评

暂无评论

Finding Good Compilation Plans: A Strategy to Enhance an Adaptive Optimization System

引用

IEEE LATIN AMERICA TRANSACTIONS 2020年第7期18卷 1185-1192页

作者： Ferrari, A. Segawa, C. da Silva, A. Mendes Cardoso Arquitetura Maringa Parana Brazil Univ Fed Minas Gerais Programa Posgrad Ciencia Comp Belo Horizonte MG Brazil Univ Estadual Maringa Maringa Parana Brazil

An important component of virtual machines is the adaptive optimization system, which decides what methods to optimize and what compiler optimization set to enable. In this context, this paper presents the development of an auto-tuning adaptive optimization system (a strategy to find good compiler optimizations), in order to obtain the best possible performance;that is, the reduction of runtime. Such system was implemented over the Jikes Research Virtual Machine, and the results indicate that the proposal is capable of achieving 11% better average performance, at a cost of less than 10% of the total runtime.

关键词： Optimization DNA Adaptive systems Virtual machining Java Electronic mail Manuals adaptive optimization system just-in-time compiler virtual machine performance

来源：评论

学校读者我要写书评

暂无评论

TASTYTRUFFLE: just-in-time Specialization of Parametric Polymorphism

引用

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2023年第OOPSLA期7卷 1561–1588页

作者： D'Souza, Matt You, James Lhotak, Ondrej Prokopec, Aleksandar Univ Waterloo Waterloo ON N2L 3G1 Canada Oracle Labs Zurich Switzerland

Parametric polymorphism allows programmers to express algorithms independently of the types of values that they operate on. The approach used to implement parametric polymorphism can have important performance implications. One popular approach, erasure, uses a uniform representation for generic data, which entails primitive boxing and other indirections that harm performance. Erasure destroys type information that could be used by language implementations to optimize generic code. We present TASTYTRUFFLE, an implementation for a subset of the Scala programming language. Instead of JVM bytecode, TASTYTRUFFLE interprets Scala's TASTy intermediate representation, a typed representation wherein generic types are not erased. TASTy's precise type information empowers TASTYTRUFFLE to implement generic code more effectively. In particular, it allows TASTYTRUFFLE to reify types as run-time objects that can be passed around. Using reified types, TASTYTRUFFLE supports heterogeneous box-free representations for generic values. TASTYTRUFFLE also uses reified types to specialize generic code, producing monomorphic copies of generic code that can be easily and reliably optimized by its just-in-time (JIT) compiler. Empirically, TASTYTRUFFLE is competitive with standard JVM implementations on a small set of benchmark programs;when generic code is used with multiple types, TASTYTRUFFLE consistently outperforms the JVM. The precise type information in TASTy enables TASTYTRUFFLE to find additional optimization opportunities that could not be uncovered with erased JVM bytecode.

关键词： parametric polymorphism specialization reified types just-in-time compiler Truffle Scala

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：