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

The prediction model based on RBF network in achieving elastic cloud

Advances in Information Sciences and Service Sciences 2011年第11期3卷 67-78页

作者： Shi, Peichang Wang, Huaimin Ding, Bo Liu, Ran Wang, Tianzuo National Laboratory for Parallel and Distributed Processing School of Computer and Science National University of Defense Technology China Department of Electronics and Information Engineering Huazhong University of Science Technology China

Cloud needs to have rapid and elastic resources supply capability, because of the fluctuant resources demand of end-users. Multi-scale resources elastic binding is an important method to provide cloud services with rapid and elastic service capability. The most challenging problem in multi-scale resources elastic binding is how to predict the dynamic resource demand of end-users, and then decide when and to what extent multi-scale resources need elastic binding based on the prediction. In this paper, we present the prediction model based on RBF (Radial Basis Function) Network, which is used to predict end-users resource demand in advance. Compared with current prediction methods, it has faster prediction speed and higher prediction accuracy. Then we use traces data (the bandwidth demand of Web type of cloud services) collected from a real-world cloud provider: ChinaCache, as the training and testing data set to validate the method. Finally, we evaluate the predicted results using general prediction accuracy metrics. The results prove that the prediction model based on RBF network is able to resolve the decision problem in multi-scale resources elastic binding.

关键词： Radial basis function networks

来源：评论

学校读者我要写书评

暂无评论

Semantic web service composition using answer set planning

引用

International Journal of Advancements in Computing Technology 2011年第5期3卷 20-31页

作者： Qian, Jun-Yan Huang, Guo-Wang Zhao, Ling-Zhong National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China Department of Computer science and engineering Guilin University of Electronic Technology Guilin 541004 China

This paper presents a method that adapting planning description to bring the semantic information into play for service composition through action language C. It shows how service descriptions can be expressed by preconditions and effects and the action language C provides a richer syntax and semantic for complex service descriptions. We also presents the algorithm of Translating semantic Web service described by OWL-S to action language C. Thanks to the structured description and the powerful expression of C, we only consider the initial Situation and the desired goal ignoring details of transition and planning. At last we use satisfiability planning to solve the planning problem by translating the action language into disjunctive logic program.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Efficient Approach for Repeated Patterns Mining Based on Indent Shape of HTML Documents

Efficient Approach for Repeated Patterns Mining Based on Ind...

引用

International Conference on Cyber-Enabled distributed Computing and Knowledge Discovery, CyberC

作者： Yanxu Zhu Gang Yin Huaimin Wang Dianxi Shi Xiang Rao Lin Yuan School of computer National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China College of Electronic Technology Information Engineering University Zhengzhou Henan China

Mining of repeated patterns from HTML documents is the key step towards Web-based data mining and knowledge extraction. Many web crawling applications need efficient repeated patterns mining techniques to generate their wrapper automatically. Existing approaches such as tree matching and string matching can detect repeated patterns with high precision, but their performance is still a challenge for practical web crawling applications. In this paper, we propose an efficient approach for mining repeated patterns based on indent shape of HTML document. Indent shape is a novel and simple model of HTML document, in which tandem repeated waves have strong association with the repeated patterns to be detected. By scanning an indent shape with a horizontal indent-line from bottom to top, the tandem repeated waves are identified by filtering the wave segments with low self-similarities. After that the boundary of HTML code corresponding to repeated patterns can be identified, which could be transformed to regular expressions formal-defined easily. Extensive experiments on two practical data sets retrieved from Internet show that our approach achieves high efficiency significantly, and its precision performance is also generally better than the existing approaches.

关键词： Shape HTML Data mining Web pages Vectors Visualization Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient scheduling algorithm for sporadic real-time tasks in multiprocessor systems

An energy-efficient scheduling algorithm for sporadic real-t...

引用

13th IEEE International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th IEEE International Conference on HPCC 2011

作者： Zhang, Dong-Song Chen, Fang-Yuan Li, Hong-Hua Jin, Shi-Yao Guo, De-Ke National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China School of Computing Science Simon Fraser University 8888 University Drive Burnaby BC V5A 1S6 Canada National Laboratory for Information System Engineering School of Information Systems and Management National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769545387

As the energy consumption of embedded multiprocessor systems becomes increasingly prominent, the real-time energy-efficient scheduling in multiprocessor systems becomes an urgent problem to reduce the system energy consumption while meeting real-time constraints. For a multiprocessor with independent DVFS and DPM at each processor, this paper proposes an energy-efficient real-time scheduling algorithm named LRE-DVFS-EACH, based on LRE-TL which is an optimal real-time scheduling algorithm for sporadic tasks. LRE-DVFS-EACH utilizes the concept of TL plane and the idea of fluid scheduling to dynamically scale the voltage and frequency of processors at the initial time of each TL plane as well as the release time of a sporadic task in each TL plane. Consequently, LRE-DVFS-EACH can obtain a reasonable tradeoff between the real-time constraints and the energy saving. LRE-DVFS-EACH is also adaptive to the change of workload caused by the dynamic release of sporadic tasks, which can obtain more energy savings. The experimental results show that compared with existing algorithms, LRE-DVFS-EACH can not only guarantee the optimal feasibility of sporadic tasks, but also achieve more energy savings in all cases, especially in the case of high workloads. © 2011 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

An efficient two-level bitmap index for cloud data management

An efficient two-level bitmap index for cloud data managemen...

引用

International Conference on Communication Software and Networks, ICCSN

作者： Huang Bin Peng Yu-Xing School of Computer Science Wuhan University of China Wuhan China National Laboratory of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. To fully harness the power of the Cloud, efficient data management is needed to handle huge volumes of data and support a large number of concurrent end users. To achieve that, a scalable and high-throughput indexing scheme is generally required. Such an indexing scheme must support parallel search to improve scalability. In this paper, we present a bitmap based indexing scheme for efficient data processing in the Cloud. Our approach can be summarized as follows. First, we build a local bitmap index for each compute node which only indexes data residing on the node. Second, we organize the compute nodes as a structured overlay and each node maintains a portion of the global index for the whole different data. The global index is also bitmap index to indicate the node each data resides in. Third, all bitmaps are compressed by adopting run-length coding for reducing storage requirement. We conduct extensive experiments on a LAN, and the results demonstrate that our indexing scheme is dynamic, efficient and scalable.

关键词： TV

来源：评论

学校读者我要写书评

暂无评论

Scheduling in wireless ad hoc networks with successive interference cancellation

Scheduling in wireless ad hoc networks with successive inter...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Shaohe Lv Weihua Zhuang Xiaodong Wang Xingming Zhou National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China Department of Electrical and Computer Engineering University of Waterloo Waterloo ONT Canada

ISBN: (纸本)9781424499199

Successive interference cancellation (SIC) is an effective way of multipacket reception (MPR) to combat interference in wireless networks. To understand the potential MPR advantages, we study link scheduling in an ad hoc network with SIC at the physical layer. The fact that the links detected sequentially by SIC are correlated at the receiver poses key technical challenges. We characterize the link dependence and propose simultaneity graph (SG) to capture the effect of SIC. Then interference number is defined to measure the interference of a link. We show that scheduling over SG is NP-hard and the maximum interference number bounds the performance of maximal greedy schemes. An independent set based greedy scheme is explored to efficiently construct a maximal feasible schedule. Moreover, with careful selection of link ordering, we present a scheduling scheme that improves the bound. The performance is evaluated by both simulations and measurements in testbed. The throughput gain is on average 40% and up to 120% over IEEE 802.11. The complexity of SG is comparable with that of conflict graph, especially when the network size is not large.

关键词： Interference Silicon carbide Receivers Schedules Protocols Wireless networks Scheduling

来源：评论

学校读者我要写书评

暂无评论

Managing Data-Objects in Dynamically Reconfigurable Caches

引用

Journal of computer Science & Technology 2010年第2期25卷 232-245页

作者：杨学军吴俊杰曾坤唐玉华 National Laboratory for Parallel and Distributed Processing School of ComputerNational University of Defense Technology

The widening gap between processor and memory speeds makes cache an important issue in the computer system design. Compared with work set of programs, cache resource is often rare. Therefore, it is very important for a computer system to use cache efficiently. Toward a dynamically reconfigurable cache proposed recently, DOOC （Data- Object Oriented Cache）, this paper proposes a quantitative framework for analyzing the cache requirement of data-objects, which includes cache capacity, block size, associativity and coherence protocol. And a kind of graph coloring algorithm dealing with the competition between data-objects in the DOOC is proposed as well. Finally, we apply our approaches to the compiler management of DOOC. We test our approaches on both a single-core platform and a four-core platform. Compared with the traditional caches, the DOOC in both platforms achieves an average reduction of 44.98% and 49.69% in miss rate respectively. And its performance is very close to the ideal optimal cache.

关键词： cache data-object data reuse data-object oriented cache （DOOC） graph coloring

来源：评论

学校读者我要写书评

暂无评论

Toward Optimal Deployment of Communication-Intensive Cloud Applications

Toward Optimal Deployment of Communication-Intensive Cloud A...

引用

IEEE International Conference on Cloud Computing, CLOUD

作者： Pei Fan Ji Wang Zibin Zheng Michael R. Lyu National Laboratory for Parallel & Distributed Processing National University of Defense Technology Changsha China Department of Computer Science & Engineering Chinese University of Hong Kong Hong Kong China

Strongly promoted by the leading industrial companies, cloud computing becomes increasingly popular in re-cent years. The growth rate of cloud computing surpasses even the most optimistic predictions. A cloud application is a large-scale distributed system that consist a lot of distributed cloud nodes. How to make optimal deployment of cloud applications is a challenging research problem. When deploying a cloud application to the cloud environment, cloud node ranking is one of the most important approaches for selecting optimal cloud nodes for the cloud application. Traditional ranking methods usually rank the cloud nodes based on their QoS values, without considering the communication performance between cloud nodes. However, such kind of node relationship is very important for the communication-intensive cloud applications (e.g., Message Passing Interface (MPI) programs), which have a lot of communications between the selected cloud nodes. In this paper, we propose a novel clustering-based method for selecting optimal cloud nodes for deploying communication-intensive applications to the cloud environment. Our method not only takes into account the cloud node qualities, but also the communication performance between different nodes. We deploy several well-known MPI programs on a real-world cloud and compare our method with other methods. The experimental results show the effectiveness of our cluster-based method.

关键词： Time factors Cloud computing Benchmark testing Quality of service Servers Clustering algorithms Databases

来源：评论

学校读者我要写书评

暂无评论

The dynamic allocation model for the resources of cloud services delivery networks

引用

Jisuanji Xuebao/Chinese Journal of computers 2011年第12期34卷 2305-2318页

作者： Shi, Pei-Chang Wang, Huai-Min Yin, Gang Liu, Xue-Ning Yuan, Xiao-Qun Shi, Dian-Xi National Laboratory for Parallel and Distributed Processing School of Computer and Science National University of Defense Technology Changsha 410073 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Department of Electronics and Information Engineering Huazhong Univ. of Sci. and Technol. Wuhan 430074 China

Cloud Services Delivery Networks (CSDN) constructs a layer distributed server overlay over the Internet, which uses the way to the nearest and on-demand approach providing services to end users. Facing the scale and diversification of the resource demand characteristics of the Internet cloud services, CSDN forms different logical sub-server overlay for different kinds of cloud services. However, most servers and bandwidth resources of CSDN are used to deliver the streaming and downloading kind of cloud services, and the dynamic allocation of their delivery resource is the main research emphasis in this paper. This paper first models the problem to be a multi-dimensional facility location problem, according to the two characteristics: the memory resource and bandwidth resource of this kind of application are the bottleneck resource;the hot contents of this kind of application can be delivered using the Peer-to-Peer mechanisms. After the model analyzed and its NP-Complete proved, we then propose a heuristic algorithm. Finally, using the service delivery cost savings as the performance metrics, while the actual system's operation trace is as the input, the effectiveness of the algorithm are comprehensively assessed.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

LD: A Polynomial Time Algorithm for Tree Isomorphism

引用

Procedia Engineering 2011年 15卷 2015-2020页

作者： Baida Zhang Yuhua Tang Junjie Wu Shuai Xu National laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan 410073 P. R. China Department of Information Engineering Academy of Armored Force Engineering Beijing 100000 P.R.China

Graph isomorphism problem has always been mathematics and engineering technology community concern, the reason mainly from two aspects: First, in theory, is generally believed that the problem is NP-complete problem; Second, the graph isomorphism the problem with good prospects, in chemistry, operations research, computer science, electronics, network theory has applications in many fields, but the exponential complexity of the algorithm and the algorithm itself makes the limitations applicable to the object involved with complex graphics the application of structure is difficult to determine the start. In this paper, class tree is proposed based on the node to delete the exact graph isomorphism problem, you can quickly determine the graph isomorphism problem, and theoretical analysis and experiments show that the algorithm can determine the class in polynomial time tree isomorphism problem.

关键词： Graph Isomorphism LD algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：