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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

138 篇 会议
125 篇 期刊文献
10 篇 学位论文
1 篇 资讯

馆藏范围

274 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

242 篇 工学
- 185 篇 计算机科学与技术...
- 138 篇 软件工程
- 43 篇 电气工程
- 21 篇 信息与通信工程
- 5 篇 电子科学与技术（可...
- 5 篇 控制科学与工程
- 3 篇 化学工程与技术
- 3 篇 生物工程
- 3 篇 网络空间安全
- 1 篇 力学（可授工学、理...
- 1 篇 仪器科学与技术
- 1 篇 土木工程
- 1 篇 测绘科学与技术
- 1 篇 公安技术
15 篇 理学
- 5 篇 化学
- 4 篇 数学
- 3 篇 生物学
- 2 篇 物理学
- 2 篇 大气科学
5 篇 医学
- 2 篇 临床医学
- 1 篇 特种医学
- 1 篇 医学技术（可授医学...
5 篇 管理学
- 5 篇 管理科学与工程(可...
1 篇 教育学
- 1 篇 教育学

主题

274 篇 java virtual mac...
30 篇 java
24 篇 garbage collecti...
22 篇 performance
22 篇 languages
18 篇 memory managemen...
12 篇 experimentation
12 篇 profiling
11 篇 embedded systems
11 篇 just-in-time com...
11 篇 bytecode instrum...
10 篇 real-time system...
10 篇 object-oriented ...
8 篇 algorithms
6 篇 bytecode
6 篇 java processor
6 篇 dynamic memory m...
6 篇 optimization
6 篇 ownership types
6 篇 performance anal...

机构

7 篇 univ svizzera it...
6 篇 purdue univ dept...
5 篇 seoul natl univ ...
5 篇 univ lugano fac ...
4 篇 ecole polytech f...
4 篇 univ regina dept...
4 篇 brno university ...
3 篇 univ lugano luga...
3 篇 seoul natl univ
3 篇 seoul natl univ ...
3 篇 shanghai jiao to...
3 篇 tianjin univ col...
3 篇 ecole polytech f...
3 篇 univ victoria de...
3 篇 coll william & m...
2 篇 tu eindhoven ein...
2 篇 natl res univ hi...
2 篇 univ texas dept ...
2 篇 univ calif irvin...
2 篇 shanghai ai lab ...

作者

28 篇 binder walter
15 篇 rosa andrea
10 篇 ansaloni danilo
10 篇 moret philippe
9 篇 moon soo-mook
9 篇 villazon alex
8 篇 rosales eduardo
8 篇 vitek jan
7 篇 wu mingyu
6 篇 guerraoui rachid
5 篇 chen haibo
5 篇 basso matteo
4 篇 lo ctd
4 篇 franz michael
4 篇 lee jaemok
4 篇 zang binyu
4 篇 spring jesper ho...
4 篇 srisa-an w
4 篇 zhang wei
3 篇 zheng yudi

语言

251 篇 英文
22 篇 其他
1 篇 中文

检索条件"主题词=Java virtual machine"

共 274 条记录，以下是131-140 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

java client ahead-of-time compiler for embedded systems 07

Java client ahead-of-time compiler for embedded systems

引用

Conference on Languages, Compilers and Tools for Embedded Systems

作者： Hong, Sunghyun Kim, Jin-Chul Shin, Jin Woo Moon, Soo-Mook Oh, Hyeong-Seok Lee, Jaemok Choi, Hyung-Kyu Seoul Natl Univ Sch Elect Engn & Comp Sci Seoul 151742 South Korea

ISBN: (纸本)9781595936325

The performance of embedded java virtual machine can be improved by ahead-of-time compiler ( AOTC), which translates bytecode into machine code in the server and installs the machine code on the client device. Although AOTC is more advantageous than just-in-time compiler (JITC) due to its absence of the translation overhead, AOTC cannot be applicable to dynamically downloaded classes at runtime. This paper proposes client-AOTC (c-AOTC) which performs AOTC on the client device using the JITC module installed on the device, complementing the server-AOTC. The machine code of a method translated by JITC is cached on a persistent memory of the device, and when the method is invoked again in a later run of the program, the machine code is loaded and executed directly without the translation and interpretation overhead. One of major issues in c-AOTC is relocation because some of the addresses used by the cached machine code are not correct when the machine code is loaded and used in a different run;those addresses should be corrected before they are used. Constant pool resolution and inlining complicate the relocation problem and we propose our solutions. We developed a c-AOTC on Sun's CDC VM reference implementation ( RI) and our evaluation results indicate that cAOTC can improve the performance significantly, as much as an average of 12%. We also experiment with the issue of reducing the number of c-AOTC methods to be cached when the persistent space is tight, with a graceful degradation of performance.

关键词： java ahead-of-time compiler just-in-time compiler relocation early binding java virtual machine J2ME CDC performance experimentation languages

来源：评论

学校读者我要写书评

暂无评论

Analyzing and Optimizing Task Granularity on the JVM 2018

Analyzing and Optimizing Task Granularity on the JVM

引用

16th International Symposium on Code Generation and Optimization (CGO)

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

ISBN: (纸本)9781450356176

Task granularity, i.e., the amount of work performed by parallel tasks, is a key performance attribute of parallel applications. On the one hand, fine-grained tasks (i.e., small tasks carrying out few computations) may introduce considerable parallelization overheads. On the other hand, coarse-grained tasks (i.e., large tasks performing substantial computations) may not fully utilize the available CPU cores, resulting in missed parallelization opportunities. In this paper, we provide a better understanding of task granularity for applications running on a java virtual machine. We present a novel profiler which measures the granularity of every executed task. Our profiler collects carefully selected metrics from the whole system stack with only little overhead, and helps the developer locate performance problems. We analyze task granularity in the DaCapo and ScalaBench benchmark suites, revealing several inefficiencies related to fine-grained and coarse-grained tasks. We demonstrate that the collected task-granularity profiles are actionable by optimizing task granularity in two benchmarks, achieving speedups up to 1.53x.

关键词： task granularity performance analysis parallel applications actionable profiler java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Enhanced hot spot detection heuristics for embedded java just-in-time compilers 08

Enhanced hot spot detection heuristics for embedded java jus...

引用

Conference on Languages, Compilers and Tools for Embedded Systems

作者： Lee, Seong-Won Moon, Soo-Mook Kim, Seong-Moo Seoul Natl Univ Sch Elect Engn Seoul 151 South Korea

ISBN: (纸本)9781605581040

Most java just-in-time compilers (JITC) try to compile only hot methods since the compilation overhead is part of the running time. This requires precise and efficient hot spot detection, which includes distinguishing hot methods from cold methods, detecting them as early as possible, and paying a small runtime overhead for detection. A hot method could be identified by measuring its running time during interpretation since a long-running method is likely to be a hot method. However, precise measurement of the running time during execution is too expensive, especially in embedded systems, so many counter-based heuristics have been proposed to estimate it. The Simple heuristic counts only method invocations without any consideration of loops [1], while Sun's HotSpot heuristic counts loop iterations as well, but does not consider loop sizes or method sizes [2,14]. The static analysis heuristic estimates the running time of a method by statically analyzing loops or heavy-cost bytecodes but does not measure their dynamic counts [3]. Although the overhead of these heuristics is low, they do not estimate the running time precisely, which may lead to imprecise hot spot detection. This paper proposes a new hot spot detection heuristic which can estimate the running time more precisely than others with a relatively low overhead. It dynamically counts only important bytecodes interpreted, but with a simple arithmetic calculation it can obtain the precise count of all interpreted bytecodes. We also propose employing a static analysis technique to predict those hot methods which spend a huge execution time once invoked. This static prediction can allow compiling these methods at their first-invocation, complementing the proposed dynamic estimation technique. We implemented both, which led to a performance benefit of 10% compared to the HotSpot heuristic.

关键词： performance experimentation languages java just-in-time compilation hot spot detection Sun's HotSpot heuristic java virtual machine J2ME CDC

来源：评论

学校读者我要写书评

暂无评论

Espresso: Brewing java For More Non-Volatility with Non-volatile Memory 18

Espresso: Brewing Java For More Non-Volatility with Non-vola...

引用

23rd International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)

作者： Wu, Mingyu Zhao, Ziming Li, Haoyu Li, Heting Chen, Haibo Zang, Binyu Guan, Haibing Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Shanghai Key Lab Scalable Comp & Syst Shanghai Peoples R China

ISBN: (纸本)9781450349116

Fast, byte-addressable non-volatilememory (NVM) embraces both near-DRAM latency and disk-like persistence, which has generated considerable interests to revolutionize system software stack and programming models. However, it is less understood how NVM can be combined with managed run-time like java virtual machine (JVM) to ease persistence management. This paper proposes Espresso(1), a holistic extension to java and its runtime, to enable java programmers to exploit NVM for persistence management with high performance. Espresso first provides a general persistent heap design called Persistent java Heap (PJH) to manage persistent data as normal java objects. The heap is then strengthened with a recoverable mechanism to provide crash consistency for heap metadata. Espresso further provides a new abstraction called Persistent java Object (PJO) to provide an easy-to-use but safe persistence programming model for programmers to persist application data. Evaluation confirms that Espresso significantly outperforms state-of-art NVM support for java (i.e., JPA and PCJ) while being compatible to data structures in existing java programs.

关键词： Non-Volatile Memory Crash Consistency java virtual machine

来源：评论

学校读者我要写书评

暂无评论

StreamFlex: High-throughput stream programming in java 07

StreamFlex: High-throughput stream programming in Java

引用

22nd International Conference on Object-Oriented Programming, Systems, Languages and Applications

作者： Spring, Jesper H. Privat, Jean Guerraoui, Rachid Vitek, Jan Ecole Polytech Fed Lausanne Lausanne Switzerland Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA IBM Corp San Jose CA 95114 USA

ISBN: (纸本)9781595937865

The stream programming paradigm aims to expose coarse-grained parallelism in applications that must process continuous sequences of events. The appeal of stream programming comes from its conceptual simplicity. A program is a collection of independent filters which communicate by the means of uni-directional data channels. This model lends itself naturally to concurrent and efficient implementations on modern multiprocessors. As the output behavior of filters is determined by the state of their input channels, stream programs have fewer opportunities for the errors (such as data races and deadlocks) that plague shared memory concurrent programming. This paper introduces STREAMFLEX, an extension to java which marries streams with objects and thus enables to combine, in the same java virtual machine, stream processing code with traditional object-oriented components. STREAMFLEX targets high-throughput low-latency applications with stringent quality-of-service requirements. To achieve these goals, it must, at the same time, extend and restrict java. To allow for program optimization and provide latency guarantees, the STREAMFLEX compiler restricts java by imposing a stricter typing discipline on filters. On the other hand, STREAMFLEX extends the java virtual machine with real-time capabilities, transactional memory and type-safe region-based allocation. The result is a rich and expressive language that can be implemented efficiently.

关键词： languages experimentation. real-time systems java virtual machine memory management ownership types stream processing

来源：评论

学校读者我要写书评

暂无评论

Heap compression for memory-constrained java environments

Heap compression for memory-constrained Java environments

引用

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

作者： Chen, G Kandemir, M Vijaykrishnan, N Irwin, MJ Mathiske, B Wolczko, M Penn State Univ CSE Dept University Pk PA 16802 USA Sun Microsyst Inc Santa Clara CA 95054 USA Sun Microsyst Inc Mountain View CA 94043 USA

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 control. The 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 Allocate), which outperforms both MCC and MCL. We 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 exp

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

来源：评论

学校读者我要写书评

暂无评论

ILJc: Porting *** IL (intermediate language) to java

ILJc: Porting *** IL (intermediate language) to Java

引用

International Conference on Industrial and Information Systems

作者： Siddique, S. Sheriff, S. D. Wijesuriya, H. Wickramaratne, C. Makalanda, J. IT Depratment Sri Lanka Institute of Information Technology Sri Lanka

ISBN: (纸本)9781424403219

ILJc (Intermediate Language to java compiler) would map IL (Intermediate Language) of the *** framework to java based applications. ILJc would be the middle-base in compiling and translating the IL code which ports out of Microsoft Visual *** into the equivalent java byte code. Thus, ILJc would simply transform Visual *** into relative java applications. ILJc does its best to map *** entities to java equivalents, furthermore ILJc must deal with the exceptions too. For an instance, in the case of exceptions, java provides one exception class, but *** provides three;ILJc is forced to map all three *** exceptions to the single java exception. The task is no easy to fix, but simply have to write around this many-to-one mapping. Although all *** exceptions are derived from the *** class, not all java exceptions are derived from ***;some generated by the JVM (java virtual machine) are derived from the *** class. This incongruence shows up in *** code that tries to catch all exceptions, when translated into java, exceptions derived from *** is taken for granted and slip off. As a proof of concept of how that system could be, we started sometime ago to implement ILJc, featuring a modular, flexible architecture. In this paper we show its structure, how it can be used, and how it can be further extended.

关键词： java exception handling network operating systems program compilers visual languages java based application java compiler java virtual machine Microsoft Visual *** intermediate language exception handling Intermediate Language java compiler java virtual machine (JVM) compilers Network operating systems visual languages EXCEPTIONS

来源：评论

学校读者我要写书评

暂无评论

History-Driven Test Program Synthesis for JVM Testing 22

History-Driven Test Program Synthesis for JVM Testing

引用

ACM/IEEE 44th International Conference on Software Engineering (ICSE)

作者： Zhao, Yingquan Wang, Zan Chen, Junjie Liu, Mengdi Wu, Mingyuan Zhang, Yuqun Zhang, Lingming Tianjin Univ Coll Intelligence & Comp Tianjin Peoples R China Southern Univ Sci & Technol Shenzhen Peoples R China Univ Illinois Urbana IL USA

ISBN: (纸本)9781450392211

java virtual machine (JVM) provides the runtime environment for java programs, which allows java to be "write once, run anywhere". JVM plays a decisive role in the correctness of all java programs running on it. Therefore, ensuring the correctness and robustness of JVM implementations is essential for java programs. To date, various techniques have been proposed to expose JVM bugs via generating potential bug-revealing test programs. However, the diversity and effectiveness of test programs generated by existing research are far from enough since they mainly focus on minor syntactic/semantic mutations. In this paper, we propose javaTailor, the first history-driven test program synthesis technique, which synthesizes diverse test programs by weaving the ingredients extracted from JVM historical bug-revealing test programs into seed programs for covering more JVM behaviors/paths. More specifically, javaTailor first extracts five types of code ingredients from the historical bug-revealing test programs. Then, to synthesize diverse test programs, it iteratively inserts the extracted ingredients into the seed programs and strengthens their interactions via introducing extra data dependencies between them. Finally, javaTailor employs these synthesized test programs to differentially test JVMs. Our experimental results on popular JVM implementations (i.e., HotSpot and OpenJ9) show that javaTailor outperforms the state-of-the-art technique in generating more diverse and effective test programs, e.g., test programs generated by javaTailor can achieve higher JVM code coverage and detect many more unique inconsistencies than the state-of-the-art technique. Furthermore, javaTailor has detected 10 previously unknown bugs, 6 of which have been confirmed/fixed by developers.

关键词： java virtual machine Program Synthesis JVM Testing Compiler Testing

来源：评论

学校读者我要写书评

暂无评论

A java Software Stack for Resource Poor Sensor Nodes Towards Peer-to-Peer Jini

A Java Software Stack for Resource Poor Sensor Nodes Towards...

引用

4th International Conference on Embedded and Multimedia Computing

作者： Costa, Nuno Pereira, Antonio Serodio, Carlos Polytech Inst Leiria CIIC Super Sch Technol & Management P-2411901 Alto Do Vieiro Leiria Portugal CITAB UTAD University Quinta dos Prados P-5000 Vila Real Portugal

ISBN: (纸本)9781424449965

Sensor networks have been referred to as part of the background infrastructure required to achieve ubiquitous computing. This has recently promoted a considerable amount of attention from the research community that concluded that existing protocols and techniques for service discovery, such as JINI or UPnP are not suitable for the case of resource poor, battery-powered sensor nodes. We do not really agree with this approach. We think that those protocols could be a good starting point to "power-up" sensor nodes with poor resources for ubiquitous computing support. Starting from this principle and recognizing that existing sensor node system software is not suitable for our purpose, we decided to build a new sensor node software stack. The result was a stand-alone java virtual machine, suitable for sensor nodes with poor resources, an implementation of the ubiquitous TCP/IP communication stack and Jini based middleware to achieve automatic service discover and usage. This software stack was tailored to perfectly fit in the state-of-the-art Mica2 class of sensor nodes.

关键词： Ubiquitous Computing Sensor Networks System Software Software Stack Operating System java virtual machine

来源：评论

学校读者我要写书评

暂无评论

An Input-Centric Paradigm for Program Dynamic Optimizations 10

An Input-Centric Paradigm for Program Dynamic Optimizations

引用

Conference on Object Oriented Programming Systems, Languages and Applications/SPLASH 2010

作者： Tian, Kai Jiang, Yunlian Zhang, Eddy Z. Shen, Xipeng Coll William & Mary Dept Comp Sci Williamsburg VA 23185 USA

ISBN: (纸本)9781450302036

Accurately predicting program behaviors (e. g., locality, dependency, method calling frequency) is fundamental for program optimizations and runtime adaptations. Despite decades of remarkable progress, prior studies have not systematically exploited program inputs, a deciding factor for program behaviors. Triggered by the strong and predictive correlations between program inputs and behaviors that recent studies have uncovered, this work proposes to include program inputs into the focus of program behavior analysis, cultivating a new paradigm named input-centric program behavior analysis. This new approach consists of three components, forming a three-layer pyramid. At the base is program input characterization, a component for resolving the complexity in program raw inputs and the extraction of important features. In the middle is input-behavior modeling, a component for recognizing and modeling the correlations between characterized input features and program behaviors. These two components constitute input-centric program behavior analysis, which (ideally) is able to predict the large-scope behaviors of a program's execution as soon as the execution starts. The top layer of the pyramid is input-centric adaptation, which capitalizes on the novel opportunities that the first two components create to facilitate proactive adaptation for program optimizations. By centering on program inputs, the new approach resolves a proactivity-adaptivity dilemma inherent in previous techniques. Its benefits are demonstrated through proactive dynamic optimizations and version selection, yielding significant performance improvement on a set of java and C programs.

关键词： Languages Performance Program inputs Dynamic optimizations java virtual machine Proactivity Seminal behaviors Dynamic version selection Just-In-Time compilation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共28页 << < 10 11 12 13 14 15 16 17 18 19 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：