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

An analytical POC stack operations folding for continuous and discontinuous java bytecodes

JOURNAL OF SYSTEMS ARCHITECTURE 2002年第1-3期48卷 1-16页

作者： Ton, LR Chang, LC Chung, CP Natl Chiao Tung Univ Dept Comp Sci & Informat Engn Hsinchu 300 Taiwan

The execution performance of a stack-based java virtual machine (JVM) is limited by the true data dependency. To enhance the performance of the JVM, a stack operations folding mechanism for the picojava-I/II processor was proposed by Sun Microsystems to fold 42.3% stack operations. By comparing the continuous bytecodes with predefined folding patterns in instruction decoder, the number of push/pop operations in between the operand stack and the local variable could be reduced. In this study, an enhanced POC (EPOC) folding model is proposed to further fold the discontinuous bytecodes that cannot be folded in continuous bytecodes folding mechanisms. By proposing a stack re-order buffer (SROB) to help the folding check processes, the EPOC folding model can fold the stack operations perfectly with a small size of SROB implementation. Statistical data shows that the four-foldable strategy of the EPOC folding model can eliminate 98.8% of push/pop operations with an instruction buffer size of 7 bytes and the SROB size of eight entries. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： java virtual machine stack operations folding POC folding model EPOC folding model java processor

来源：评论

学校读者我要写书评

暂无评论

A performance comparison between stop-the-world and multithreaded concurrent generational garbage collection for java

A performance comparison between stop-the-world and multithr...

引用

IEEE International Performance, Computing, and Communications Conference

作者： Lo, CTD Srisa-An, W Chang, JM IIT Dept Comp Sci Chicago IL 60616 USA

ISBN: (纸本)0780373715

Recent popularity of java programming language has brought the automatic dynamic memory management (a.k.a., the garbage collection) into the mainstream, Traditional garbage collectors suffer from long garbage collection pauses (stop-the-world mark-sweep algorithm) or inability of collecting cyclic garbage (reference counting approach). Generational garbage collection, however, is based only on the weak generational hypothesis that most objects die young. In this paper, the performance evaluation of a new multithreaded concurrent generational garbage collector (MCGC) based on mark-sweep with the assistance of reference counting is reported. The MCGC can take advantage of multiple CPUs in an SMP system and the merits of light weight processes. Furthermore, the long garbage collection pause can be reduced and the garbage collection efficiency can be enhanced. Measurement results indicate that the MCGC improves the garbage collection pause time up to 96.75% over the traditional stop-the-world mark-sweep garbage collector. Moreover, the MCGC receives minimal time and space penalties as shown in the report of the total execution time, the memory footprint and the sticky reference count rate.

关键词： dynamic memory management object-oriented programming multithreaded programming java virtual machine concurrent garbage collection system modified buddy system parallel garbage collector

来源：评论

学校读者我要写书评

暂无评论

A multithreaded concurrent garbage collector parallelizing the new instruction in java 16

A multithreaded concurrent garbage collector parallelizing t...

引用

16th International Parallel and Distributed Processing Symposium, IPDPS 2002

作者： Lo, C.-T.D. Srisa-An, W. Chang, J.M. Department of Computer Science Illinois Institute of Technology ChicagoIL60616-3793 United States

ISBN: (纸本)0769515738

Parallel, multithreaded java applications such as Web servers, database servers, and scientific applications are becoming increasingly prevalent. Most of them have high object instantiation rates through the new bytecode that is implemented in a garbage collection subsystem typically. For aforementioned applications, traditional garbage collectors are often the bottleneck that limits program performance and processor utilization on multiprocessor systems. They suffer from long garbage collection pauses (stop-the-world mark-sweep algorithm) or inability of collecting cyclic garbage (reference counting approach). Generational garbage collection, however, is based only on the weak generational hypothesis that most objects die young. In this paper, a new multithreaded concurrent generational garbage collector (MCGC) based on mark-sweep with the assistance of reference counting is proposed. The MCGC can take advantage of multiple CPUs in an SMP system and the merits or light weight processes. Furthermore, the long garbage collection pause can be reduced and the garbage collection efficiency can be enhanced. © 2002 IEEE.

关键词： concurrent garbage collection dynamic memory management java virtual machine multithreaded programming object-oriented programming parallel garbage collector

来源：评论

学校读者我要写书评

暂无评论

A distributed implementation of a virtual machine for java

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2001年第3期13卷 221-244页

作者： Aridor, Y Factor, M Teperman, A IBM Haifa Res Lab Adv Technol Ctr IL-31905 Haifa Israel

The cluster virtual machine (VM) for java provides a single system image of a traditional java virtual machine (JVM) while executing in a distributed fashion on the nodes of a cluster. The cluster VM for java virtualizes the cluster, supporting any pure java application without requiring that application be tailored specifically for it. The aim of our cluster VM is to obtain improved scalability for a class of java Server Applications by distributing the application's work among the cluster's computing resources. The implementation of the cluster VM for java is based on a novel object model which distinguishes between an application's view of an object (e.g. every object is a unique data structure) and its implementation (e.g. objects may have consistent replications on different nodes). This enables us to exploit knowledge on the use of individual objects to improve performance (e.g, using object replications to increase locality of access to objects). We have already completed a prototype that runs pure java applications on a cluster of NT workstations connected by a Myrinet fast switch, The prototype provides a single system image to applications, distributing the application's threads and objects over the cluster. We used the cluster VM to run, without change, a real java Server Application containing over 10 Kloc(double dagger) for the source code and achieved high scalability for it on a cluster. We also achieved linear speedup for another application with a large number of independent threads. This paper discusses the architecture and implementation of the cluster VM. It focuses on achieving a single system image for a traditional JVM on a cluster white describing, in short, how we aim to obtain scalability. Copyright (C) 2001 John Wiley & Sons, Ltd.

关键词： cluster machine java objects java virtual machine single system image

来源：评论

学校读者我要写书评

暂无评论

Asynchronous migration of execution context in java virtual machines

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2001年第2期18卷 225-233页

作者： Shudo, K Muraoka, Y Waseda Univ Sch Sci & Engn Shinjuku Ku Tokyo 1698555 Japan

The migration of the execution context has been applied to remote execution and mobile agents, and asynchronous migration can be applied to even more applications, such as load balancing. We have therefore designed a system for the migration of java threads, one that allows asynchronous and heterogeneous migration of the execution context of the running code. This paper describes an overview of the system, the problems we have faced in designing its facilities, and the results of preliminary evaluations of its performance. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： thread migration execution context asynchronous migration runtime system java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Compiling scheme to JVM bytecode:: a performance study 02

Compiling scheme to JVM bytecode:: a performance study

引用

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming

作者： Bernard Paul Serpette Manuel Serrano Inria Sophia-Antipolis Sophia-Antipolis Cedex France

ISBN: (纸本)9781581134872

We have added a java virtual machine (henceforth JVM) bytecode generator to the optimizing Scheme-to-C compiler Bigloo. We named this new compiler BiglooJVM. We have used this new compiler to evaluate how suitable the JVM bytecode is as a target for compiling strict functional languages such as Scheme. In this paper, we focus on the performance issue. We have measured the execution time of many Scheme programs when compiled to C and when compiled to JVM. We found that for each benchmark, at least one of our hardware platforms ran the BiglooJVM version in less than twice the time taken by the Bigloo version. In order to deliver fast programs the generated JVM bytecode must be carefully crafted in order to benefit from the speedup of just-in-time compilers.

关键词： compilation scheme java virtual machine functional languages

来源：评论

学校读者我要写书评

暂无评论

A compositional account of the java virtual machine 99

A compositional account of the Java virtual machine

引用

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

作者： Phillip M. Yelland Sun Microsystems Laboratories 910 San Antonio Road MS MTV29-117 Palo Alto CA

ISBN: (纸本)9781581130959

The java virtual machine (or JVM) is central to the system's aim of providing a secure program execution environment that operates identically on a wide variety of computing platforms. To be most effective in this role, the JVM needs a rigorous, complete description, to specify precisely the behavior required of implementations. In response, a number of researchers have produced formal accounts of the JVM that seek to define it in an unambiguous and comprehensible manner. Unfortunately, the size and complexity of the JVM means that many of these formal accounts must either restrict their scope substantially, or risk becoming unwieldy and intractable. This paper suggests an alternative approach to the specification of the JVM that seeks to ameliorate such problems by composing together a small set of "microinstructions" to produce the full bytecode set. These microinstructions are encapsulated as functions in the polymorphic functional programming language Haskell, using the familiar mechanisms of Hindley-Milner type inference to characterize the JVM's rather thorny verifier. In this way, its is hoped that a foundation will be laid for formal descriptions of the java virtual machine that need not trade tractability for completeness.

关键词： Haskell java bytecode java virtual machine verification

来源：评论

学校读者我要写书评

暂无评论

EJVM: an economic java run-time environment for embedded devices

引用

SOFTWARE-PRACTICE & EXPERIENCE 2001年第2期31卷 129-146页

作者： Chang, DW Chang, RC Natl Chiao Tung Univ Dept Comp & Informat Sci Hsinchu 30050 Taiwan

As network-enabled embedded devices and java grow in their popularity, embedded system researchers start seeking ways to make these devices java-enabled. However, it is a challenge to apply java technology to these devices due to their shortage of resources. In this paper, we propose EJVM (Economic java virtual machine), an economic way to run java programs on network-enabled and resource-limited embedded devices. Espousing the architecture proposed by distributed JVM, we store all java codes on the server to reduce the storage needs of the client devices. In addition, we use two novel techniques to reduce the client-side memory footprints: server-side class representation conversion and on-demand bytecode loading. Finally, we maintain client-side caches and provide performance evaluation on different caching policies. We implement EJVM by modifying a freely available JVM implementation, Kaffe. From the experiment results, we show that EJVM can reduce java heap requirements by about 20-50 % and achieve 90 % of the original performance. Copyright (C) 2001 John Wiley & Sons, Ltd.

关键词： java virtual machine embedded system memory footprint

来源：评论

学校读者我要写书评

暂无评论

A study of page replacement performance in garbage collection heap

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2001年第3期58卷 235-245页

作者： Lo, CTD Srisa-An, W Chang, JM IIT Dept Comp Sci Chicago IL 60616 USA

Large number of page-faults can severely degrade the performance of any system. While much attention has been paid on the virtual memory space of an entire process, the paging behavior of one particular memory segment has not been reported. Unlike the static behavior in most of the memory segments, the heap segment has unique characteristics closely related to its memory management scheme. First, this paper presents a thorough study on the effect of heap page-faults on the performance of Kaffe JVM version 1.0.5 and the Kaffe java virtual machine (JVM) with the modified buddy system. Second, a modified least recently used (mLRU) is proposed to improve the performance of the LRU page-replacement policy. Four different page-replacement policies, first-in-first-out (FIFO), Random, LRU and mLRU, are used to study the performance of each JVM. Third, the java applications used in this study are SPECjvm98 benchmark suite. These programs represent real-world workload and are highly dynamic memory intensive. Fourth, an instrumented Kaffe JVM is used to generate memory traces. Then, a simulator is used to analyze and reconstruct the heap as the benchmark programs are executed. Finally, this study has shown that the modified buddy system has less page-fault occurrences in six out of eight applications. The improvement can be up to 74%. Moreover, the proposed mLRU can improve the performance up to 68.2%. (C) 2001 Elsevier Science Inc. All rights reserved.

关键词： dynamic memory management object-oriented programming page-fault java virtual machine garbage collection system modified buddy system page replacement policy

来源：评论

学校读者我要写书评

暂无评论

A robust stack folding approach for java processors: an operand extraction-based algorithm

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2001年第8期47卷 697-726页

作者： El-Kharashi, MW Elguibaly, F Li, KF Univ Victoria Dept Elect & Comp Engn Victoria BC V8W 3P6 Canada

Data dependency in stack operations limits the performance of java processors. To enhance java's performance, existing literature suggests using stack operations folding. We extend this concept in a new folding algorithm that identifies principle operations in folding groups and extracts necessary operands from the bytecode queue. The proposed algorithm permits nested pattern folding and multiple issue of folding groups. Hence, the need for and therefore the limitations of a stack are eliminated. This paper discusses various aspects of the proposed algorithm and illustrates different folding scenarios as well as possible hazards. Benchmarking using SPECjvm98 shows excellent performance gains as compared to existing algorithms. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： java java virtual machine java processors java performance java bytecode folding stack processors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：