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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

485 篇 会议
184 篇 期刊文献
7 册 图书

馆藏范围

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

日期分布

学科分类号

390 篇 工学
- 345 篇 计算机科学与技术...
- 241 篇 软件工程
- 65 篇 信息与通信工程
- 35 篇 生物工程
- 28 篇 控制科学与工程
- 27 篇 电气工程
- 24 篇 电子科学与技术（可...
- 21 篇 网络空间安全
- 17 篇 动力工程及工程热...
- 15 篇 机械工程
- 9 篇 交通运输工程
- 9 篇 生物医学工程（可授...
- 8 篇 光学工程
- 7 篇 仪器科学与技术
- 7 篇 化学工程与技术
- 5 篇 土木工程
126 篇 管理学
- 92 篇 管理科学与工程(可...
- 42 篇 图书情报与档案管...
- 40 篇 工商管理
125 篇 理学
- 67 篇 数学
- 39 篇 生物学
- 21 篇 系统科学
- 13 篇 统计学（可授理学、...
- 11 篇 化学
- 10 篇 物理学
19 篇 法学
- 12 篇 社会学
- 7 篇 法学
11 篇 经济学
- 10 篇 应用经济学
7 篇 医学
- 7 篇 基础医学(可授医学...
- 6 篇 临床医学
4 篇 文学
4 篇 农学
2 篇 教育学
1 篇 军事学
1 篇 艺术学

主题

65 篇 grid computing
33 篇 virtual machinin...
30 篇 servers
27 篇 computer science
27 篇 peer to peer com...
26 篇 computational mo...
25 篇 bandwidth
23 篇 cloud computing
22 篇 scalability
22 篇 computer archite...
20 篇 resource managem...
20 篇 computers
19 篇 kernel
19 篇 hardware
18 篇 protocols
17 篇 operating system...
17 篇 application soft...
15 篇 memory managemen...
15 篇 costs
15 篇 semantics

机构

100 篇 national enginee...
71 篇 services computi...
60 篇 school of comput...
53 篇 services computi...
46 篇 school of cyber ...
31 篇 cluster and grid...
29 篇 national enginee...
29 篇 cluster and grid...
28 篇 cluster and grid...
26 篇 huazhong univers...
26 篇 hubei engineerin...
25 篇 services computi...
23 篇 hubei key labora...
19 篇 school of softwa...
18 篇 zhejiang lab
15 篇 school of inform...
13 篇 services computi...
12 篇 national enginee...
12 篇 service computin...
12 篇 national enginee...

作者

334 篇 hai jin
240 篇 jin hai
83 篇 xiaofei liao
55 篇 deqing zou
51 篇 liao xiaofei
40 篇 song wu
32 篇 zou deqing
27 篇 shi xuanhua
27 篇 wu song
25 篇 long zheng
25 篇 haikun liu
25 篇 xuanhua shi
22 篇 ran zheng
19 篇 qin zhang
19 篇 hu shengshan
17 篇 xia xie
17 篇 yu zhang
15 篇 jiang xiao
15 篇 yu huang
14 篇 liu haikun

语言

641 篇 英文
23 篇 其他
13 篇 中文

检索条件"机构=Cluster and Grid Computing Lab Services Computing Technology"

共 676 条记录，以下是471-480 订阅

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

详细简洁

排序：

MR-Scope: A real-time tracing tool for MapReduce 10

MR-Scope: A real-time tracing tool for MapReduce

引用

Proceedings of the 19th ACM International Symposium on High Performance Distributed computing

作者： Huang, Dachuan Shi, Xuanhua Ibrahim, Shadi Lu, Lu Liu, Hongzhang Wu, Song Jin, Hai Cluster and Grid Computing Lab. Services Computing Technique and System Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781605589428

MapReduce programming model is emerging as an efficient tool for data-intensive applications. Hadoop, an open-source implementation of MapReduce, has been widely adopted and experienced by both academia and enterprise. Recently, lots of efforts have been done on improving the performance of MapReduce system and on analyzing the MapReduce process based on the log files generated during the Hadoop execution. Visualizing log files seems to be a very useful tool to understand the behavior of the Hadoop process. In this paper, we present MRScope, a real-time MapReduce tracing tool. MR-Scope provides a real-time insight of the MapReduce process, including the ongoing progress of every task hosted in Task Tracker. In addition, it displays the health of the Hadoop cluster data nodes, the distribution of the file system's blocks and their replicas and the content of the different block splits of the file system. We implement MR-Scope in native Hadoop 0.1. Experimental results demonstrat that MR-Scope's overhead is less than 4% when running wordcount benchmark. Copyright 2010 ACM.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Xenrelay: An efficient data transmitting approach for tracing guest domain

Xenrelay: An efficient data transmitting approach for tracin...

引用

2nd IEEE International Conference on Cloud computing technology and Science, CloudCom 2010

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

ISBN: (纸本)9780769543024

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. © 2010 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Affinity-aware proportional share scheduling for virtual machine system

Affinity-aware proportional share scheduling for virtual mac...

引用

International Conference on grid and Cloud computing

作者： Chen, Huacai Jin, Hai Hu, Kan Services Computing Technology and System Lab. Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769543130

VM (virtual machine) scheduling is a fundamental topic of virtualization, and fairness is its important design goal. Most VMMs (virtual machine monitor) provide PS (proportional share) schedulers. A PS scheduler assign a weight to every VM to declare the computational resource requirement, and VM is allocated CPU cycles proportional to weight. CPU-affinity is a property of VCPU (virtual CPU) to describe which PCPUs (physical CPU) it can run on. However, current definition of weight does not collaborate well with CPU-affinity. It behaves as if all PCPUs are available to all VMs. We expose the issue by using Xen's Credit scheduler, and show that CPU cycles can be fairly allocated to VMs in the default free-mapping case (no affinity restriction), but not so in restricted-mapping cases (when affinities are configured). This fairness issue makes it necessary to extend the meaning of weight, so as to reflect the resource requirements in all cases. In this paper we reconcile the meaning of a domain's weight with CPU-affinity, and improve Credit scheduler as an affinity-aware one. Experimental results show that our affinity-aware proportional share scheduler (named Credit-APS scheduler) brings a good fairness both in free-mapping and restricted-mapping cases. © 2010 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Performance modeling of resource failures in grid environments

Performance modeling of resource failures in grid environmen...

引用

International Conference on Frontier of Computer Science and technology

作者： Tao, Yongcai Wu, Song Shi, Lei School of Information Engineering Zhengzhou University Zhengzhou Henan 450001 China Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769541396

grid is susceptible to a number of software and hardware failures, so a deep understanding of and modeling the grid resource failures are a challenge and have significant influence on grid researching. However, due to various reasons such as commercial secret and security, it is difficult to obtain real historical logs of grids. Therefore, an accurate model of resource failures is critically useful. In the paper, through analyzing the grid log data, we detail the suitability of three potential statistical distributions for each data set: Wetbull, Zipf's law and Pareto. Then, this paper develops a grid resource failure simulator. Finally, with the different failure patterns generated by the failure simulator, the paper evaluates several common scheduling algorithms used in grid systems. © 2010 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

SHelp: Automatic self-healing for multiple application instances in a virtual machine environment

SHelp: Automatic self-healing for multiple application insta...

引用

作者： Chen, Gang Jin, Hai Zou, Deqing Zhou, Bing Bing Qiang, Weizhong Hu, Gang Cluster and Grid Computing Lab. Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan 430074 China Centre for Distributed and High Performance Computing School of Information Technologies University of Sydney NSW 2006 Australia

ISBN: (纸本)9780769542201

When multiple instances of an application running on multiple virtual machines, an interesting problem is how to utilize the fault handling result from one application instance to heal the same fault occurred on other sibling instances, and hence to ensure high service availability in a cloud computing environment. This paper presents SHelp, a lightweight runtime system that can survive software failures in the framework of virtual machines. It applies weighted rescue points and error virtualization techniques to effectively make applications bypass the faulty path. A two-level storage hierarchy is adopted in the rescue point database for applications running on different virtual machines to share error handling information to reduce the redundancy and to more effectively and quickly recover from future faults caused by the same bugs. A Linux prototype is implemented and evaluated using four web server applications that contain various types of bugs. Our experimental results show that SHelp can make server applications to recover from these bugs in just a few seconds with modest performance overhead. © 2010 IEEE.

关键词： Software reliability

来源：评论

学校读者我要写书评

暂无评论

Autonomous Agent Based Intrusion Detection in Virtual computing Environment

Autonomous Agent Based Intrusion Detection in Virtual Comput...

引用

2010 IEEE International Conference Conferenhce on Wireless Communications,Networking and Information Security(2010 IEEE 无线通信、网络技术与信息安全国际会议 WCNIS)

作者： Feng Zhao Alex K. Ohoussou Deqing Zou Hai Jin Guofu Xiang Ge Cheng Cluster and Grid Computing Lab Services Computing Technology and System Lab Huazhong University of S Cluster and Grid Computing Lab Services Computing Technology and System Lab Huazhong University of S

One of the motivations for virtualization technology is the desire to develop new services to enhance system security without trusting both the applications and the operating systems. An intrusion detection system is an example of such service that can help to isolate users from malicious attacks. In this paper, we propose hybrid-based intrusion detection architecture in virtual computing environment to detect and isolate harmful behaviors by real-time monitoring and alarming. In contrast to monolithic intrusion detection system, we introduce autonomous agents, acting independently of each other, to monitor the system. The agents are deployed in virtual machines to analyze actions occurring on the network and inside the hosts to determine whether they are potential security violations or not. Our architecture is implemented based on Xen, and the detection management center is deployed in a secure virtual machine.

关键词： intrusion detection autonomous agent virtual computing environment

来源：评论

学校读者我要写书评

暂无评论

LEEN: Locality/fairness-aware key partitioning for MapReduce in the cloud

LEEN: Locality/fairness-aware key partitioning for MapReduce...

引用

2nd IEEE International Conference on Cloud computing technology and Science, CloudCom 2010

作者： Ibrahim, Shadi Jin, Hai Lu, Lu Wu, Song He, Bingsheng Qi, Li Cluster and Grid Computing Lab Services Computing Technology and System Lab Huazhong University of Science and Technology Wuhan 430074 China School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore Information and Technology Department China Development Bank Beijing 100037 China

ISBN: (纸本)9780769543024

This paper investigates the problem of Partitioning Skew1 in MapReduce-based system. Our studies with Hadoop, a widely used MapReduce implementation, demonstrate that the presence of partitioning skew causes a huge amount of data transfer during the shuffle phase and leads to significant unfairness on the reduce input among different data nodes. As a result, the applications experience performance degradation due to the long data transfer during the shuffle phase along with the computation skew, particularly in reduce phase. We develop a novel algorithm named LEEN for locality-aware and fairness-aware key partitioning in MapReduce. LEEN embraces an asynchronous map and reduce scheme. All buffered intermediate keys are partitioned according to their frequencies and the fairness of the expected data distribution after the shuffle phase. We have integrated LEEN into Hadoop-0.18.0. Our experiments demonstrate that LEEN can efficiently achieve higher locality and reduce the amount of shuffled data. More importantly, LEEN guarantees fair distribution of the reduce inputs. As a result, LEEN achieves a performance improvement of up to 40% on different workloads. © 2010 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

MSNAP: Fault tolerant event localization in wireless sensor networks

MSNAP: Fault tolerant event localization in wireless sensor ...

引用

2010 IEEE Asia-Pacific services computing Conference, APSCC 2010

作者： Xu, Xianghua Gao, Xueyong Wan, Jian Grid and Services Computing Lab. School of Computer Science and Technology Hangzhou Dianzi University Hangzhou 310037 China

ISBN: (纸本)9780769543055

This paper investigates event localization in wireless sensor networks. We improve the SNAP (Subtract on Negative Add on Positive) localization algorithm and propose the MSNAP (Modified Subtract on Negative Add on Positive) localization algorithm with higher localization accuracy and better performance of fault tolerance. First, every sensor node obverses the event signal and compares its observed reading with a threshold. If the reading is above the threshold, the node will send it to the sink station. Otherwise, it remains silent. Based on the observed readings which the nodes report, the sink station constructs the likelihood matrix by simply adding ± 1 contributions in the area around the nodes, whose maximum value points to the event location. Compared with the SNAP algorithm, when constructing the likelihood matrix, MSNAP dynamically adjusts the size of estimated region depending on the observed readings the nodes reported. Experimental results show that the algorithm effectively improves the localization accuracy and fault tolerance. © 2010 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Improve the completeness of passive monitoring trace in wireless sensor network

Improve the completeness of passive monitoring trace in wire...

引用

2010 IEEE Asia-Pacific services computing Conference, APSCC 2010

作者： Xu, Xianghua Tong, Chao Wan, Jian Grid and Services Computing Lab. School of Computer Science and Technology Hangzhou Dianzi University Hangzhou 310037 China

ISBN: (纸本)9780769543055

The performance evaluation of wireless sensor network based on passive monitoring restricted by two respects: first, passive monitoring trace is incomplete, because monitors can not capture every transmission in the network. Second, the information directly extracted from trace is insufficient. Performance evaluation always needs some implicit information, e.g., packet reception. To solving the problems above, we use two processing steps to construct an enhanced trace of network. First, an online merging procedure combines the incomplete traces of various monitors into a single more complete trace. Next, an inference procedure based on finite state machine reconstructs packets that were not captured by any monitor and determines whether a packet was received by its destination. Merging and inference procedure are realized in CTP Network which is incorporated with TinyOS. The evaluation is performed on simulation. The experiment results show that, if the trace contains more than 70% of the total packets, the engine can infer 20%-25% more loss packets and 90% packets' reception. © 2010 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Regulative growth codes: Enhancing data persistence in sparse sensor networks

Regulative growth codes: Enhancing data persistence in spars...

引用

2010 IEEE Asia-Pacific services computing Conference, APSCC 2010

作者： Xu, Xianghua Shen, Chao Wan, Jian Grid and Services Computing Lab. School of Computer Science and Technology Hangzhou Dianzi University Hangzhou 310037 China

ISBN: (纸本)9780769543055

Growth Codes (GC) enhances the data persistence in dense sensor networks. However, GC exchanges data with neighbors in a completely random way, which may lead to uneven sensor data distribution in sparse sensor network. This significantly reduces the efficiency of GC data acquisition and fault-tolerance in sparse sensor network with less connectivity. In this paper, we propose Regulative Growth Codes (RGC) which use a random sequencing policy in data exchange operation instead of the completely random policy used in GC, and introduce the self-detection mechanism to reduce the redundant exchange. Simulation results show that the performance of RGC is better than GC in sparse sensor networks. © 2010 IEEE.

关键词： Electronic data interchange

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共68页 << < 44 45 46 47 48 49 50 51 52 53 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：