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

14th IEEE Int. Conf. on Computational Science and Engineering, CSE 2011, the 11th International Symposium on Pervasive systems, Algorithms, and Networks, I-SPAN 2011, and the 10th IEEE Int. Conf. on Ubiquitous computing and Communications, IUCC 2011

作者： Shi, Xuanhua Jiang, Hongbo He, Ligang Jin, Hai Wang, Chonggang Yu, Bo Wang, Fei Service Computing Technology and System Lab./Cluster and Grid Computing Lab. School of Computer Huazhong University of Science and Technology China Department of Electronics and Information Engineering Huazhong University of Science and Technology China Department of Computer Science University of Warwick United Kingdom InterDigital Communications Corp. United States

ISBN: (纸本)9780769544779

Emerging data centers may host a large number of applications that consume CPU power, memory, and I/O resources. Previous studies focus on the allocation of resources in order to perfectly satisfy the demands seen in the current cycle, and the existing application placement algorithms are all based on applications. The existing application placement algorithms in literature assume that the consumption of system resources is proportional to the level of workloads submitted to the system. In this paper, we revealed that it may not be the case in some circumstances. Based on this observation, we design and implement an application placement framework, called EAPAC, for data centers. The developed framework is able to judiciously allocate to application servers a proper mixture of different types of application requests as well as an appropriate number of requests in each type. Further, we investigate the issue of resource conflicts among different applications when there exist concurrent requests in the system. We have conducted extensive experiments to evaluate the performance of the developed framework. The experiment results show that compared with the existing studies, EAPAC can improve the performance by 30% in terms of the reply rate. Especially, when there are concurrent requests in the system, the performance can be improved by 100%. © 2011 IEEE.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

RAPN: Network attack prediction using ranking access petri net

Proceedings - 2011 6th Annual ChinaGrid Conference, ChinaGri...

引用

Proceedings - 2011 6th Annual Chinagrid Conference, Chinagrid 2011 2011年 108-115页

作者： Traore, Moussa Djiriba Jin, Hai Zou, Deqing Qiang, Weizhong Xiang, Guofu Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769544724

Exploits sequencing is a typical way by which an attacker breaks into a network. In such a scenario, each exploit lays as an atomic proposition for subsequent exploits. An attack path is seen as a succession of exploits which take an attacker right to his/her final goal. The set of all possible attack paths form an attack graph. Researchers have proposed a multitude of techniques to generate attack graph which grows exponentially in the size of the network. Hence it is preferable to optimize the choice of solutions which avoid the cost of scalab.lity and cumbersome. In this paper, we propose a comprehensive approach to network vulnerability analysis by ranking access Petri net graph and utilizing a penetration tester's perspective of maximal level of access possible on a host. Our approach has the following benefits: it provides a simple model in which an analyst can work, its algorithmic complexity is polynomial in the size of the network, and has the ability of scaling well to large size networks. Nevertheless, it has some drawback as in place of all possible attack paths, we seek only good attack paths. An analyst may make suboptimal choices when repairing the network. © 2011 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

A behavior-geography based routing scheme in mobile ad hoc networks

A behavior-geography based routing scheme in mobile ad hoc n...

引用

2011 ACM Workshop on Ubiquitous Affective Awareness and Intelligent Interaction, UAAII'11, Co-located with UbiComp 2011

作者： Yu, Chen Li, Xi Liang, Chuanming Jin, Hai Service Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781450309325

Multicast routing scheme seems so extravagant in resource respect in mobile ad hoc network (MANET), especially in delay tolerant network (DTN), that yields to high resource occupation rate, low submission rate, and long periods of message transferring, while unicast routing scheme is a plausible way of resource economization, albeit the submission rate and periods do not change too much. Lots of estimable arts that work out the limitation of the dilemma by improving the preliminary protocols or melding with diverse considerate mechanism, as buffer allocate, are suited to specific conditions. This paper devotes to adopt a behavior-geography based way to promote its performance. The core idea is to eschew the emergence of the redundant message duplicate which heads to errant directions of geography, when a message dispensed in the network, by the knowledge of the behavior type its terminus performing. To make this come true, sequentially, a behavior rectification method, a simple localization way and two distinct propagation means are utilized. Although it is hard to make a convincing proof to warrant it is better than current works in certain gauge, the assumed constraints are so close to reality that this way must bears considerable effects. © 2011 ACM.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

MT-profiler: A parallel dynamic analysis framework based on two-stage sampling 1

引用

Lecture Notes in Computer Science

作者： Yu, Zhibin Zhang, Weifu Tu, Xuping Service Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (数字)9783642241512

ISBN: (纸本)9783642241505

Dynamic instrumentation systems offer a valuable solution for program profiling and analysis, architectural simulation, and bug detection. However, the performance of target programs suffers great losses when they are instrumented by these systems. This issue is mainly caused by the resource contention between the target programs and the instrumentation systems. As multi-core processors are becoming more and more prevalent in modern computing environments, more hardware resource parallelism is provided for software to exploit. In this paper, we propose to leverage the abundant computing resources of multi-core systems to accelerate program instrumentation. We design and implement a Multi-Threaded Profiling framework named MT-Profiler to dynamically characterize parallel programs. The framework creates instrumenting and analysis code slices which can run along with application threads in parallel on different cores. To further reduce the overhead of dynamic instrumentation, MT-profiler employs two-stage sampling scheme with several optimizations. It is implemented on DynamoRIO which is an open-source dynamic instrumentation and runtime code manipulation system. The performance of our MT-Profiler is evaluated by using the NPB3.3 OPENMP test suite. The results demonstrate that the MT-Profiler obtains 3 to 17 times speedup compared with the DynamoRIO perfect profiler while the average accuracy is over 80%. © 2011 Springer-Verlag.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Resource allocation in contending virtualized environments through VM performance modeling and feedback

Proceedings - 2011 6th Annual ChinaGrid Conference, ChinaGri...

引用

Proceedings - 2011 6th Annual Chinagrid Conference, Chinagrid 2011 2011年 196-203页

作者： Jiang, Congfeng Xu, Xianghua Zhang, Jilin Li, Yunfa Wan, Jian Grid and Service Computing Technology Lab. Hangzhou Dianzi University Hangzhou 310037 China

ISBN: (纸本)9780769544724

With active deployment of virtualization in large scale data centers and cloud computing environments, allocation and scheduling of virtual and physical resources raise more challenges and may have negative impacts on system performance due to: (1) the isolation between the guest Virtual Machines (VMs) and the Virtual Machines Monitor (VMM), and (2) the independent and even conflicting operations between multiple VMs. In this paper a stochastic model of resources in virtualized environments is proposed and resource allocation and scheduling algorithm are proposed to provide performance guarantees and service differentiation in contending conditions. In the proposed algorithm user behavior and workloads are characterized through the historical and real time performance profiling and estimation from hosted agents within individual VMs. The resources are allocated according to the demand as well as the performance of the targeted VMs based on the Suffer age aggregation and performance feedback. Experiments on a real Xen based virtualization environment with 3 VMs are conducted and evaluated for accuracy, efficiency, sensitivity, and overhead. The results show that the performance feedback based allocation can achieve a higher SLA satisfaction rate as 97.5%, a lower load imbalance index as 17.6%. The results also show that this algorithm is valid, effective and scalab.e for implementation in real virtualized environments. © 2011 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Analyzing and improving MPI communication performance in overcommitted virtualized systems

Analyzing and improving MPI communication performance in ove...

引用

IEEE Annual International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication systems

作者： Shao, Zhiyuan Wang, Qiang Xie, Xuejiao Jin, Hai He, Ligang Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China Department of Computer Science University of Warwick Coventry CV4 7AL United Kingdom

ISBN: (纸本)9780769544304

Nowadays, it is an important trend in the system domain to use the software-based virtualization technology to build the execution environments (e.g., Clouds) and serve high performance computing (HPC) applications. However, with the extra virtualization layer, the application performance may be negatively affected. Studies revealed that the communication performance of the MPI library, which is widely used by the HPC applications, would suffer a high penalty when a physical host machine becomes overcommitted by virtual processors (VCPU). Unfortunately, the problem has not received enough attention and has not been solved yet in literature. In this paper, we investigate the reasons behind the performance penalty, and propose a solution to improve the communication performance of running MPI applications in the overcommitted virtualized systems. The experimental results show that by our proposal, most HPC applications can gain performance improvement to different extents among the overcommitted systems, depending on their communication patterns and the over committing level. © 2011 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

An adaptive management mechanism for resource scheduling in multiple virtual machine system

An adaptive management mechanism for resource scheduling in ...

引用

Lecture Notes in Computer Science

作者： Wan, Jian Yang, Laurence T. Li, Yunfa Xu, Xianghua Xiong, Naixue Grid and Service Computing Lab. School of Computer Science and Technology Hangzhou Dianzi University 310018 Hangzhou China Department of Computer Science St. Francis Xavier University Antigonish NS B2G 2W5 Canada Department of Computer Science IS and T on Virtual Computing Lab. Georgia State University GA 30303 United States

ISBN: (纸本)9783642234958

With the growth of hardware and software resources, the management of resource scheduling is becoming more and more difficult in multiple virtual machine system. It has become a very difficult problem that how to schedule the system resource and improve the service performance of resource. In order to solve this problem, we propose an adaptive management mechanism for resource scheduling. In the management mechanism, we first propose an adaptive management model for resource scheduling. Then, we present a genetic simulated annealing to resolve the management model. On the basis of the model and the algorithm, we design a management module. All these constitute an adaptive management mechanism for resource scheduling in multiple virtual machine system. In order to justify the feasibility and availab.lity of the adaptive management mechanism for resource scheduling, a series of experiments have been done. The results show that it is feasible to adaptively manage and schedule the system resources and ensure the quality of service of resources in multiple virtual machine system. © 2011 Springer-Verlag.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Hierarchically characterizing CUDA program behavior

Hierarchically characterizing CUDA program behavior

引用

IEEE International Workshop/Symposium on Workload Characterization

作者： Zhibin Yu Hai Jin Nilanjan Goswami Tao Li Lizy K. John Service Computing Technologies and System Lab/Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China Intelligent Design of Efficient Architecture Lab University of Florida Gainesville FL USA Department of Electrical and Computer Engineering University of Texas Austin Austin TX USA

CUDA has become a very popular programming paradigm in parallel computing area. However, very little work has been done for characterizing CUDA kernels. In this work, we measure the thread level performance, collect the basic block level characteristics, and glean the instruction level properties for about 35 programs from CUDA SDK, Parboil, and Rodinia benchmark suites. In addition, we define basic block vectors, synchronization vectors and thread similarity matrix to capture the characteristics of CUDA programs efficiently. We find that CUDA programs have some unique characteristics at each level compared to sequential programs.

关键词： Graphics processing unit Vectors Kernel Instruction sets Programming USA Councils Educational institutions

来源：评论

学校读者我要写书评

暂无评论

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 availab.e 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：