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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是201-210 订阅

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

详细简洁

排序：

High-level Programming of Embedded Hard Real-Time Devices 10

High-level Programming of Embedded Hard Real-Time Devices

引用

5th ACM European Conference on Computer Systems (EuroSys 2010)

作者： Pizlo, Filip Ziarek, Lukasz Blanton, Ethan Maj, Petr Vitek, Jan Fiji Systems Inc. Indianapolis IN USA Purdue University West Lafayette IN USA

ISBN: (纸本)9781605585772

While managed languages such as C# and java have become quite popular in enterprise computing, they are still considered unsuitable for hard real-time systems. In particular, the presence of garbage collection has been a sore point for their acceptance for low-level system programming tasks. Real-time extensions to these languages have the dubious distinction of, at the same time, eschewing the benefits of high-level programming and failing to offer competitive performance. The goal of our research is to explore the limitations of high-level managed languages for real-time systems programming. To this end we target a real-world embedded platform, the LEON3 architecture running the RTEMS real-time operating system, and demonstrate the feasibility of writing garbage collected code in critical parts of embedded systems. We show that java with a concurrent, real-time garbage collector, can have throughput close to that of C programs and comes within 10% in the worst observed case on realistic benchmark. We provide a detailed breakdown of the costs of java features and their execution times and compare to real-time and throughput-optimized commercial java virtual machines.

关键词： Real-time systems java virtual machine Memory management

来源：评论

学校读者我要写书评

暂无评论

Laminar: Practical Fine-Grained Decentralized Information Flow Control 09

Laminar: Practical Fine-Grained Decentralized Information Fl...

引用

ACM SIGPLAN Conference on Programming Language Design and Implementation

作者： Roy, Indrajit Porter, Donald E. Bond, Michael D. McKinley, Kathryn S. Witchel, Emmett Univ Texas Austin Dept Comp Sci Austin TX 78712 USA

ISBN: (纸本)9781605583921

Decentralized information flow control (DIFC) is a promising model for writing programs with powerful, end-to-end security guarantees. Current DIFC systems that run on commodity hardware can be broadly categorized into two types: language-level and operating system-level DIFC. Language level solutions provide no guarantees against security violations on system resources, like files and sockets. Operating system solutions can mediate accesses to system resources, but are inefficient at monitoring the flow of information through fine-grained program data structures. This paper describes Laminar, the first system to implement decentralized information flow control using a single set of abstractions for OS resources and heap-allocated objects. Programmers express security policies by labeling data with secrecy and integrity labels, and then access the labeled data in lexically scoped security regions. Laminar enforces the security policies specified by the labels at runtime. Laminar is implemented using a modified java virtual machine and a new Linux security module. This paper shows that security regions ease incremental deployment and limit dynamic security checks, allowing us to retrofit DIFC policies on four application case studies. Replacing the applications' ad-hoe security policies changes less than 10% of the code, and incurs performance overheads from 1% to 56%. Whereas prior DIFC systems only support limited types of multithreaded programs, Laminar supports a more general class of multithreaded DIFC programs that can access heterogeneously labeled data.

关键词： Information flow control java virtual machine operating systems security region

来源：评论

学校读者我要写书评

暂无评论

Analyzing the Vectorization Capability of the java Vector API 12

Analyzing the Vectorization Capability of the Java Vector AP...

引用

12th International Symposium on Computing and Networking Workshops

作者： Rosa, Andrea Basso, Matteo Binder, Walter Univ Svizzera Italiana USI Lugano Switzerland

ISBN: (纸本)9798331505356;9798331505349

The java Vector API (JVA) is a novel feature of the java virtual machine (JVM), allowing developers to express vector computations that are automatically translated to vector hardware instructions at runtime. This paper focuses on the vectorization capability of the API, which has not been studied by the literature yet. We investigate how effective the JVA is in automatically vectorizing scalar instructions, comparing it with the auto-vectorization capability of the HotSpot C2 compiler. Our results show that using the JVA results in much fewer (i.e., 79.62% on average on processors supporting AVX-512) instructions executed than using C2 auto-vectorization for carrying out the same work.

关键词： java Vector API vectorization SIMD dynamic analysis java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Transparent and Lightweight Object Placement for Managed Workloads atop Hybrid Memories 2022

Transparent and Lightweight Object Placement for Managed Wor...

引用

18th ACM SIGPLAN/SIGOPS International Conference on virtual Execution Environments (VEE)

作者： Li, Zhe Wu, Mingyu Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Engn Res Ctr Domainspecif Operating Syst Minist Educ Shanghai Peoples R China Shanghai Jiao Tong Univ Engn Res Ctr Domain specif Operating Syst Inst Parallel & Distributed Syst Minist EducShanghai Artificial Intelligence Lab Shanghai Peoples R China

ISBN: (纸本)9781450392518

Managed workloads show strong demand for large memory capacity, which can be satisfied by a hybrid memory sub-system composed of traditional DRAM and the emerging non-volatile memory (NVM) technology. Nevertheless, NVM devices are limited by deficiencies like write endurance and asymmetric bandwidth, which threatens managed applications' performance and reliability. Prior work has proposed different object placement mechanisms to mitigate problems introduced by NVM, but they require domain-specific knowledge on applications or significant change on managed runtime. By analyzing the performance of representative data-intensive workloads atop NVM, this paper finds that reducing write operations is key for performance and wear-leveling. To this end, this paper proposes GCMove, a transparent and efficient object placement mechanism for hybrid memories. GCMove embraces a lightweight write barrier for write detection and relies on garbage collections (GC) to copy objects into different devices according to their write-related behaviors. Compared with prior work, GCMove does not require significant changes in heap layout and thus can be easily integrated with mainstream copy-based garbage collection. The evaluation on various managed workloads shows that GCMove can eliminate 99.8% ofNVMwrite operations on average and improve the performance by up to 19.81x compared with the NVM-only version.

关键词： Non-Volatile Memory java virtual machine Garbage Collection

来源：评论

学校读者我要写书评

暂无评论

Optimizing Memory Access with Fast Address Computation on a MIPS Architecture 9

Optimizing Memory Access with Fast Address Computation on a ...

引用

9th IEEE International Conference on Networking, Architecture, and Storage (NAS)

作者： Ao, Qi Jin, Guojie Su, Wen Cai, Songsong Chen, Shuai Chinese Acad Sci Inst Comp Technol State Key Lab Comp Architecture Beijing 100190 Peoples R China Chinese Acad Sci Inst Comp Technol Beijing 100190 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China Loongson Technol Corp Ltd Beijing 100190 Peoples R China Petrochina Oil & Gas Pipeline Control Ctr Beijing 100007 Peoples R China

ISBN: (纸本)9781479940875

A 64-bit RISC processor is designed for large applications that need large memory address. Due to the restriction of the instruction fixed length, loading a 64-bit address needs a number of instructions, leading to a penalty both of memory performance and memory consumption. This paper describes an address computation method based on hardware and software co-design. In our extended MIPS processor which supports register + register addressing, we achieve an approximate effect of memory access as their 32-bit counterparts;we propose a software load-address method, which simplifies the calculation of 64-bit address. We implement our methods in the 64-bit OpenJDK 6 on MIPS, and give both performance and consumption comparisons for SPECjvm2008 and Dacapo. The experimental results show that the performance of SPECjvm2008 is improved by 5.1%, the performance of Dacapo is improved by 7.3% and near to 24% for some benchmarks. The size of method generated by JVM compiler is reduced by an average of 13%.

关键词： load address java virtual machine memory access dynamic compilation

来源：评论

学校读者我要写书评

暂无评论

Rethinking java Call Stack Design for Tiny Embedded Devices 12

Rethinking Java Call Stack Design for Tiny Embedded Devices

引用

13th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, Tools and Theory for Embedded Systems

作者： Aslam, Faisal Baig, Ghufran Qureshi, Mubashir Adnan Uzmi, Zartash Afzal Fennell, Luminous Thiemann, Peter Schindelhauer, Christian Haussmann, Elmar Punjab Univ Coll Informat Technol Lahore Pakistan Lahore Univ Management Sci DHA Lahore 54792 Pakistan Univ Freiburg D-79110 Freiburg Germany

ISBN: (纸本)9781450312127

The ability of tiny embedded devices to run large feature-rich programs is typically constrained by the amount of memory installed on such devices. Furthermore, the useful operation of these devices in wireless sensor applications is limited by their battery life. This paper presents a call stack redesign targeted at an efficient use of RAM storage and CPU cycles by a java program running on a wireless sensor mote. Without compromising the application programs, our call stack redesign saves 30% of RAM, on average, evaluated over a large number of benchmarks. On the same set of benchmarks, our design also avoids frequent RAM allocations and deallocations, resulting in average 80% fewer memory operations and 23% faster program execution. These may be critical improvements for tiny embedded devices that are equipped with small amount of RAM and limited battery life. However, our call stack redesign is equally effective for any complex multi-threaded object oriented program developed for desktop computers. We describe the redesign, measure its performance and report the resulting savings in RAM and execution time for a wide variety of programs.

关键词： Algorithms Design Experimentation Performance Wireless Sensor Networks Call Stack Memory Management JVM java virtual machine TakaTuka

来源：评论

学校读者我要写书评

暂无评论

Charon: Specialized Near-Memory Processing Architecture for Clearing Dead Objects in Memory 52

Charon: Specialized Near-Memory Processing Architecture for ...

引用

52nd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： Jang, Jaeyoung Heo, Jun Lee, Yejin Won, Jaeyeon Kim, Seonghak Jung, Sung Jun Hakbeom, Jang Ham, Tae Jun Lee, Jae Woo Sungkyunkwan Univ Suwon South Korea Seoul Natl Univ Seoul South Korea

ISBN: (纸本)9781450369381

Garbage collection (GC) is a standard feature for high productivity programming, saving a programmer from many nasty memory-related bugs. However, these productivity benefits come with a cost in terms of application throughput, worst-case latency, and energy consumption. Since the first introduction of GC by the Lisp programming language in the 1950s, a myriad of hardware and software techniques have been proposed to reduce this cost. While the idea of accelerating GC in hardware is appealing, its impact has been very limited due to narrow coverage, lack of flexibility, intrusive system changes, and significant hardware cost. Even with specialized hardware GC performance is eventually limited by memory bandwidth bottleneck. Fortunately, emerging 3D stacked DRAM technologies shed new light on this decades-old problem by enabling efficient near-memory processing with ample memory bandwidth. Thus, we propose Charon(1), the first 3D stacked memory-based GC accelerator. Through a detailed performance analysis of HotSpot JVM, we derive a set of key algorithmic primitives based on their GC time coverage and implementation complexity in hardware. Then we devise a specialized processing unit to substantially improve their memory-level parallelism and throughput with a low hardware cost. Our evaluation of Charon with the full-production HotSpot JVM running two big data analytics frameworks, Spark and GraphChi, demonstrates a 3.29x geomean speedup and 60.7% energy savings for GC over the baseline 8-core out-of-order processor.

关键词： Garbage collection Near-memory processing Domain-specific architecture Memory management java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Performance Modeling of Maximal Sharing 16

Performance Modeling of Maximal Sharing

引用

7th ACM/SPEC International Conference on Performance Engineering (ICPE)

作者： Steindorfer, Michael J. Vinju, Jurgen J. Ctr Wiskunde & Informat Sci Pk 123 NL-1098 XG Amsterdam Netherlands

ISBN: (纸本)9781450340809

It is noticeably hard to predict the effect of optimization strategies in java without implementing them. "Maximal sharing" (a.k.a. "hash-consing") is one of these strategies that may have great bene fit in terms of time and space, or may have detrimental overhead. It all depends on the redundancy of data and the use of equality. We used a combination of new techniques to predict the impact of maximal sharing on existing code: Object Redundancy Profiling (ORP) to model the effect on memory when sharing all immutable objects, and Equals-Call Profiling (ECP) to reason about how removing redundancy impacts runtime performance. With comparatively low effort, using the MAximal SHaring Oracle (MASHO), a prototype profiler based on ORP and ECP, we can uncover optimization opportunities that otherwise would remain hidden. This is an experience report on applying MASHO to real and complex case: we conclude that ORP and ECP combined can accurately predict gains and losses of maximal sharing, and also that (by isolating variables) a cheap predictive model can sometimes provide more accurate information than an expensive experiment can.

关键词： Performance modeling maximal sharing hash-consing profiling memory optimization java virtual machine

来源：评论

学校读者我要写书评

暂无评论

Exploiting Multi-Core Processors to Improve Time Predictability for Real-time java Computing

Exploiting Multi-Core Processors to Improve Time Predictabil...

引用

15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

作者： Sun, Yu Zhang, Wei So Illinois Univ Dept Elect & Comp Engn Carbondale IL 62901 USA

ISBN: (纸本)9780769537870

As a successful programming language, java has extended its application from general-purpose systems to embedded, real-time systems. However, some of java's excellent features, like automatic memory management and dynamic compilation, bring indeterminism to the execution time of real-time java programs. In this paper, we propose several multi-core approaches to remove or at least reduce the unpredictability inside of java virtual machine (JVM). Our goal is to retain high performance competitive to dynamic compilation and, at the same time, obtain better time predictability for JVM. Also, we study pre-compilation techniques to utilize second core more efficiently. Furthermore, we develop Pre-optimization on Another Core (PoAC) scheme to replace the Adaptive Optimization System (AOS) in jikes JVM, which is very sensitive to execution time variation and impacts time predictability greatly. The experimental results indicate that our approaches are able to reach high performance while greatly reduce execution time variation of java applications.

关键词： Time predictability java virtual machine multicore processors adaptive optimizations

来源：评论

学校读者我要写书评

暂无评论

Reflexes: Abstractions for Highly Responsive Systems 07

Reflexes: Abstractions for Highly Responsive Systems

引用

3rd International Conference on virtual Execution Environments

作者： Spring, Jesper Honig Pizo, Filip Guerraoui, Rachid Vitek, Jan Ecole Polytech Fed Lausanne CH-1015 Lausanne Switzerland

ISBN: (纸本)9781595936301

Commercial java virtual machines are designed to maximize the performance of applications at the expense of predictability. High throughput garbage collection algorithms, for example, can introduce pauses of 100 milliseconds or more. We are interested in supporting applications with response times in the tens of microseconds and their integration with larger timing-oblivious applications in the same java virtual machine. We propose Reflexes, a new abstraction for writing highly responsive systems in java and investigate the virtual machine support needed to add Reflexes to a java environment. Our implementation of Reflexes was evaluated on several programs including an audio-processing application. We were able to run a Reflex at 22.05KHz with less than 0.2% missed deadlines over 10 million observations, a result that compares favorably to an implementation written in C.

关键词： Real-time systems java virtual machine Memory management Ownership types

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共28页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：