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

18th Asian Symposium on Programming Languages and Systems (APLAS)

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

ISBN: (纸本)9783030644369;9783030644376

We present P-3, a new profiler suite for parallel applications on the java virtual machine. P-3 specifically targets metrics related to parallelism, concurrency, and synchronization. In particular, P-3 profiles the use of concurrent entities (e.g., threads, tasks, actors, futures), constructs and classes to implement synchronization (including locks, thread parking, and the synchronizers from the *** package), lock-free operations (such as atomic and volatile memory accesses), as well as synchronized and concurrent collections. To the best of our knowledge, our suite is the first tool detecting the use of volatile memory accesses, futures, synchronizers, and utility classes commonly used in concurrent programming. Moreover, P-3 incurs only moderate profiling overhead. P-3 can be readily applied to popular benchmark suites and to public code repositories, facilitating new analyses in the wild. We describe the design and implementation of P-3 and discuss how our tool was fundamental in the selection of workloads composing the Renaissance benchmark suite. Moreover, we use P-3 to analyze the variability of different metrics for multiple iterations of the Renaissance benchmarks.

关键词： Profiling Parallelism Concurrency Synchronization java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Profiling Object Life Ranges for Detecting Memory Leaks in java virtual machine

Profiling Object Life Ranges for Detecting Memory Leaks in J...

引用

13th International Conference on Parallel and Distributed Computing, Applications, and Technologies (PDCAT)

作者： Sun, Qingyue Shi, Xiaohua Xie, Junru Beihang Univ Sch Comp Sci & Engn Beijing 100191 Peoples R China

ISBN: (纸本)9780769548791

java virtual machine (JVM) has its garbage collector (GC) to manage all the java objects and the heap memory. However, in many java applications, some java objects will not be visited by the programs, but could not be automatically reclaimed by the garbage collector. These java objects would cause the memory leaks. Obtaining the life ranges of all java objects in the heap memory could help programmers to find the kind of memory leaks. This paper presents two approaches to scan the garbage-collector-managed heap memory to record the living status of all java object at runtime. One approach is called All-Scanning mechanism, and the other is called Incremental-Scanning mechanism. The All-Scanning mechanism scans heap objects after GC reclaiming the objects in a static way. The Incremental-Scanning mechanism could incrementally collect the status of heap objects when GC reclaims the objects. We use SpecJVM98 and SpecJBB2000 to evaluate the runtime performance and analyze the profiling results for both mechanisms. The profiling results of the two mechanisms are consistent, while the Incremental-Scanning mechanism is at least 1.82 times faster than the All-Scanning one on average. From the profiling results, we could figure out the life cycles of every object, the movements of the object allocations, and the potentially leaked objects. We also use three workloads, namely ListLeak, SwapLeak and MySql, to demonstrate how to find out the leaked objects from the profiling results.

关键词： java virtual machine Memory Leak Garbage Collector

来源：评论

学校读者我要写书评

暂无评论

Optimization of java virtual machine with safe-point Garbage Collection

Optimization of Java Virtual Machine with safe-point Garbage...

引用

10th IEEE International Symposium on Consumer Electronics (ISCE 2006)

作者： Rogov, Sergey V. Kirillin, Viacheslav A. Sidelnikov, Victor V. St Petersburg Electrotech Univ St Petersburg Russia

ISBN: (纸本)1424402158

The paper reveals several inconsistencies of java virtual machine with safe point Garbage Collection, which may incur performance penalties. Two ways of solving these shortcomings are discussed and the most preferable is chosen for implementation. Optimized prototype of Connected Device Configuration virtual machine was benchmarked by the set of java Hartstone experiments, which results confirm advantages of chosen solution. Proposed optimization is highly applicable, transparent and simple to understand.

关键词： java virtual machine garbage collection threading model soft real-time

来源：评论

学校读者我要写书评

暂无评论

CONFUZZION: A java virtual machine Fuzzer for Type Confusion Vulnerabilities 21

CONFUZZION: A Java Virtual Machine Fuzzer for Type Confusion...

引用

21st IEEE International Conference on Software Quality, Reliability and Security (QRS)

作者： Bonnaventure, William Khanfir, Ahmed Bartel, Alexandre Papadakis, Mike Le Traon, Yves Univ Luxembourg SnT Luxembourg Luxembourg Umea Univ Dept Comp Sci Umea Sweden

ISBN: (纸本)9781665458139

Current java virtual machine (JVM) fuzzers aim at generating syntactically valid java programs, without targeting any particular use of the standard java library. While effective, such fuzzers fail to discover specific kinds of bugs or vulnerabilities, such as type confusion, that are related to the standard API usage. To deal with this issue, we introduce a mutation-based feedback-guided black-box JVM fuzzer, called CONFUZZION. CONFUZZION, as the name suggests, targets security-relevant object-oriented flaws with a particular focus on type confusion vulnerabilities. We show that in less than 4 hours, on commodity hardware and without any predefined initialization seed, CONFUZZION automatically generates java programs that reveal JVM vulnerabilities, i.e., the Common Vulnerabilities and Exposures CVE-2017-3272. We also show that state-of-the-art fuzzers or even traditional automatic testing techniques are not capable of detecting such faults, even after 48 hours of execution in the same environment. To the best of our knowledge, CONFUZZION is the first fuzzer able to detect JVM type confusion vulnerabilities.

关键词： Fuzzing vulnerability java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Profiling Streams on the java virtual machine 20

Profiling Streams on the Java Virtual Machine

引用

4th International Conference on the Art Science and Engineering of Programming

作者： Rosero, Edgar Eduardo Rosales Rosa, Andrea Binder, Walter Univ Svizzera italiana Fac Informat Lugano Switzerland

ISBN: (纸本)9781450375078

The *** framework is becoming a popular option among developers that target the java virtual machine (JVM) to implement map-reduce-like transformations on collections. A key feature of the streams framework is enabling parallelizing a computation as easy as calling a single method. Still, developers should test whether parallelizing a stream may results in performance, liveness or safety hazards. While such issues are mainly observable at runtime, there is a lack of tools capturing information that enable understanding the dynamic behavior of a stream application. In this extended abstract, we devise a profiler focused on characterizing dynamic attributes of a stream application running on a single JVM in a shared-memory multicore. Our tool aims at collecting runtime information and key metrics to support analysis of sequential and parallel stream processing, towards helping developers make better decisions to efficiently and safely use the streams framework.

关键词： Dynamic analysis streams performance analysis java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Cold object identification in the java virtual machine

引用

SOFTWARE-PRACTICE & EXPERIENCE 2017年第1期47卷 79-95页

作者： Briggs, Kim T. Zhou, Baoguo Dueck, Gerhard W. IBM Canada 770 Palladium Dr Ottawa ON Canada Univ New Brunswick Fac Comp Sci Fredericton NB E3B 5A3 Canada

Many java applications instantiate objects within the java heap that are persistent but seldom if ever referenced by the application. Examples include strings, such as error messages, and collections of value objects that are preloaded for fast access. This paper describes a stack-based framework for detecting these cold' objects at runtime, with a view to marshaling and sequestering them in designated regions of the heap where they may be preferentially paged out to a backing store, thereby freeing physical memory pages for occupation by more active objects. Furthermore, we evaluate the correctness and efficiency of stack-based approach with an access barrier. The experimental results from a series of SPECjvm2008 benchmarks are presented. Copyright (c) 2016 John Wiley & Sons, Ltd.

关键词： java virtual machine garbage collection cold objects access barrier stack sampling

来源：评论

学校读者我要写书评

暂无评论

Lightweight monitors for the java virtual machine

引用

SOFTWARE-PRACTICE & EXPERIENCE 2005年第3期35卷 281-299页

作者： Yang, BS Moon, SM Ebcioglu, K Seoul Natl Univ Sch Elect Engn Seoul 151742 South Korea IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA

java supports the monitor construct for language-level synchronization in the context of multithreading. This paper introduces the lightweight monitor, an efficient user-level monitor implementation. The lightweight monitor is useful for single-threaded java programs as well as for multi-threaded java programs with little lock contention. A 32-bit lock is embedded in each object for efficient lock access while other monitor data structures are managed using a hash table. We highly optimized the lock manipulation code, which is translated and inlined by a just-in-time (JIT) compiler. In the most probable cases, only nine SPARC instructions are spent for lock acquisition and five instructions are spent for lock release. Our experimental results indicate that the lightweight monitor is faster than the monitor implementation in the SUN JDK 1.2 RC1 by up to 21 times in the absence of lock contention and by up to seven times in the presence of lock contention. Copyright (C) 2004 John Wiley Sons, Ltd.

关键词： monitor lock java virtual machine just-in-time compilation

来源：评论

学校读者我要写书评

暂无评论

Orthogonal persistence in nonvolatile memory architectures: A persistent heap design and its implementation for a java virtual machine

引用

SOFTWARE-PRACTICE & EXPERIENCE 2020年第4期50卷 368-387页

作者： Perez, Taciano D. Neves, Marcelo, V Medaglia, Diego Monteiro, Pedro H. G. De Rose, Cesar A. F. ASML Eindhoven Netherlands Pontificia Univ Catolica Rio Grande do Sul Polytech Sch BR-90619790 Porto Alegre RS Brazil HP Res & Dev Porto Alegre RS Brazil

Current computer systems separate main memory from storage, and programming languages typically reflect this distinction using different representations for data in memory and storage. However, moving data back and forth between these different layers and representations compromise both programming and execution efficiency. To remedy this, the concept of orthogonal persistence (OP) was proposed in the early 1980s advocating that, from a programmer's standpoint, there should be no differences in the way that short-term and long-term data are manipulated. However, at that time, the underlying implementations still had to cope with the complexity of moving data across memory and storage. Today, recent nonvolatile memory (NVM) technologies, such as resistive RAM and phase-change memory, allow main memory and storage to be collapsed into a single layer of persistent memory, opening the way for more efficient programming abstractions for handling persistence. In this work, we revisit OP concepts in the context of NVM architectures and propose a persistent heap design for languages with automatic memory management. We demonstrate how it can significantly increase programmer and execution efficiency, removing the impedance mismatch of crossing semantic boundaries. To validate and demonstrate the presented concepts, we present JaphaVM, an implementation of the proposed design based on JamVM, an open-source java virtual machine. Our results show that JaphaVM, in most cases, executes the same operations between one and two orders of magnitude faster than regular database-based and file-based implementations, while requiring significantly less lines of code.

关键词： java virtual machine nonvolatile memory orthogonal persistence persistent memory

来源：评论

学校读者我要写书评

暂无评论

On the design of the local variable cache in a hardware translation-based java virtual machine

引用

ACM SIGPLAN NOTICES 2005年第7期40卷 87-94页

作者： Oi, H Univ Aizu Dept Comp Sci Aizu Wakamatsu Japan

Hardware bytecode translation is a technique to improve the performance of the java virtual machine (JVM), especially on the portable devices for which dynamic compilation is infeasible. However, since the translation is done on a single bytecode basis, it is likely to generate frequent memory accesses for local variables which can be a performance bottleneck. In this paper, we propose to add a small register file to the datapath of the hardware-translation based JVM and use it as a local variable cache. We evaluate the effectiveness of the local variable cache against the size of the local variable cache which determines the chip area overhead and the operating speed. We also discuss the mechanisms for the efficient parameter passing and the on-the-fly profiling. With two types of exceptions, a 16-entry local variable cache achieved hit ratios of 60 to 98 %. The first type of exceptions is represented by the FFT, which accesses more than 16 local variables. In this case, on-the-fly profiling was effective. The hit ratio of 16-entry cache for the FFT was increased from 44 to 83 %. The second type of exception is represented by the SAXON XSLT processor for which cold misses were significant. The proposed parameter passing mechanism turned 6.4 to 13.3 % of total accesses from miss to hit to the local variable cache.

关键词： java virtual machine hardware-translation memory hierarchy

来源：评论

学校读者我要写书评

暂无评论

Platform independent dynamic java virtual machine analysis: the java Grande Forum benchmark suite

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2003年第3-5期15卷 459-484页

作者： Gregg, D Power, J Waldron, J Univ Dublin Trinity Coll Dept Comp Sci Dublin 2 Ireland Natl Univ Ireland Dept Comp Sci Maynooth Kildare Ireland

In this paper we present a platform independent analysis of the dynamic profiles of java programs when executing on the java virtual machine. The java programs selected are taken from the java Grande Forum benchmark suite and five different java-to-bytecode compilers are analysed. The results presented describe the dynamic instruction usage frequencies. as well as the sizes of the local variable, parameter and operand stacks during execution on the JVM. These results, presenting a picture of the actual (rather than presumed) behaviour of the JVM, have implications both for the coverage aspects of the java Grande benchmark suites, for the performance of the java-to-bytecode compilers and for the design of the JVM. Copyright (C) 2003 John Wiley Sons, Ltd.

关键词： java virtual machine java Grande instruction frequency method profiling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：