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

An Optimistic Checkpoint Mechanism Based on Job Characteristics and Resource Availability for Dynamic grids

Wuhan University Journal of Natural Sciences 2011年第3期16卷 213-222页

作者： TAO Yongcai JIN Hai WU Song School of Information Engineering Zhengzhou University Zhengzhou 450000 Henan China Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan 430074 Hubei China

In the paper, based on the job characteristics and resources availability, an optimistic checkpoint mechanism for dynamic grids（OCM4G） is proposed. It can determine whether to checkpoint a given job running on a given resource node and establish optimal aperiodic checkpoint intervals by applying the knowledge of job characteristics and resource availability. We evaluate OCM4G over a real grid environment （Chitlagrid） and the results show that OCM4G achieves better performance than the periodic checkpoint and the analytical method of calculating aperiodic checkpoint intervals.

关键词： grid computing fault tolerance checkpoint Markov

来源：评论

学校读者我要写书评

暂无评论

A novel memory-based storage optimization approach for RDF data supporting SPARQL query 1

引用

4th International Conference on Human-Centric computing, HumanCom'11 and the 6th International Conference on Embedded and Multimedia computing, EMC'11

作者： Zhao, Feng Wu, Delong Yuan, Pingpeng Jin, Hai Service Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology 430074 Wuhan China

ISBN: (数字)9789400721050

ISBN: (纸本)9789400721043

Due to sparse of RDF data, RDF storage approaches using triple table or binary file rarely show high storage usage and high query performance. To achieve the goal of decreasing storage space and improving the efficiency and generality of query on RDF data, a memory-based storage optimization approach supporting SPARQL query is proposed in this paper. For storage efficiency, strings are transferred to 32-bit integer identifiers, RDFS/OWL is used to organize the RDF data storage model, vertical partition method and other ways are utilized to split and organize the RDF triples. For query generality, the storage model also partially supports SPARQL query. Furthermore, by getting the statistics of the underlying storage data, we construct a SPARQL query optimized module. Experiments show that our query optimization module greatly improves the performance of the SPARQL query. Compared with Jena Memory and RDF-3X, our storage method has higher performance. © 2011 Springer Science+Business Media B.V.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

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 scalability 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 Rule-based Framework of Metadata Extraction from Scientific Papers

A Rule-based Framework of Metadata Extraction from Scientifi...

引用

2011 IEEE 10th International Symposium on Distributed computing and Applications to Business,Engineering(第十届电子商务、工程及科学领域的分布式计算和应用国际学术研讨会 DCABES 2011)

作者： Zhixin Guo Hai Jin Cluster and Grid Computing Lab Services Computing Technology and System Lab Huazhong University of Science and Technology Wuhan 430074 China

Most scientific documents on the web are unstructured or semi-structured, and the automatic document metadata extraction process becomes an important task. This paper describes a framework for automatic metadata extraction from scientific papers. Based on a spatial and visual knowledge principle, our system can extract title, authors and abstract from scientific papers. We utilize format information such as font size and position to guide the metadata extraction process. The experiment results show that our system achieves a high accuracy in header metadata extraction which can effectively assist the automatic index creation for digital libraries.

关键词： document metadata information extraction rulebased

来源：评论

学校读者我要写书评

暂无评论

Reference metadata extraction from scientific papers

Reference metadata extraction from scientific papers

引用

IEEE International Conference on Parallel and Distributed computing, Applications and Technologies (PDCAT)

作者： Zhixin Guo Hai Jin Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory Huazhong University of Science and Technology Wuhan China

Bibliographical information of scientific papers is of great value since the Science Citation Index is introduced to measure research impact. Most scientific documents available on the web are unstructured or semi-structured, and the automatic reference metadata extraction process becomes an important task. This paper describes a framework for automatic reference metadata extraction from scientific papers. Our system can extract title, author, journal, volume, year, and page from scientific papers in PDF. We utilize a document metadata knowledge base to guide the reference metadata extraction process. The experiment results show that our system achieves a high accuracy.

关键词： Data mining Portable document format Knowledge based systems Accuracy Libraries Semantics Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

RAPn: Network Attack Prediction Using Ranking Access Petri Net

RAPn: Network Attack Prediction Using Ranking Access Petri N...

引用

Chinagrid Annual Conference (Chinagrid)

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

关键词： Mathematical model Analytical models Databases Finite element methods Automata Permission

来源：评论

学校读者我要写书评

暂无评论

I/O Scheduling by Using Multi-network Interfaces of Virtualization system

I/O Scheduling by Using Multi-network Interfaces of Virtuali...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Xia Xie Haiqing Zhu Wenzhi Cao Hai Jin Pingpeng Yuan 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

With the development of virtualization technology, it can run more and more guest domains on one single physical machine. So the network I/O demand is also rapidly increasing, for these guest domains can supply more and more services or run more and more applications. This will lead to serious contention on network I/O of physical machine. Although we can use high performance NICs (network interface cards) to improve network I/O performance, one single NIC cannot get further performance improvement which depends on hardware technology. Linux bonding can achieve high bandwidth network by using multiple NICs, but it does not guarantee QoS among guest domains. Also it would terminate one guest domain's communication because of its response mechanism of ARP. Therefore, we present an approach named Virtual Bonding to achieve high bandwidth network by using multi-NICs. It aggregates multi-NICs to provide high bandwidth and high-quality network services. It also introduces load balancing mechanism between multi-NICs. So it can make full use of every NIC. Furthermore, it makes perfect support to virtualization environment.

关键词： Bonding Bridges Bandwidth Load management Servers Linux IP networks

来源：评论

学校读者我要写书评

暂无评论

Optimization of Sparse Matrix-Vector Multiplication with Variant CSR on GPUs

Optimization of Sparse Matrix-Vector Multiplication with Var...

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Xiaowen Feng Hai Jin Ran Zheng Kan Hu Jingxiang Zeng Zhiyuan Shao 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

Sparse Matrix-Vector multiplication (SpMV) is one of the most significant yet challenging issues in computational science area. It is a memory-bound application whose performance mostly depends on the input matrix and the underlying architecture. Many researchers have paid more attentions on exploring a variety of optimization techniques to SpMV. One of the most promising respects is how to adapt the storage format to satisfy the underlying architecture. Alterative storage formats can largely lessen memory pressure, however, the computational resources are often underutilized. Therefore, a new storage format, which is called Compressed Sparse Row with Segmented Interleave Combination (SIC), is proposed. Stemming from Compressed Sparse Row format (CSR), SIC format employs an interleave combination pattern that combines certain amount of CSR rows to form a new SIC row. In order to further improve performance, segmented processing is also brought in. According to the empirical data, we also develop an automatic SIC-based SpMV suitable for all the matrices. Experimental results show that our approach outperforms the NVIDIA CSR vector kernel, achieving up to 12.6 × speedup. It also demonstrates a comparable performance with the Hybrid format, even with the highest 2.89 × speedup.

关键词： Graphics processing unit Kernel Sparse matrices Silicon carbide Vectors Instruction sets Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Automatic power-aware reconfiguration of processor resource in virtualized clusters

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2011年第7期48卷 1123-1133页

作者： Jin, Hai Deng, Li Wu, Song Shi, Xuanhua Zhou, Like Key Laboratory of Services Computing Technology and System Huazhong University of Science and Technology Ministry of Education Wuhan 430074 China Key Laboratory of Cluster and Grid Computing of Hubei Province Huazhong University of Science and Technology Wuhan 430074 China

Virtualization provides significant benefits of system maintenance, load balancing, fault tolerance, and power-saving in clusters or data centers. It also enables dynamic reconfiguration of computing resource for application environment. However, current dynamic resource control approaches mainly focus on how to satisfy the application-level quality of service (QoS) when application workloads vary with time. They are driven by application performance, which is often specific to certain class of applications and also weakens the response capability of control systems. In this paper, a resource-use-status-driven resource reconfiguration scheme (RUSiC) is presented to automatically adapt to dynamic workload changes to meet the demands of application performance. According to the new characteristics introduced by system virtualization, the scheme is designed to be a two-layer resource reconfiguration model to exactly grasp the demands of applications. Based on real resource use status, the scheme adjusts proper resource configuration for applications in time. Furthermore, the scheme introduces power-saving into resource reconfiguration process and avoids considerable unnecessary power and cooling consumption by reducing the number of active physical nodes in a new resource configuration. Experiments demonstrate that the scheme can quickly detect and respond to shifting resource demands as application workloads change over time.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Virtual machine VCPU scheduling in the multi-core environment: Issues and challenges

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2011年第7期48卷 1216-1224页

作者： Jin, Hai Zhong, Alin Wu, Song Shi, Xuanhua Key Laboratory of Services Computing Technology and System Huazhong University of Science and Technology Ministry of Education Wuhan 430074 China Key Laboratory of Cluster and Grid Computing of Hubei Province Huazhong University of Science and Technology Wuhan 430074 China

The policies and mechanisms of VCPU (virtual CPU) scheduling in a virtual machine system are key factors to determine the system performance. Because the architecture of the software stack in the virtual machine system is different from the traditional computer systems, when scheduling the VCPUs in virtual machines, simply adopting scheduling strategies and algorithms of existing operating systems without any modifications can lead to drastic degradation of the system performance. Moreover, with the multi-core technology being employed for physical processors, the complexity of the VCPU scheduling is increased. Firstly, the architecture of the virtual machine system and its two-stage scheduling framework are depicted and analyzed in detail in this paper. Because the deterministic mapping relationship between application threads and physical cores is difficult to establish in the two-stage framework, and part functions of operating systems move down to virtual machine monitor, VCPU scheduling will confront many problems and challenges that mainly embody four aspects: the semantic gap between guest operating systems and a virtual machine monitor, the synchronization mechanisms in a multiprocessor operating system, the structure of shared cache in multi-core processors and emerging asymmetric multi-core structure. And then advantages and limitations of the existing solutions for these problems are discussed and analyzed deeply, and suggestions for further researches are presented.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：