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

Polymorphic bytecode instrumentation

SOFTWARE-PRACTICE & EXPERIENCE 2016年第10期46卷 1351-1380页

作者： Binder, Walter Moret, Philippe Tanter, Eric Ansaloni, Danilo USI Fac Informat Via G Buffi 13 CH-6900 Lugano Switzerland Univ Chile Comp Sci Dept DCC PLEIAD Lab Santiago Chile

Bytecode instrumentation is a widely used technique to implement aspect weaving and dynamic analyses in virtual machines such as the java virtual machine. Aspect weavers and other instrumentations are usually developed independently and combining them often requires significant engineering effort, if at all possible. In this article, we present polymorphic bytecode instrumentation(PBI), a simple but effective technique that allows dynamic dispatch amongst several, possibly independent instrumentations. PBI enables complete bytecode coverage, that is, any method with a bytecode representation can be instrumented. We illustrate further benefits of PBI with three case studies. First, we describe how PBI can be used to implement a comprehensive profiler of inter-procedural and intra-procedural control flow. Second, we provide an implementation of execution levels for AspectJ, which avoids infinite regression and unwanted interference between aspects. Third, we present a framework for adaptive dynamic analysis, where the analysis to be performed can be changed at runtime by the user. We assess the overhead introduced by PBI and provide thorough performance evaluations of PBI in all three case studies. We show that pure java profilers like JP2 can, thanks to PBI, produce accurate execution profiles by covering all code, including the core java libraries. We then demonstrate that PBI-based execution levels are much faster than control flow pointcuts to avoid interference between aspects and that their efficient integration in a practical aspect language is possible. Finally, we report that PBI enables adaptive dynamic analysis tools that are more reactive to user inputs than existing tools that rely on dynamic aspect-oriented programming with runtime weaving. These experiments position PBI as a widely applicable and practical approach for combining bytecode instrumentations. Copyright (c) 2015 John Wiley & Sons, Ltd.

关键词： bytecode instrumentation dynamic program analysis profiling aspect-oriented programming execution levels java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Design, implementation, and evaluation of a compilation server

引用

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 2007年第4期29卷 1.1-1.40页

作者： Lee, Han B. Diwan, Amer Moss, J. Eliot B. Univ Colorado Boulder CO 80309 USA Univ Massachusetts Amherst MA 01003 USA

Modern JVM implementations interleave execution with compilation of '' hot '' methods to achieve reasonable performance. Since compilation overhead impacts the execution time of the application and induces run-time pauses, we explore offloading compilation onto a compilation server. In this article, we present the design, implementation, and evaluation of a compilation server that compiles and optimizes java bytecodes on behalf of its clients. We show that the compilation server provides the following-benefits for our benchmark programs: (i) lower execution time by reducing the compilation overhead and by enabling more aggressive optimizations;(ii) lower memory allocation by eliminating allocations due to optimizing compilation and the footprint of the optimizing compiler;(iii) lower execution time of the application due to sharing of profile information across different runs of the same application and runs of different applications. We implemented the compilation server in Jikes RVM, and our results indicate that it can reduce running time by an average of 20.5%, interruptions due to compilation by an average of 81.0%, and dynamic memory allocation by 8.6% for our benchmark programs. Simulation results indicate that our current implementation of the compilation server can handle more than 50 concurrent clients while still allowing them to outperform the best performing adaptive configuration.

关键词： design experimentation performance measurement languages compilation server java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Efficient Reuse of Local Regions in Memory-limited Mobile Devices

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2010年第3期56卷 1297-1303页

作者： Kim, Seonggun Kim, Taein Im, Eul Gyu Han, Hwansoo Sungkyunkwan Univ Dept Comp Engn Seoul South Korea Korea Adv Inst Sci & Technol Dept Comp Sci Taejon South Korea Hanyang Univ Dept Comp Sci & Engn Seoul South Korea

Many researches aim to improve memory management for performance, efficiency, ease of use, and safety. Region-based memory management, a newly investigated technique for memory-limited mobile devices, splits the heap into one global (persistent) region, and multiple local regions-one local region per method invocation. Each object allocation is initially assigned to a local region and later transferred to the global region if needed. The allocated memory for a local region is implicitly reclaimed when the associated method call finishes. In this paper, we propose a technique to reduce heap memory usage in memory-limited devices by reusing early local regions in the calling sequence, as they are rarely accessed during the current method. Our experiment with SpecJvm98 shows up to 9% reduction in heap memory(1).

关键词： region-based memory management region reuse java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Space-and-Time Efficient Parallel Garbage Collector for Data-Intensive Applications

引用

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2011年第4期39卷 451-472页

作者： Liu, Shaoshan Wang, Ligang Li, Xiao-Feng Gaudiot, Jean-Luc Univ Calif Irvine Irvine CA 92717 USA Intel China Res Ctr Beijing Peoples R China

As multithreaded server applications and runtime systems prevail, garbage collection is becoming an essential feature to support high performance systems, especially those running data-intensive applications. The fundamental issue of garbage collector (GC) design is to maximize the recycled space with minimal time overhead. This paper proposes two innovative solutions: one to improve space efficiency, and the other to improve time efficiency. To achieve space efficiency, we propose the Space Tuner that utilizes the novel concept of allocation speed to reduce wasted space. Conventional static space partitioning techniques often lead to inefficient space utilization. The Space Tuner adjusts the heap partitioning dynamically such that when a collection is triggered, all space partitions are fully filled. To achieve time efficiency, we propose a novel parallelization method that reduces the compacting GC parallelization problem into a tree traversal parallelization problem. This method can be applied for both normal and large object compaction. Object compaction is hard to parallelize due to strong data dependencies such that the source object can not be moved to its target location until the object originally in the target location has been moved out. Our proposed algorithm overcomes the difficulties by dividing the heap into equal-sized blocks and parallelizing the movement of the independent blocks. It is noteworthy that these proposed algorithms are generic such that they can be utilized in different GC designs. The proposed techniques have been implemented in Apache Harmony JVM and we evaluated the proposed algorithms with SPECjbb and Dacapo benchmark suites. The experiment results demonstrate that our proposed algorithms greatly improve space utilization and the corresponding parallelization schemes are scalable, which brings time efficiency.

关键词： java virtual machine Garbage collection

来源：评论

学校读者我要写书评

暂无评论

Reasoning about safety properties in a JVM-like environment

引用

SCIENCE OF COMPUTER PROGRAMMING 2007年第2-3期67卷 278-300页

作者： Fong, Philip W. L. Univ Regina Dept Comp Sci Regina SK S4S 0A2 Canada

Type-based protection mechanisms in a JVM-like environment must be administrated by the code consumer at the bytecode level. Unfortunately, formulating a sound static type system for the full JVM bytecode language can be a daunting task. It is therefore counter-productive for the designer of a bytecode-level type system to address the full complexity of the VM environment in the early stage of design. In this work, a lightweight modelling tool, Featherweight JVM, is proposed to facilitate the early evaluation of bytecode-level, type-based protection mechanisms and, specifically, their ability to enforce security-motivated stack invariants and confinement properties. Rather than modelling the execution of a specific bytecode stream, Featherweight JVM is a nondeterministic event model that captures all the possible access event sequences that may be generated by a JVM-like environment when well-typed bytecode programs are executed. The effect of deploying a type-based protection mechanism can be modelled by a safety policy that constrains the event sequences produced by the VM model. To evaluate the effectiveness of the protection mechanism, security theorems in the form of state invariants can then be proved in the policy-guarded VM model. To demonstrate the utility of the proposed approach, Vitek et al.'s Confined Types has been formulated as a safety policy for the Featherweight JVM, and a corresponding confinement theorem has been established. To reduce class loading overhead, a capability-based reformulation of Confined Types is then studied, and is shown to preserve the confinement theorem. This paper thus provides first evidence on the utility of Featherweight JVM in providing early feedback to the designer of type-based protection mechanisms for JVM-like environments. (c) 2007 Elsevier B.V. All rights reserved.

关键词： java virtual machine type-based protection mechanism formal verification safety access control stack invariant confinement

来源：评论

学校读者我要写书评

暂无评论

Compiling lazy functional programs to java bytecode

引用

SOFTWARE-PRACTICE & EXPERIENCE 1999年第7期29卷 617-645页

作者： Meehan, G Joy, M Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England

The java virtual machine (JVM) was designed as the target for java compilers, but there is no reason why it cannot be used as the target for other languages. We describe the implementation of a compiler which translates a lazy, weakly-typed functional program into java class files. We compare the performance of our compiler to the only other known compiler from a lazy functional Language to the JVM. The results are broadly similar, suggesting that to get a significant performance speed-up using this compilation paradigm will come only from increasing the performance of the JVM, rather than enhancing the compiler itself. Copyright (C) 1999 John Wiley & Sons, Ltd.

关键词： lazy functional languages compiling java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Flexible and efficient profiling with aspect-oriented programming

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2011年第15期23卷 1749-1773页

作者： Binder, Walter Ansaloni, Danilo Villazon, Alex Moret, Philippe Univ Lugano Fac Informat CH-6900 Lugano Switzerland UPB CINTI Cochabamba Bolivia

Many profilers for virtual execution environments, such as the java virtual machine (JVM), are implemented with low-level bytecode instrumentation techniques, which is tedious, error-prone, and complicates maintenance and extension of the tools. In order to reduce the development time and cost, we promote building profilers for the JVM using high-level aspect-oriented programming (AOP). We show that the use of aspects yields concise profilers that are easy to develop, extend, and maintain, because low-level instrumentation details are hidden from the tool developer. In order to build efficient profilers, we introduce inter-advice communication, an extension to common AOP languages that enables efficient data passing between advices that are woven into the same method using local variables. We illustrate our approach with two case studies. First, we show that an existing, instrumentation-based tool for listener latency profiling can be easily recast as an aspect. Second, we present an aspect for comprehensive calling context profiling. In order to reduce profiling overhead, our aspect parallelizes application execution and profile creation, resulting in a speedup of 110% on a machine with more than two cores, compared with a primitive, non-parallel approach. Copyright (C) 2011 John Wiley & Sons, Ltd.

关键词： profiling aspect-oriented programming aspect weaving bytecode instrumentation calling context tree concurrency multicores java virtual machine

来源：评论

学校读者我要写书评

暂无评论

The transient combinator, higher-order strategies, and the distributed data problem

引用

SCIENCE OF COMPUTER PROGRAMMING 2004年第1-3期52卷 165-212页

作者： Winter, VL Subramaniam, M Univ Nebraska Dept Comp Sci Omaha NE 68182 USA

The distributed data problem is characterized by the desire to bring together semantically related data from syntactically unrelated portions of a term. A strategic combinator called transient and a strategic constant called skip are introduced in the context of a higher-order strategic framework. The notion of traversal is lifted to the higher order as well. The resulting framework allows the manipulation of data to be expressed directly in strategic terms. The impact of this dynamic approach to strategy creation is then explored for several instances of the distributed data problem. Problems considered include three strategic benchmarks as well as two transformations that arise within a class loader for the java virtual machine. (C) 2004 Elsevier B.V. All rights reserved.

关键词： distributed data problem strategic programming higher-order strategic programming higher-order traversal one-layer higher-order traversals transformation program transformation rewriting higher-order rewriting transient combinator skip strategy TL HATS table normalization java class loader strategic benchmarks java virtual machine sandia secure processor

来源：评论

学校读者我要写书评

暂无评论

Application- and Transaction Isolation under java

引用

COMPUTER SCIENCE-RESEARCH AND DEVELOPMENT 2008年第2期22卷 59-69页

作者： Mueller, Jens Spruth, Wilhelm G. Univ Tubingen Wilhelm Schickard Inst Informat Arbeitsbereich Tech Informat Sand 13 D-72076 Tubingen Germany Univ Leipzig Inst Informat Abt Computersysteme D-04103 Leipzig Germany

The java Platform, Enterprise Edition (java EE, previous term: J2EE) has been designed to permit the use of java for mission critical transactional business applications such as financial accounting or enterprise resource planning systems. When programming such applications it is still difficult to assure the isolation between transactions executing in parallel. Compliance with transaction isolation is a basic requirement to keep underlying data in a consistent state. This paper analyses existing problems and gives an overview of the solutions that are presently available or under discussion.

关键词： ACID Application Isolation API Enterprise javaBeans Isolation J2EE java EE java virtual machine JSR 121 Multi Tasking virtual machine Persistent Reusable java virtual machine virtual machine Container Transaction

来源：评论

学校读者我要写书评

暂无评论

JVM Bytecode Verification Without Dataflow Analysis

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2005年第1期141卷 203-220页

作者： Bayley, Ian Shiel, Sam Oxford Brookes Univ Dept Comp Oxford OX33 1HX England

Bytecode verification algorithms are traditionally based on dataflow analysis. We present an alternative algorithm that first restructures the bytecode and then infers a type signature for each method in a manner typical of functional programming languages. We also give an operational semantics to an algebra of structured bytecode and thereby prove both that restructuring preserves semantics and that our type inference is sound.

关键词： program transformation bytecode verification java virtual machine

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：