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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
124 篇 期刊文献
10 篇 学位论文
1 篇 资讯

馆藏范围

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

日期分布

学科分类号

241 篇 工学
- 185 篇 计算机科学与技术...
- 137 篇 软件工程
- 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 篇 教育学

主题

273 篇 java virtual mac...
29 篇 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...
9 篇 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 篇 英文
21 篇 其他
1 篇 中文

检索条件"主题词=Java Virtual Machine"

共 273 条记录，以下是181-190 订阅

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

详细简洁

排序：

Analysis and Optimizations of java Full Garbage Collection 18

Analysis and Optimizations of Java Full Garbage Collection

引用

9th Asia-Pacific Workshop on Systems (APSys)

作者： Li, Haoyu Wu, Mingyu Chen, Haibo Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Shanghai Peoples R China

ISBN: (纸本)9781450360067

java runtime frees applications from manual memory management by its automatic garbage collection (GC), at the cost of stop-the-world pauses. State-of-the-art collectors leverage multiple generations, which will inevitably suffer from a full GC phase scanning the whole heap and induce a pause tens of times longer than normal collections, which largely affects both throughput and latency of the entire system. In this paper, we analyze the full GC performance of HotSpot Parallel Scavenge garbage collector comprehensively and study its algorithm design in depth. We find out that heavy dependencies among heap regions cause poor thread utilization. Furthermore, many heap regions contain mostly live objects (referred to as dense regions), which are unnecessary to collect. To solve these problems, we introduce two kinds of optimizations: allocating shadow regions dynamically as compaction destination to eliminate region dependencies and skipping dense regions to reduce GC workload. Evaluation results show the optimizations lead to averagely 2.6X (up to 4.5X) improvement in full GC throughput and thereby boost the application performance by 18.2% on average (58.4% at best).

关键词： Full garbage collection java virtual machine Performance Parallel Scavenge Memory management

来源：评论

学校读者我要写书评

暂无评论

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

JVM Characterization Framework for Workload Generated as per...

引用

IEEE International Conference on Recent Trends in Electronics, Information and Communication Technology (RTEICT)

作者： Chidambaram, Saravan Saraswati, Sujoy Ramachandra, Ranganath Huttanagoudar, Jayashree B. Hema, N. Roopalakshmi, R. Hewlett Packard India Software Operat Private Bangalore 560048 Karnataka India RV Coll Engn Dept CSE Bangalore Karnataka India MSR Inst Technol Dept CSE Bangalore Karnataka India

ISBN: (纸本)9781509007745

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.

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

来源：评论

学校读者我要写书评

暂无评论

Random versus combinatorial effectiveness in software conformance testing: a case study 15

Random versus combinatorial effectiveness in software confor...

引用

30th ACM Symposium on Applied Computing (SAC)

作者： Calvagna, Andrea Fornaia, Andrea Tramontana, Emiliano Univ Catania Dipartimento Matemat & Informat I-95124 Catania Italy

ISBN: (纸本)9781450331968

Combinatorial interaction testing is widely rewarded as a powerful and cost-effective tool for generic debugging of large software implementations. However, its efficacy when applied to the specific task of testing a software for conformance to its specification has not yet been assessed, to the best of our knowledge. For this type of task, we show that the much easier and commonly used random testing approach is a less convenient choice with respect to applying a combinatorial based test suite of comparable size. We also performed a wider set of experiments and found that even much greater random testing efforts won't be able to trigger a comparably wide set of faults, with respect to the combinatorial based testing. The presented results are based on the case study of applying conformance testing to the verifier component of the java virtual machine. The framework for the combinatorial driven generation of the conformance test suite is also described. In the framework, the test cases are generated by model checking the considered specification, and using a combinatorial coverage criteria targeted to the specification constraints. Results obtained from both types of test suites application are presented and discussed, with their comparison showing the better efficacy of the combinatorial one, and empirically validating the underlying approach.

关键词： Software engineering combinatorial testing random testing formal modeling java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Flexible task graphs: A unified restricted thread programming model for java 08

Flexible task graphs: A unified restricted thread programmin...

引用

Conference on Languages, Compilers and Tools for Embedded Systems

作者： Auerbach, Joshua Bacon, David F. Guerraoui, Rachid Spring, Jesper Honig Vitek, Jan IBM Res Yorktown Hts NY 10598 USA Ecole Polytech Fed Lausanne CH-1015 Lausanne Switzerland Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

ISBN: (纸本)9781605581040

The disadvantages of unconstrained shared-memory multi-threading in java, especially with regard to latency and determinism in real-time systems, have given rise to a variety of language extensions that place restrictions on how threads allocate, share, and communicate memory, leading to order-of-magnitude reductions in latency and jitter. However, each model makes different trade-offs with respect to expressiveness, efficiency, enforcement, and latency, and no one model is best for all applications. In this paper we present Flexible Task Graphs (Flexotasks), a single system that allows different isolation policies and mechanisms to be combined in an orthogonal manner, subsuming four previously proposed models as well as making it possible to use new combinations best suited to the needs of particular applications. We evaluate our implementation on top of the IBM Web-Sphere Real Time java virtual machine using both a microbenchmark and a 30 KLOC avionics collision detector. We show that Flexotasks are capable of executing periodic threads at 10 KHz with a standard deviation of 1.2 mu s and that it achieves significantly better performance than RTSJ's scoped memory constructs while remaining impervious to interference from global garbage collection.

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

来源：评论

学校读者我要写书评

暂无评论

Decentralized information flow control on a bare-metal JVM 10

Decentralized information flow control on a bare-metal JVM

引用

6th Annual Cyber Security and Information Intelligence Research Workshop: Cyber Security and Information Intelligence Challenges and Strategies, CSIIRW10

作者： Manivannan, Karthikeyan Wimmer, Christian Franz, Michael Department of Computer Science University of California Irvine CA United States

ISBN: (纸本)9781450300179

A large array of privacy sensitive applications like banking servers, medical records processors, and legal software are java applications. Preserving user privacy is a necessary feature in such applications. For example, in a medical records system, only the authorized doctors and medical staff should be allowed access to patient information. Decentralized Information Flow Control (DIFC) [10] provides an effective means for preserving user privacy. In a traditional setup where the java virtual machine (JVM) runs on top of an Operating System (OS), sensitive information flows both through the JVM and the OS, and effective enforcement of information flow policies requires tracking data across both these entities [12]. Implementing information flow control in such systems requires modification, and subsequent auditing, of both the JVM and OS source code.

关键词： information flow control java virtual machine bare-metal JVM hypervisors

来源：评论

学校读者我要写书评

暂无评论

Advanced Runtime Adaptation for java 09

Advanced Runtime Adaptation for Java

引用

8th International Conference on Generative Programming and Component Engineering

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

ISBN: (纸本)9781605584942

Dynamic aspect-oriented programming (AOP) enables runtime adaptation of aspects, which is important for building sophisticated, aspect-based software engineering tools, such as adaptive profilers or debuggers that dynamically modify instrumentation code in response to user interactions. Today, many AOP frameworks for java, notably AspectJ, focus on aspect weaving at compile-time or at load-time, and offer only limited support for aspect adaptation and reweaving at runtime. In this paper, we introduce HotWave, an AOP framework based on AspectJ for standard java virtual machines (JVMs). HotWave supports dynamic (re) weaving of previously loaded classes, and it ensures that all classes loaded in a JVM can be (re) woven, including the classes of the standard java class library. HotWave features a novel mechanism for inter-advice communication, enabling efficient data passing between advices that are woven into the same method. We explain HotWave's programming model and discuss our implementation techniques. As case study, we present an adaptive, aspect-based profiler that leverages HotWave's distinguishing features.

关键词： Algorithms Languages Measurement Dynamic aspect-oriented programming runtime aspect adaptation and (re) weaving bytecode instrumentation code hotswapping AspectJ java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Profiling and Analysis of Object Lazy Allocation in java Programs 17

Profiling and Analysis of Object Lazy Allocation in Java Pro...

引用

17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)

作者： Shi, Jianjun Ji, Weixing Zhang, Lulu Gao, Yujin Zhang, Han Qing, Duzheng Beijing Inst Technol Sch Comp Sci Beijing Peoples R China Beijing Simulat Ctr Sci & Technol Special Syst Simulat Lab Beijing Peoples R China

ISBN: (纸本)9781509022397

Lazy allocation strategy allows the memory management system to defer the space allocation action of objects until they are being accessed. This paper investigates the potential benefits of a lazy allocator for java applications. A heap tracing tool is implemented by instrumenting an existing java virtual machine HotSpot, which records useful object manipulating events at runtime. By profiling and analyzing a large number of benchmarks, we show the potential dynamic memory management optimization opportunity in java programs. We also designed a simulation system to demonstrate the actual effects of a lazy allocator.

关键词： dynamic memory management lazy allocation java virtual machine object-oriented programming

来源：评论

学校读者我要写书评

暂无评论

Coverage-Directed Differential Testing of JVM Implementations 16

Coverage-Directed Differential Testing of JVM Implementation...

引用

37th ACM SIGPLAN Conference on Programming Language Design and Implementation

作者： Chen, Yuting Su, Ting Sun, Chengnian Su, Zhendong Zhao, Jianjun Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China East China Normal Univ Shanghai Key Lab Trustworthy Comp Shanghai Peoples R China Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Kyushu Univ Dept Adv Informat Technol Fukuoka 812 Japan

ISBN: (纸本)9781450342612

java virtual machine (JVM) is a core technology, whose reliability is critical. Testing JVM implementations requires painstaking effort in designing test classfiles (*. class) along with their test oracles. An alternative is to employ binary fuzzing to differentially test JVMs by blindly mutating seeding classfiles and then executing the resulting mutants on different JVM binaries for revealing inconsistent behaviors. However, this blind approach is not cost effective in practice because most of the mutants are invalid and redundant. This paper tackles this challenge by introducing classfuzz, a coverage-directed fuzzing approach that focuses on representative classfiles for differential testing of JVMs' startup processes. Our core insight is to (1) mutate seeding classfiles using a set of predefined mutation operators (mutators) and employ Markov Chain Monte Carlo (MCMC) sampling to guide mutator selection, and (2) execute the mutants on a reference JVM implementation and use coverage uniqueness as a discipline for accepting representative ones. The accepted classfiles are used as inputs to differentially test different JVM implementations and find defects. We have implemented classfuzz and conducted an extensive evaluation of it against existing fuzz testing algorithms. Our evaluation results show that classfuzz can enhance the ratio of discrepancy-triggering classfiles from 1: 7 % to 11: 9 %. We have also reported 62 JVM discrepancies, along with the test classfiles, to JVM developers. Many of our reported issues have already been confirmed as JVM defects, and some even match recent clarifications and changes to the java SE 8 edition of the JVM specification.

关键词： Differential testing fuzz testing java virtual machine MCMC sampling

来源：评论

学校读者我要写书评

暂无评论

Bridging the Gap between Low-level Network Traffic Data Acquisition and Higher-level Frameworks 38

Bridging the Gap between Low-level Network Traffic Data Acqu...

引用

38th Annual IEEE International Computer Software and Applications Conference (COMPSAC)

作者： Gad, Ruediger Kappes, Martin Medina-Bulo, Inmaculada Univ Appl Sci Frankfurt Main Frankfurt Germany Univ Cadiz Cadiz Spain

ISBN: (纸本)9781479935789

The combination of low-level network data acquisition and higher-level frameworks results in more powerful and efficient network analysis and surveillance systems and opens up new possibilities for leveraging low-level network traffic data. There is, however, a gap between low-level network traffic data acquisition techniques and higher-level frameworks. This gap complicates the integration of low-level tools into higher-level frameworks. In this paper, we exemplarily research the feasibility of bridging this gap. As example, we use the integration of low-level packet capturing with java-based higher-level implementations. To assess the practicability, we created a prototype implementation and performed extensive performance measurements. The results show that our java-based prototype is capable of capturing and processing network traffic in near real-time at Gigabit Ethernet speed on consumerclass commodity hardware.

关键词： Computer Networks Packet Capturing Performance java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Space-and-Time Efficient Garbage Collectors for Parallel Systems 09

Space-and-Time Efficient Garbage Collectors for Parallel Sys...

引用

6th ACM International Conference on Computing Frontiers and Workshops

作者： Liu, Shaoshan Wang, Ligang Li, Xiao-Feng Gaudiot, Jean-Luc Univ Calif Irvine Irvine CA 92717 USA

ISBN: (纸本)9781605584133

As multithreaded server applications and runtime systems prevail. garbage collection is becoming ail essential feature to support high performance systems. 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.

关键词： Garbage collection java virtual machine

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共28页 << < 15 16 17 18 19 20 21 22 23 24 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：