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

An Instruction Cache Architecture for Parallel Execution of java Threads

An Instruction Cache Architecture for Parallel Execution of ...

Proceedings of The Fourth International Conference on Parallel and Distribyted Computing,Applications and Technologies(第四届并行与分布式计算应用与技术国际会议)

作者： Wanming Chu Yamin Li Department of Computer Hardware University of Aizu Aizu-Wakamatsu 965-8580 Japan Department of Computer Science Hosei University Tokyo 184-8584 Japan

ISBN: (纸本)0780378407

Designing a java processor supporting horizontal multithreading has been becoming more attractive as network computing gains importance. Different from the traditional superscalar processors that issue multiple instructions from a single instruction stream to exploit the instruction level parallelism (ILP), the horizontal multithreading java processors issue multiple instructions (bytecodes) from multiple threads in parallel to exploit not only the ILP but the thread level parallelism (TLP). Such processors have multiple dispatch slots and require the instruction fetch unit to supply instructions with much higher bandwidth than superscalar processors. Using a traditional superscalar cache architecture in a horizontal multithreading java processor results in high cache miss ratio caused by the interference among the threads. This paper investigates multibank instruction cache architecture for horizontal multithreading java processor to meet the requirements of the high instruction fetch bandwidth. In order to evaluate the cache performance as well as the horizontal multithreading java processor performance, we developed a trace driven simulator. The simulator consists of a trace generator that generates the java bytecode execution traces and an architectural simulator that reads the traces and evaluates the performance of the instruction cache and the overall performance of the java *** simulation results show that the performance improvements are obtained by the low cache miss ratio and the high instruction fetch bandwidth of the proposed cache architecture. The IPC performance is about 19 when both the number of slots and the number of banks are 8, about 5 times better than one bank cache.

关键词： Cache java virtual machine java processor instruction level parallelism thread level parallelism multithreading performance evaluation trace-driven simulation

来源：评论

学校读者我要写书评

暂无评论

An Object-Oriented Processor with Just-In-Time Compilation Support

An Object-Oriented Processor with Just-In-Time Compilation S...

引用

2010 International Symposium on Computer,Communication, Control and Automation

作者： Anthony S.Fong C.H.Yau City University of Hong Kong

java is dominating in object-oriented computing. However, java relies on java virtual machine to process java bytecodes, such that it imposes large overhead on the embedded system. In addition, as security is always a major concern in most of the networked computer systems, embedded systems should provide security features to defend against attacks. Many viruses use the security loopholes to trigger attack, such as buffer overflow attack. This paper proposes an object-oriented processor with Just-In-Time compilation support to execute java program effectively and to protect the system. The system realizes the inherent security features of java in the core architecture to enhance the overall system security.

关键词： Object-Oriented processor java virtual machine Just-In-Time compilation

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Generic Event-based Profiler Framework for Dynamic Languages 15

An Efficient and Generic Event-based Profiler Framework for ...

引用

Proceedings of the Principles and Practices of Programming on The java Platform

作者： Gülfem Savrun-Yeniçeri Michael L. Van de Vanter Per Larsen Stefan Brunthaler Michael Franz University of California Irvine Oracle Labs

ISBN: (纸本)9781450337120

Profilers help programmers analyze their programs and identify performance bottlenecks. We implement a profiler framework that helps to compare and analyze programs implementing the same algorithms written in different languages. Profiler implementers replicate common functionalities in their language profilers. We focus on building a generic profiler framework for dynamic languages to minimize the recurring implementation effort. We implement our profiler in a framework that optimizes abstract syntax tree (AST) interpreters using a just-in-time (JIT) compiler. We evaluate it on ZipPy and JRuby+Truffle, Python and Ruby implementations in this framework, respectively. We show that our profiler runs faster than the existing profilers in these languages and requires modest implementation effort. Our profiler serves three purposes: 1) helps users to find the bottlenecks in their programs, 2) helps language implementers to improve the performance of their language implementation, 3) helps to compare and evaluate different languages on cross-language benchmarks.

关键词： abstract syntax tree interpreters PyPy Ruby Profiling JRuby dynamic languages java virtual machine Python

来源：评论

学校读者我要写书评

暂无评论

Performance analysis for languages hosted on the truffle framework 18

Performance analysis for languages hosted on the truffle fra...

引用

Proceedings of the 15th International Conference on Managed Languages & Runtimes

作者： Swapnil Gaikwad Andy Nisbet Mikel Luján University of Manchester Manchester UK

ISBN: (纸本)9781450364249

It is attractive to host new or existing language implementations on top of, or reusing components of, existing managed language runtimes such as the java virtual machine (JVM) or the Microsoft Common Language Infrastructure (CLI). A benefit is that software development effort may be reduced, as only one managed language runtime needs to be optimised and maintained, instead of a separate compiler/runtime for each language *** example, the Truffle framework combined with a JVM offers support for executing javascript, Ruby, R, LLVM IR-compiled languages, etc., as well as supporting the execution of applications combining multiple programming languages within a Polyglot application. In trying to understand the runtime performance of Sulong (i.e. the Truffle project which enables LLVM IR execution), we found a lack of tools and guidance. A similar situation is found for benchmarks written in Ruby and R when executed as Truffle hosted languages. Further, it is non-trivial to relate performance back to the hosted language source code, and to determine whether JVM service overheads, such as garbage collection or JIT compilation, are *** describe how to visually analyse the performance of Truffle-hosted languages based on Flamegraphs, allowing time to be related to sampled call-stacks. We use the Linux tool perf and the JVM agent perf-map-agent, along with enhancements to the Graal JIT compiler that map sampled call-stacks onto JVM-hosted guest language source code. This paper demonstrates the ease and flexibility of using these modified tools, with low overhead during execution time. We also illustrate applicability of the techniques to understand the performance of Polyglot applications.

关键词： R ruby profiling java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Sharing Programming Resources Between Bio* Projects Through Remote Procedure Call and Native Call Stack Strategies

Sharing Programming Resources Between Bio* Projects Through ...

引用

作者： Pjotr Prins Naohisa Goto Andrew Yates Laurent Gautier Scooter Willis Christopher Fields Toshiaki Katayama

Open-source software (OSS) encourages computer programmers to reuse software components written by others. In evolutionary bioinformatics, OSS comes in a broad range of programming languages, including C/C++, Perl, Python, Ruby, java, and R. To avoid writing the same functionality multiple times for different languages, it is possible to share components by bridging computer languages and Bio* projects, such as BioPerl, Biopython, BioRuby, Biojava, and R/Bioconductor. In this chapter, we compare the two principal approaches for sharing software between different programming languages: either by remote procedure call (RPC) or by sharing a local call stack. RPC provides a language-independent protocol over a network interface; examples are RSOAP and Rserve. The local call stack provides a between-language mapping not over the network interface, but directly in computer memory; examples are R bindings, RPy, and languages sharing the java virtual machine stack. This functionality provides strategies for sharing of software between Bio* projects, which can be exploited more often. Here, we present cross-language examples for sequence translation, and measure throughput of the different options. We compare calling into R through native R, RSOAP, Rserve, and RPy interfaces, with the performance of native BioPerl, Biopython, Biojava, and BioRuby implementations, and with call stack bindings to Biojava and the European Molecular Biology Open Software Suite. In general, call stack approaches outperform native Bio* implementations and these, in turn, outperform RPC-based approaches. To test and compare strategies, we provide a downloadable BioNode image with all examples, tools, and libraries included. The BioNode image can be run on virtualBox-supported operating systems, including Windows, OSX, and Linux. less

关键词： Python R Bioinformatics BioPerl BioRuby Biopython Biojava Web services Remote procedure call java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Research on stack-allocation based JVM garbage collection

Research on stack-allocation based JVM garbage collection

引用

International Conference on Advanced Computer Theory and Engineering, ICACTE

作者： Xiaoliang Xu Jiang Shen College of Computer Science Hangzhou Dianzi University Hangzhou Zhejiang China

ISBN: (纸本)9781424465392;9781424465422

In order to reduce the costs of java virtual machine garbage collector, a stack-allocation based on garbage collection algorithm is proposed in this paper. The stack frame is improved to support the object storage, and the stackable objects are identified with expanded byte code when the compiler compiles the java source code. The stackable objects are allocated to java stack and released instantly when they leave their scope, and the other objects are still allocated to heap and released by garbage collector. Experimental result shows, compared to traditional garbage collector, that new algorithm improves the performance of memory allocating and releasing, reduces the burden of garbage collector, and runs faster.

关键词： java virtual machine garbage collection stack allocation waste collection java virtual machine (JVM) stacked structure address byte heap compilers

来源：评论

学校读者我要写书评

暂无评论

Improving J9 virtual machine with LTTng for efficient and effective tracing

引用

SOFTWARE-PRACTICE & EXPERIENCE 2015年第7期45卷 973-987页

作者： Wang, Yang Kent, Kenneth B. Johnson, Graeme IBM Ctr Adv Studies Atlantic Fredericton NB E3B 5A3 Canada

The ability to observe the internal operation of the J9 virtual machine is essential for effective performance tuning. To this end, tracing is an important method, which is the action of recording events from a running system with minimum performance overhead for online or off-line analysis. In this paper, we propose the integration of LTTng, an effective open-source tracing toolset, with J9 to improve its tracing functions. With this integration, the tracing component is not only decoupled from the virtual machine but also performed efficiently at both user and kernel levels to achieve a high-throughput result. To validate the integration and its impact performance, some empirical study results based on SpecJBB2005 and SQLBenchmark (supported by instrumented MariaDB) are also presented. Copyright (c) 2014 John Wiley & Sons, Ltd.

关键词： performance tuning LTTng tracing framework instrumentation java virtual machine IBM J9 MariaDB

来源：评论

学校读者我要写书评

暂无评论

Heap compression for memory-constrained java environments 03

Heap compression for memory-constrained Java environments

引用

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

作者： G. Chen M. Kandemir N. Vijaykrishnan M. J. Irwin B. Mathiske M. Wolczko The Pennsylvania State University University Park PA Sun Microsystems Inc. Mountain View CA

ISBN: (纸本)9781581137125

java is becoming the main software platform for consumer and embedded devices such as mobile phones, PDAs, TV set-top boxes, and in-vehicle systems. Since many of these systems are memory constrained, it is extremely important to keep the memory footprint of java applications under *** goal of this work is to enable the execution of java applications using a smaller heap footprint than that possible using current embedded JVMs. We propose a set of memory management strategies to reduce heap footprint of embedded java applications that execute under severe memory constraints. Our first contribution is a new garbage collector, referred to as the Mark-Compact-Compress (MCC) collector, that allows an application to run with a heap smaller than its footprint. An important characteristic of this collector is that it compresses objects when heap compaction is not sufficient for creating space for the current allocation request. In addition to employing compression, we also consider a heap management strategy and associated garbage collector, called MCL (Mark-Compact-Lazy Allocate), based on lazy allocation of object portions. This new collector operates like the conventional Mark-Compact (MC) collector, but takes advantage of the observation that many java applications create large objects, of which only a small portion is actually used. In addition, we also combine MCC and MCL, and present MCCL (Mark-Compact-Compress-Lazy Al-locate), which outperforms both MCC and *** have implemented these collectors using KVM, and performed extensive experiments using a set of ten embedded java applications. We have found our new garbage collection strategies to be useful in two main aspects. First, they reduce the minimum heap size necessary to execute an application without out-of-memory exception. Second, our strategies reduce the heap occupancy. That is, at a given time, they reduce the heap memory requirement of the application being executed. We have also conducted expe

关键词： heap memory compression java virtual machine garbage collection

来源：评论

学校读者我要写书评

暂无评论

JVM Characterization Framework for Workload Generated as per machine Learning Benckmark and Spark Framework

JVM Characterization Framework for Workload Generated as per...

引用

IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology

作者： Saravan Chidambaram Sujoy Saraswati Ranganath Ramachandra Jayashree B Huttanagoudar Hema N Roopalakshmi R Hewlett Packard (India) Software Operation Private Ltd Bangalore - 560048 India M. Tech IV sem student Department of CSE RV College of Engineering Bangalore India M. Tech IV sem student Department of CSE MSR Institute of Technology Bangalore India Associate Professor Department of CSE RV College of Engineering Bangalore India

ISBN: (纸本)9781509007752

Today there are plenty of frameworks to assist the development of Big-data applications. Computation and Storage are two major activities in these applications. Spark framework has replaced Map-Reduce in Hadoop, which is the preferred analytics engine for Big-data applications. java virtual machine (JVM) is used as execution platform irrespective of which framework is used for development. In the production environment it is essential to monitor the health of application to gain better performance. The parameters like memory usage, CPU utilization and frequency of Garbage Collection etc., will help to decide on the health of application. In this paper a framework is proposed to characterize the JVM behavior to monitor the health of application. Workload generated by running machine Learning algorithms available in Spark Benchmark Suite.

关键词： Big-Data java virtual machine Apache Spark machine Learnig In-Memory Analytics

来源：评论

学校读者我要写书评

暂无评论

Dynamic Linking on a Shared-Memory Multiprocessor 99

Dynamic Linking on a Shared-Memory Multiprocessor

引用

Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques

作者： Bowen Alpern Mark Charney Jong-Deok Choi Anthony Cocchi Derek Lieber

ISBN: (纸本)9780769504254

This paper presents a technique for backpatching instructions in an SMP environment. This technique is used by the Jalapeno virtual machine to support dynamic class loading in java. There is a small runtime overhead the first time a backpatch site is executed. Thereafter, it executes at the same speed as equivalent sites not requiring back-patching.

关键词： java virtual machine dynamic linking PowerPC architecture relaxed memory consistency backpatching idempotent code

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：