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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

171 篇 会议
69 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

98 篇 工学
- 74 篇 计算机科学与技术...
- 48 篇 软件工程
- 16 篇 信息与通信工程
- 11 篇 生物工程
- 9 篇 网络空间安全
- 8 篇 电气工程
- 7 篇 控制科学与工程
- 5 篇 机械工程
- 4 篇 动力工程及工程热...
- 4 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 2 篇 轻工技术与工程
- 2 篇 交通运输工程
- 2 篇 安全科学与工程
34 篇 理学
- 15 篇 生物学
- 13 篇 数学
- 5 篇 化学
- 3 篇 统计学（可授理学、...
- 2 篇 大气科学
- 2 篇 系统科学
- 1 篇 物理学
- 1 篇 天文学
30 篇 管理学
- 26 篇 管理科学与工程(可...
- 7 篇 工商管理
- 4 篇 图书情报与档案管...
6 篇 法学
- 5 篇 社会学
- 1 篇 法学
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学
- 2 篇 作物学
2 篇 医学
- 2 篇 基础医学(可授医学...

主题

30 篇 grid computing
25 篇 virtual machinin...
20 篇 peer to peer com...
19 篇 servers
16 篇 computers
15 篇 computer science
15 篇 cloud computing
14 篇 resource managem...
13 篇 bandwidth
12 篇 application soft...
12 篇 kernel
11 篇 protocols
11 篇 virtual machine ...
11 篇 hardware
10 篇 scalability
9 篇 operating system...
8 篇 computational mo...
8 篇 computer network...
8 篇 large-scale syst...
7 篇 access control

机构

52 篇 services computi...
39 篇 school of cyber ...
38 篇 school of comput...
28 篇 national enginee...
26 篇 hubei key labora...
26 篇 hubei engineerin...
24 篇 services computi...
24 篇 cluster and grid...
19 篇 school of softwa...
16 篇 school of inform...
12 篇 national enginee...
11 篇 services computi...
11 篇 cluster and grid...
8 篇 huazhong univers...
8 篇 services computi...
8 篇 jinyinhu laborat...
7 篇 cluster and grid...
6 篇 key laboratory o...
5 篇 cluster and grid...
5 篇 nanyang technolo...

作者

131 篇 hai jin
44 篇 jin hai
25 篇 xiaofei liao
24 篇 deqing zou
20 篇 song wu
18 篇 hu shengshan
14 篇 zhang leo yu
13 篇 li minghui
13 篇 fangming liu
12 篇 xuanhua shi
11 篇 zou deqing
11 篇 zhou ziqi
8 篇 qin zhang
8 篇 wan wei
8 篇 ran zheng
8 篇 hong yao
8 篇 shengshan hu
7 篇 kan hu
7 篇 long zheng
7 篇 shi xuanhua

语言

226 篇 英文
12 篇 中文
4 篇 其他

检索条件"机构=Services Computing Technology and System Laboratory"

共 242 条记录，以下是161-170 订阅

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

详细简洁

排序：

Adaptive Disk I/O Scheduling for MapReduce in Virtualized Environment

Adaptive Disk I/O Scheduling for MapReduce in Virtualized En...

引用

International Conference on Parallel Processing (ICPP)

作者： Shadi Ibrahim Hai Jin Lu Lu Bingsheng He Song Wu Cluster and Grid Computing laboratory Services Computing Technology and System laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Engineering Nanyang Technological University Singapore

Virtual machine (VM) interference has long been a challenging problem for performance predictability and system throughput for large-scale virtualized environments in the cloud. Such interferences are contributed by intertwined factors including the application's type, the number of con current VMs, and the VM scheduling algorithms used within the host. Since MapReduce has become an important data processing platform in the cloud, we investigate the impact of disk schedulers in Hadoop. Interestingly, our experimental results report a noticeable variation of the Hadoop performance between different applications when applying different disk pairs' schedulers in both the hypervisor and the virtual machines. Furthermore, a typical Hadoop application consists of different interleaving stages, each requiring different I/O workloads and patterns. As a result, the disk pairs' schedulers are not only sub-optimal for different MapReduce applications, but also sub-optimal for different sub-phases of the whole job. Accordingly, this paper presents a novel approach for adaptively tuning the disk pairs' schedulers in both the hypervisor and the virtual machines during the execution of a single MapReduce job. Our results show that MapReduce performance can be significantly improved; specifically, adaptive tuning of disk pairs' schedulers achieves a 25% performance improvement on a sort benchmark with Hadoop.

关键词： Benchmark testing Throughput Virtual machine monitors Interference Switches Virtual machining Tuning

来源：评论

学校读者我要写书评

暂无评论

A Web-Based Phylogenetic Analysis for a Query Gene

A Web-Based Phylogenetic Analysis for a Query Gene

引用

International Conference on Bioinformatics and Biomedical Engineering (ICBBE)

作者： Shenglong Tan Song Wu School of Computer Hubei University of Economics Wuhan China Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

We present a robust web server called Phytree of a query gene for phylogenetic analysis from the latest protein database with a user-friendly, interactive graphical user interface. Phytree of a query gene combines a BLAST search with a suite of tools that allows interactive, phylogenetic-oriented exploration of the BLAST results and flexible selection of homologous sequences among the BLAST hits. Once the selection of the BLAST hits is done, the corresponding sequences can be passed to the phylogenetic tree reconstruction pipelines (multiple alignment, data process, phylogenetic reconstruction, tree visualization). As the major technological innovation, selection of a meaningful subset of BLAST hits is implemented using pipeline programming and tree visualization used Java-based recursive method that allows trees to be integrated and viewed seamlessly in standard web browsers with no extra software required. Phytree of a query gene only needs users to copy their amino acid sequence of their query gene to the input box, and the phylogenetic tree will be built once and for all. This function is very practical for non-specialist in phylogeny. Moreover, Phytree of a query gene introduces several new methods in treatment of intermediate results, which makes it much faster, easier and more accurate, robust in phylogenetic tree reconstruction. It is specially designed for users who have no experience in phylogeny. It is freely available on our web page: http://211.69.198.144/***.

关键词： Phylogeny Databases Pipelines Proteins Bioinformatics Visualization Software

来源：评论

学校读者我要写书评

暂无评论

A Cloud Service Cache system Based on Memory Template of Virtual Machine

A Cloud Service Cache System Based on Memory Template of Vir...

引用

ChinaGrid Annual Conference (ChinaGrid)

作者： Xuanhua Shi Chao Liu Song Wu Hai Jin Xiaoxin Wu Li Deng Services Computing Technology and System Laboratory Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Huawei Technologies Company Limited China

In data centers and cloud computing environments, the number of virtual machines (VMs) increases when the number of service requests increases. Since services are invoked on demand, the corresponding virtual machines will be created and shut down frequently. This makes the time of starting a virtual machine a crucial performance bottleneck for services in data centers. Besides, if virtual machines read image files from disks to start themselves, additional overhead to access disk will be generated. In this paper, we present a cloud service cache system based on memory template of virtual machines - VCache to improve the response time of cloud computing services, and to reduce the disk access overhead. This system can create and maintain service cache VMs through memory templates, which are snapshots of running virtual machines. By creating virtual machines from cached image files, the service running in these VMs can be deployed rapidly, which greatly reduces the launching time of the service and disk I/O load. We evaluate our system with experiments, and the experimental results show that the average time for creating a VM is reduced about 80% and the amount of data through disk access decreases more than 50%.

关键词： Virtual machining Random access memory IP networks Memory management Image restoration Cloud computing Cloning

来源：评论

学校读者我要写书评

暂无评论

高可扩展的RDF数据存储系统

高可扩展的RDF数据存储系统

引用

第29届中国数据库学术会议

作者： Yuan Pingpeng 袁平鹏 Liu Pu 刘谱 Zhang Wenya 张文娅 Wu Buwen 吴步文 Key Laboratory of Services Computing Technology and System(Huazhong University of Science and Technology) Ministry of Education Wuhan 430074 服务计算技术与系统教育部重点实验室(华中科技大学) 武汉430074 Key Laboratory of Cluster and Grid Computing of Hubei Province(Huazhong University of Science and Technology)Wuhan 430074 集群与网格计算湖北省重点实验室(华中科技大学) 武汉430074 School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 华中科技大学计算机科学与技术学院武汉430074

由于资源描述框架(resource description framework,RDF)具有表达灵活、简洁等优点,已被接受为表达元数据及万维网上数据互联的规范.近年来,其数据量在以飞快的速度增长.相应地,要求存储RDF数据的系统应具有高扩展性.介绍了一个高可扩展... 详细信息

由于资源描述框架(resource description framework,RDF)具有表达灵活、简洁等优点,已被接受为表达元数据及万维网上数据互联的规范.近年来,其数据量在以飞快的速度增长.相应地,要求存储RDF数据的系统应具有高扩展性.介绍了一个高可扩展的RDF数据存储系统TripleBit.为尽可能降低存储空间消耗,采用了增量压缩和变长整数编码方法.并采用了数据分块的存储方法,既使得存储管理方便又使得存储结构紧凑,加速了数据读取.系统提供了基于启发式规则的动态查询计划生成方法,所产生的查询计划在执行过程中根据中间结果会相应作调整,以保持最优的执行顺序.对于多变量的查询,使用二步执行策略以减少查询过程中产生的中间结果.与目前流行RDF数据存储系统相比较,在存储空间上RDF-3X比TripleBit至少多40％；在查询性能上,比RDF-3X和MonetDB获得数倍的提升.

关键词：数据存储系统资源描述框架数据编码查询处理

来源：评论

学校读者我要写书评

暂无评论

大规模RDF数据库系统TripleBit

大规模RDF数据库系统TripleBit

引用

第29届中国数据库学术会议

作者： Liu Pu 刘谱 Wang Jing 王晶 Yuan Pingpen 袁平鹏 Wu Buwen 吴步文 Key Laboratoty of Services Computing Technology and System (Huazhong University of Science and Technology) Ministry of Education Wuhan 430074 服务计算技术与系统教育部重点实验室(华中科技大学) 武汉430074 Key Laboratory of Cluster and Grid Computing of Hubei Province(Huazhong University of Science and Technology)Wuhan 430074 集群与网格计算湖北省重点实验室(华中科技大学) 武汉430074 School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 华中科技大学计算机科学与技术学院武汉430074

由于RDF(Resource Description Framework)具有表达灵活、简洁等优点,已被接受为表达元数据及万维网上数据互联的规范。近年来,其数据量以飞快的速度增长,相应地,要求存储RDF数据的系统应具有高扩展性。大规模RDF数据库系统TripleBit旨... 详细信息

由于RDF(Resource Description Framework)具有表达灵活、简洁等优点,已被接受为表达元数据及万维网上数据互联的规范。近年来,其数据量以飞快的速度增长,相应地,要求存储RDF数据的系统应具有高扩展性。大规模RDF数据库系统TripleBit旨在为大规模RDF数据提供一个高效的存储和查询方案。为尽可能降低存储空间消耗,采用了增量压缩和变长整数编码方法。并采用了数据分块的存储方法,既使得存储管理方便又使得存储结构紧凑,加速了数据读取。系统提供了基于启发式规则的动态查询计划生成方法。所产生的查询计划在执行过程中根据中间结果会相应作调整,以保持最优的执行顺序。对于多变量的查询,使用二步执行策略以减少查询过程中产生的中间结果。与当前著名系统RDF-3X相比,TripleBit具有较好的性能。

关键词：资源描述框架数据库系统优化设计应用框架查询处理

来源：评论

学校读者我要写书评

暂无评论

Xenrelay: An Efficient Data Transmitting Approach for Tracing Guest Domain

Xenrelay: An Efficient Data Transmitting Approach for Tracin...

引用

IEEE International Conference on Cloud computing technology and Science (CloudCom)

作者： Hai Jin Wenzhi Cao Pingpeng Yuan Xia Xie Cluster and Grid Computing Laboratory Services Computing Technique and System Laboratory Huazhong University of Science and Technology Wuhan China

As the degree of virtualization is growing considerably, improving performance of virtual machine environments motivates deeper investigation of the internal processes and performance implications of virtualization. Several tools are currently available to help analyze performance in virtual machine environments. However, all of these cannot support users to add their own trace information. In this paper, we present Xenrelay, a unified, efficient, and simple mechanism for transferring large amounts of data from guest domain kernel to privileged domain user-space. Xenrelay allows users (who trace subsystems of guest domain to analyze performance) to record and fast relay data between domains. We provide a case of Xenrelay's value in revealing behavior of virtualization. We build a block trace toolkit (using Xenrelay as an engine). This toolkit is used to track the block I/O virtualization procedures and evaluates overheads in the Xen environment. Our trace results identify that the main delay is the time of request transmission and block device operation. Besides, the results reveal impact of the I/O schedules on the disk performance.

关键词： Relays Kernel Bandwidth Data communication Virtual machining Performance evaluation Engines

来源：评论

学校读者我要写书评

暂无评论

Adaptive audio-aware scheduling in Xen virtual environment

Adaptive audio-aware scheduling in Xen virtual environment

引用

IEEE/ACS International Conference on Computer systems and Applications

作者： Huacai Chen Hai Jin Kan Hu Minhao Yuan Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

With the development of client virtualization technology, it has become an important tendency to apply soft real-time applications in virtual environment. Currently, most schedulers in VMM (i.e., virtual machine monitor) take the fairly sharing of processor resources and load balancing as a main concern, while show less regard to application diversity and I/O responsiveness. This would be unable to meet the requirement for latency-sensitive tasks, such as audio application. Audio stream may suffer from severe input buffer overrun or output buffer underrun, especially in the case that there is no real-time guarantee on virtualized clients under heavy load. In this paper, we introduce experiments to illustrate that current scheduler in Xen does a poor job in guaranteeing fluent audio playing, and then formulate the fluent playing conditions a scheduler should satisfy. A scheduling strategy with soft real-time support is proposed to improve the responsiveness of latency-sensitive guests. To implement our proposition, we extend the Credit scheduler by using flexible time slice and real-time priority. Our solution is audio-aware and capable of adjusting the real-time priority of guest domains adaptively, achieving a better experience for end-users. The experimental results show that audio glitches can be completely eliminated via our extended scheduler even when the system load is very high.

关键词： Client virtualization flexible time slice latency-sensitive real-time priority

来源：评论

学校读者我要写书评

暂无评论

VirtCFT: A Transparent VM-Level Fault-Tolerant system for Virtual Clusters

VirtCFT: A Transparent VM-Level Fault-Tolerant System for Vi...

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Minjia Zhang Hai Jin Xuanhua Shi Song Wu Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

A virtual cluster consists of a multitude of virtual machines and software components that are doomed to fail eventually. In many environments, such failures can result in unanticipated, potentially devastating failure behavior and in service unavailability. The ability of failover is essential to the virtual cluster's availability, reliability, and manageability. Most of the existing methods have several common disadvantages: requiring modifications to the target processes or their OSes, which is usually error prone and sometimes impractical; only targeting at taking checkpoints of processes, not whole entire OS images, which limits the areas to be applied. In this paper we present VirtCFT, an innovative and practical system of fault tolerance for virtual cluster. VirtCFT is a system-level, coordinated distributed checkpointing fault tolerant system. It coordinates the distributed VMs to periodically reach the globally consistent state and take the checkpoint of the whole virtual cluster including states of CPU, memory, disk of each VM as well as the network communications. When faults occur, VirtCFT will automatically recover the entire virtual cluster to the correct state within a few seconds and keep it running. Superior to all the existing fault tolerance mechanisms, VirtCFT provides a simpler and totally transparent fault tolerant platform that allows existing, unmodified software and operating system (version unawareness) to be protected from the failure of the physical machine on which it runs. We have implemented this system based on the Xen virtualization platform. Our experiments with real-world benchmarks demonstrate the effectiveness and correctness of VirtCFT.

关键词： Virtual machining Fault tolerant systems Fault tolerance Checkpointing Protocols Kernel

来源：评论

学校读者我要写书评

暂无评论

Dynamic Switching-Frequency Scaling: Scheduling Overcommitted Domains in Xen VMM

Dynamic Switching-Frequency Scaling: Scheduling Overcommitte...

引用

International Conference on Parallel Processing (ICPP)

作者： Huacai Chen Hai Jin Kan Hu Jian Huang Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Virtualization enables multiple guest operating systems run on a single physical platform. These virtual machines may host any types of application, including concurrent HPC programs. Traditionally, VMM schedulers have focused on fairly sharing the processor resources among domains, rarely consider VCPUs' behaviors. However, this can result in poor application performance to overcommitted domains if there are concurrent programs hosted in them. In this paper we review the properties of both Xen's Credit and SEDF schedulers, and show how these schedulers may seriously impact the performance of the communication-intensive and I/O-intensive concurrent applications in overcommitted domains. We discuss the origination of the problem theoretically, and confirm the derived conclusion on benchmarks. A novel approach, that dynamically scales the context switching-frequency by selecting variable time slices according to VCPUs` behaviors, is then proposed to improve the Credit scheduler more adaptive for concurrent applications. The experimental results show that this extended Credit scheduler can improve the performance of communication-intensive and I/O-intensive concurrent applications in overcommitted domains to the same magnitude as in undercommitted domains.

关键词： Switches Context Dynamic scheduling Monitoring Dispersion Instruction sets Hardware

来源：评论

学校读者我要写书评

暂无评论

FTDS: Adjusting Virtual computing Resources in Threshing Cases

FTDS: Adjusting Virtual Computing Resources in Threshing Cas...

引用

Euromicro Conference on Parallel, Distributed and Network-Based Processing

作者： Jian Huang Hai Jin Kan Hu Zhiyuan Shao Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

In a virtual execution environment, dynamic computing resource adjustment technique, configuring the computing resource of virtual machines automatically according to the actual loads generated by applications, is often adopted in virtual machine monitor to improve the resource utilization rate. Traditionally, the simple Additive Increase Subtractive Decrease (AISD) scheme is used as an adjusting rule. However, in some special situations, for example, compiling kernel in a virtual machine, the configuration of virtual machines may change abruptly because of the violent vibration of workload during a short interval, and the threshing can inevitably result in additional overhead under AISD rule. In this paper, we extend the Proportional-Integral-Derivative (PID) algorithm and present a feedback control model for configuring virtual computing resources, and propose an innovative adjusting scheme called Forecasting and Time Delayed Subtraction (FTDS) to reduce the overhead caused by threshing. The FTDS uses both statistic history of resource requests and current utilization of computing resource to predict whether threshing happens and to determine how many and when to adjust the amount of virtual CPUs. Experimental results show that FTDS can effectively reduce the jitter occurred in adjusting and make the performance penalty for threshing decreased from 9% to 0.3% compared with AISD, while maintaining that in non-threshing cases the same as AISD.

关键词： Virtual machining Virtual machine monitors Resource management Kernel Three-term control Feedback control Predictive models Delay effects Statistics History

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共25页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：