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

2008 Conference on computing Frontiers, CF'08

作者： Jin, Hai Tao, Yongcai Wu, Song Shi, Xuanhua Cluster and Grid Computing Lab. Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781605580777

Current grid information service is centralized or hierarchical and proves inefficient as grid scale rapidly increases. The introduction of P2P techniques into grids breaks an encouraging path. However, frequent join and departure of resource nodes require strong self-organization capacity of system to maintain their rigid structure. Moreover, arranging identifier space for P2P nodes is knotty and has great impact on system performance. If the identifier space is too large, some nodes will be overloaded. On the contraiy, small identifier space will bring the same problem as millennium bug. To address the issues, this paper proposes a scalable DHT-based (Distributed Hash Table) Information Service (DIS) for grid system, which organizes grid resources into a DHT ring based on VO (Virtual Organization). To save the identifier space while retaining the scalability and system performance, only stable VOs can join DIS via a new DHT node, whereas volatile VOs join DIS through being the sub-domain of other VO. Experimental results show that DIS provides rapid resource query, strong scalability and high throughput, meanwhile avoiding the key node failure as well as the bottleneck problem. Copyright 2008 ACM.

关键词： grid computing

来源：评论

学校读者我要写书评

暂无评论

An efficient metadata management method in large distributed storage systems 1

引用

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

作者： Ran, Longbo Jin, Hai Cluster and Grid Computing Lab. Services Computing Technology and System Laboratory Huazhong University of Science and Technology 430074 Wuhan China

ISBN: (数字)9789400721050

ISBN: (纸本)9789400721043

Efficient metadata management is a critical aspect of overall system performance in large distributed storage systems. Directory subtree partitioning and traditional hashing are two common techniques used for managing metadata in such systems, but both have some shortcomings, for example, in directory subtree partitioning method, the root node easily becomes a bottleneck, and for traditional hashing, a large directory hierarchy must be maintained and traversed. In this paper, we present a new method called directory-level-based metadata management that has high efficiency while avoiding the shortcomings of traditional methods. © 2011 Springer Science+Business Media B.V.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

A survey of cloud resource management for complex engineering applications

引用

Frontiers of Computer Science 2016年第3期10卷 447-461页

作者： Haibao CHEN Song WU Hai JIN Wenguang CHEN Jidong ZHAI Yingwei LUO Xiaolin WANG Services Computing Technology and System Lab Cluster and Grid Computing LabSchool of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China Institute of High Performance Computing Tsinghua University Beijing 100084 China School of Electronics Engineering and Computer Science Peking University Beijing 100871 China School of Computer and Information Engineering Chuzhou University Chuzhou 239000 China

Traditionally, complex engineering applications （CEAs）, which consist of numerous components （software） and require a large amount of computing resources, usu- ally run in dedicated clusters or high performance computing （HPC） centers. Nowadays, Cloud computing system with the ability of providing massive computing resources and cus- tomizable execution environment is becoming an attractive option for CEAs. As a new type on Cloud applications, CEA also brings the challenges of dealing with Cloud resources. In this paper, we provide a comprehensive survey of Cloud resource management research for CEAs. The survey puts forward two important questions： 1） what are the main chal- lenges for CEAs to run in Clouds？ and 2） what are the prior research topics addressing these challenges？ We summarize and highlight the main challenges and prior research topics. Our work can be probably helpful to those scientists and en- gineers who are interested in running CEAs in Cloud envi- ronment.

关键词： Cloud computing complex engineering application resource management virtualization

来源：评论

学校读者我要写书评

暂无评论

Anysee2: An auto load balance P2P live streaming system with hybrid architecture (work-in-progress) 2

Anysee2: An auto load balance P2P live streaming system with...

引用

2nd International Conference on Scalable Information systems, InfoScale 2007

作者： Huang, Qi Jin, Hai Liu, Ke Liao, Xiaofei Tu, Xuping Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781595937575

Nowadays, Peer-to-Peer technology has been widely used in live streaming applications and many related systems are proposed. However, their single overlay design and unbalanced scheduling methods lead to some inefficiency including high control overhead and bad playback experience. This paper mainly discusses how to address these certain problems. We introduce a hybrid architecture to solve the locality problem and reduce the control overhead. We also propose a scheduling method to achieve load balance. All solutions are implemented in Anysee2.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Runtime-aware adaptive scheduling in stream processing

Runtime-aware adaptive scheduling in stream processing

引用

作者： Liu, Yuan Shi, Xuanhua Jin, Hai Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Long-running stream applications usually share the same fundamental computational infrastructure. To improve the efficiency of data processing in stream processing systems, a data analysis operator could be partitioned into n parallel tasks. The partitioned tasks are usually deployed on m nodes coexisting with other application operators. Because the node performance can vary in unpredictable ways (i.e., (1) stream input rates may fluctuate and (2) computational resource availability varies as other applications are affected), the nodes have different processing steps, and the slow node determines the operator performance. Hence, the tasks should be redistributed at runtime for stream applications to meet their strict latency requirements. Our key idea is to redistribute the tasks to the best node dynamically adaptive to resource or load fluctuations. In this paper, we present a runtime-aware adaptive schedule mechanism that aims at minimizing the operator processing latency and minimizing the latency difference between different nodes' tasks. We propose a new abstraction called performance cost ratio (PCR) that evaluates the node performance. The higher the node's PCR is, the less cost the node will pay for processing one tuple, and the more tasks should be deployed on it. In a scheduling, we first sort tasks descendingly by their loads and sort nodes by their PCR. Then we reassign the amount of computation according to the node's PCR to keep the node's PCR and its input rate the same or in similar proportion in all PCRs. The PCR-based quantitative algorithm applies itself to make tasks loads quantized to the processing capacity of nodes, move the minimum amount of operator's tasks, and keep the tasks local at the same time. We have implemented a runtime-aware adaptive scheduler as an extension to Storm and evaluated this strategy. We achieve the optimization goal using less computational resources. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wil

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Efficient multiple-reference temporal error concealment algorithm based on H.264/AVC 2nd

Efficient multiple-reference temporal error concealment algo...

引用

2nd International Conference on Human Centered computing, HCC 2016

作者： Yu, Chen Cheng, Chao Jin, Hai Zhou, Jingli Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319318530

Temporal error concealment at the video communication receiver recovers damaged blocks using temporal information redundancy. To enhance the quality of reconstructed image, a multiple-reference temporal error concealment algorithm based on H.264/AVC was proposed. Firstly, a pre-concealment is implemented to improve video frame;then the fractional pixel boundary matching algorithm and search algorithm are used to evaluate the candidate motion vectors from a number of reference frames, and the motion vector (MV) giving the minimum boundary matching distortion (MBMD) is selected as optimal motion vector;finally it is used to recover the damaged block and the video frame quality can be improved further. For various video sequences and different macro-block loss ratio, experimental results show that the proposed algorithm is significantly better than traditional temporal error concealment algorithms such as BMA and BM from both objectively and subjectively. At the loss ratio of 10 %, improvements of the proposed algorithm are more than 0.8~3.7 dB compared to that of other algorithms. © Springer International Publishing Switzerland 2016.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Secure cryptographic functions via virtualization-based outsourced computing

Secure cryptographic functions via virtualization-based outs...

引用

作者： Qiang, Weizhong Zhang, Kang Dai, Weiqi Jin, Hai Services Computing Technology and System Lab and Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Cryptographic functions, such as encryption/decryption libraries, are common and important tools for applications to enhance confidentiality of the data. However, these functions could be compromised by subtle attacks launched by untrusted operating system or other applications, and sensitive keys or cryptographic procedures could then be compromised. In this paper, based on virtualization technology, we propose a novel approach that outsources the cryptographic functions in one virtual machine (VM) into another dedicated VM, so that sensitive keys and the cryptographic procedures are only contained by this VM with specific purpose. We also propose a prototype, called cryptographic function assurance (CFA), to enhance the security of cryptographic functions. Taking OpenSSL as an example, CFA allows those applications that use OpenSSL library to transparently utilize CFA to protect the cryptographic functions. We present the detailed implementation, as well as the security analysis of CFA. We also give the performance evaluation for OpenSSL's interfaces and Apache httpd, to show the overhead caused by the integration of CFA. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

CDMCR: multi-level fault-tolerant system for distributed applications in cloud

CDMCR: multi-level fault-tolerant system for distributed app...

引用

作者： Qiang, Weizhong Jiang, Changqing Ran, Longbo Zou, Deqing Jin, Hai Services Computing Technology and System Lab and Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Cloud provides users with a new model of utilizing the computing infrastructure with the ability to perform parallel and distributed computations using elastic virtual cluster. However, the multi-level and complex features make cloud computing system more prone to failure. In this paper, we present a multi-level fault-tolerant system for distributed applications in cloud named Distributed-application oriented Multi-level Checkpoint/Restart for Cloud (CDMCR). The CDMCR system backups the complete state of applications periodically with a snapshot-based distributed checkpointing protocol, including file system state. Thus, we cannot only recover processes but also rollback data. A multi-level recovery strategy is proposed, which includes process-level recovery, virtual machine recreation, and host rescheduling, enabling comprehensive and efficient fault tolerance for different components in cloud. We deploy CDMCR as PaaS, so that users can be liberated from node management and system configuration and get access to fault-tolerant service conveniently. We have implemented this system based on the Xen virtualization platform and the OpenNebula cloud platform. Experiments on the prototype demonstrate the correctness of the system. Analysis shows that CDMCR does not cause message loss or data loss, and the backup time remains nearly constant as the number of nodes increases on virtual cluster. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.

关键词： Copyrights

来源：评论

学校读者我要写书评

暂无评论

Parallel bloom filter on xeon phi many-core processors 15th

Parallel bloom filter on xeon phi many-core processors

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Ni, Sheng Guo, Rentong Liao, Xiaofei Jin, Hai Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319271217

Bloom filters are widely used in databases and network areas. These filters facilitate efficient membership checking with a low false positive ratio. It is a way to improve the throughput of bloom filter by parallel processing. Common many-core processors such as Xeon Phi can provide high parallelism. Thus, we build an iterative model to analyze memory access performance. This performance suggests that the bottleneck in the traditional design is mainly caused by synchronization cost and memory latency on many-core platforms. Therefore, we propose a parallel bloom filter (PBF), which is a lockless method involving input data preprocessing. This method reduces synchronization overhead and improves cache locality. We also implement and evaluate PBF on a Xeon Phi processor. Results show that the memory access performance is three times better than that of the counting bloom filter. PBF provides improved scalability, and the speedup ratio can reach a maximum of 80.7x. © Springer International Publishing Switzerland 2015.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

A new approach for vehicle recognition and tracking in multi-camera traffic system 15th

A new approach for vehicle recognition and tracking in multi...

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Jiang, Wenbin Lu, Zhiwei Jin, Hai Chi, Ye Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319271361

In order to ensure recognition accuracy, intelligent traffic video tracking system usually requires various types of information. Therefore, multi-features fusion becomes a good choice. In this paper, a new recognition approach for vehicle types based multi-feature fusion is proposed, which is used for vehicle tracking in a multi-camera traffic system. An improved Canny operator is presented for edge detection. SURF (Speeded Up Robust Features) is used for local feature extraction. To improve the performance of distance cal- culation between features, a refined method based on Hellinger kernel is put forward. A position constraint rule is applied to reduce unnecessary fake matchings. Finally, the information of vehicle types combined with LBP (Local Binary Pattern), HOG (Histogram of Oriented Gradients) is used for a multi-camera vehicle tracking platform, which adopts Hadoop to realize the parallel computing of the system. Experimental results show that the proposed approach has good performance for the platform. © Springer International Publishing Switzerland 2015.

关键词： Local binary pattern

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：