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

12th Annual IEEE International Symposium on Network Computing and Applications, NCA 2013

作者： Shi, Yangguang Zhang, Fa Liu, Zhiyong Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9780768550436

Energy efficiency is becoming an important issue in networks. Although some research works have been devoted to this topic, only a little attention has been paid to the stability of the network equipped with the energy conservation mechanisms. In fact, we find that the stability of networks can be undermined in the worst case if it isn't considered with care by the energy conservation *** this paper, we propose an energy-efficient scheduling protocol which can guarantee the stability of the network in all cases. We start by building a new model which can be used to verify the stability of the network equipped with the energy conservation mechanisms. With this model, we transform the packet scheduling problem to a Job Shop Scheduling problem. For this problem, we propose a time-stamp based work-conserving scheduling algorithm - G-FSA. Compared with existing methods, this scheduling algorithm guarantees a tighter bound on the make span of the jobs. Then, we integrate G-FSA with a time partition approach to generate our energy-efficient packet scheduling protocol. It is proved that the obtained protocol can guarantee the stability of network in all cases. And its approximation ratio in terms of energy efficiency can be bounded by O((1+ )) for any > 0, where is an input parameter depending on the hardware infrastructure. Typically, 1

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Parallelized Jaccard-Based Learning Method and MapReduce Implementation for Mobile Devices Recognition from Massive Network Data

引用

China Communications 2013年第7期10卷 71-84页

作者：刘军李银周 Felix Cuadrado Steve Uhlig 雷振明 Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Department of Electronic Engineering and Computer Science Queen MaryUniversity of London

The ability of accurate and scalable mobile device recognition is critically important for mobile network operators and ISPs to understand their customers' behaviours and enhance their user *** this paper,we propose a novel method for mobile device model recognition by using statistical information derived from large amounts of mobile network traffic ***,we create a Jaccardbased coefficient measure method to identify a proper keyword representing each mobile device model from massive unstructured textual HTTP access *** handle the large amount of traffic data generated from large mobile networks,this method is designed as a set of parallel algorithms,and is implemented through the MapReduce framework which is a distributed parallel programming model with proven low-cost and high-efficiency *** using real data sets show that our method can accurately recognise mobile client models while meeting the scalability and producer-independency requirements of large mobile network *** show that a 91.5% accuracy rate is achieved for recognising mobile client models from 2 billion records,which is dramatically higher than existing solutions.

关键词： mobile device recognition data mining Jaccard coefficient measurement distributed computing MapReduce

来源：评论

学校读者我要写书评

暂无评论

Formula-Oriented Compositional Minimization in Model Checking

Formula-Oriented Compositional Minimization in Model Checkin...

引用

2010 19th IEEE Asian Test Symposium(第19届IEEE亚洲测试技术学术会议 ATS 2010)

作者： Bowen Chen Haihua Shen Wenhui Zhang Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Acade Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Acade State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijin

This paper presents a new approach to reduce finite state machines with respect to a CTL formula to alleviate state explosion problem. Reduction is achieved by removing parts useless to the formula of original machines. The main contribution of this paper is to exploit relations among subformulas of the CTL formula so as to gain more reduction, as well as to extend traditional pruning method, which handles only existential formulas, to handle universal formulas. Based on this kind of reduction, verification of a large system, which usually consists of several components, can be done by evaluating properties on a reduced version of the system, which is built by composing components of the system one by one while doing reduction after each composition. Experimental results show the effectiveness of the approach. Especially when a property is written in a more detailed way, that is to describe the system part by part, the approach has a great potential.

关键词： Formula-Oriented Compositional Minimization CTL Model Checking Formal Verification

来源：评论

学校读者我要写书评

暂无评论

An efficient methodology for power modeling and simulation of modern cell-based microprocessors

An efficient methodology for power modeling and simulation o...

引用

Midwest Symposium on Circuits and systems (MWSCAS)

作者： Ge Zhang Weiwu Hu Institute of Computing Technology Key Laboratory of Computer System and Architecture Beijing China

This paper presents a methodology for high-level power modeling of cell-based processors. A flexible power model library, which can automatically generate detailed power data for actual circuits of each part of given processor, is developed and annotated dynamically for architecture-level power simulator. According to this method, the dynamic power, leakage power and even area and cell counts can be accurately estimated, and the preliminary power validation for a MIPS microprocessor proves our methodology to be effective and highly correlated, with only small errors comparing with the gate-level power analysis.

关键词： Microprocessors Circuit simulation Libraries Adders Circuit synthesis Power system modeling Analytical models Content addressable storage Power generation Flexible printed circuits

来源：评论

学校读者我要写书评

暂无评论

Effective Criterion Functions for Efficient Agglomerative Clustering on Very Large Networks

Effective Criterion Functions for Efficient Agglomerative Cl...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Yang Wang Mingyuan An Key Laboratory of Computer System and Architecture Chinese Academy and Sciences Beijing China

As the agglomerative clustering algorithm is widely used in data mining, image processing, bioinformatics and pattern recognition. it has attracted great interests from both academical and industrial communities. However, existing studies neglect the decisive factor of the efficiency of the agglomerative clustering algorithm for large complex networks and usually use criterion functions which lead to inefficiency. In this paper, we propose three effective criterion functions for improving performance of agglomerative clustering algorithm. We note that clustering efficiency is determined by two factors: a) the number of neighbors of two merged clusters in each merge step; b) the number of neighbors shared by the two clusters. Based on these observations, we propose a framework for designing criterion functions in order to efficiently find clusters in very large networks. We devise three criterion functions that can effectively control the number of neighbors of clusters, and they can efficiently produce high-quality clusters. We have implemented our method and compared with existing studies on real networks, and our method outperforms state-of-the-art approaches significantly on large networks.

关键词： Clustering algorithms Data mining computer networks computer architecture Content addressable storage Image processing Bioinformatics Pattern recognition computer industry Mining industry

来源：评论

学校读者我要写书评

暂无评论

Pattern-unit based regular expression matching with reconfigurable function unit

Pattern-unit based regular expression matching with reconfig...

引用

2010 International Conference on Computational Science and Its Applications, ICCSA 2010

作者： Cong, Ming An, Hong Cao, Lu Liu, Yuan Li, Peng Wang, Tao Yu, Zhi-Hong Liu, Dong School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Beijing 100190 China Intel China Research Center Beijing 100190 China

ISBN: (纸本)3642121888

Regular Expression (RE) is widely used in many aspects due to its high expressiveness, flexibility and compactness, which requires a high-performance and efficient matching method. A novel approach to accelerate RE pattern matching based on Pattern-Unit (PUREM) is proposed here, in which Pattern-Unit matching is accomplished by a Reconfigurable Function Unit (RFU). The RFU can be integrated into the pipeline of CPU architecture and shares matching jobs with software, without wrecking the compatibility of applications. Compared with other works, our approach offers a flexible mechanism under which hardware does NOT need to vary with RE patterns, and it holds the scalability that can be easily extended to most RE applications and software. For validation, the PUREM HW/SW system has been implemented on the Snort v2.8 and PCRE v7.6 applications. The experimental results show a significant speedup of 3~4x compared to the software performance on a 2GHz Pentium IV machine, where our RFU logic mapped onto Xilinx Virtex-5 XC5VLX50 only takes up 17% resource. © 2010 Springer-Verlag Berlin Heidelberg.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

A case study of improving at-speed testing coverage of a gigahertz microprocessor

A case study of improving at-speed testing coverage of a gig...

引用

2009 16th IEEE International Conference on Electronics, Circuits and systems, ICECS 2009

作者： Qi, Zichu Liu, Hui Li, Xiangku Xu, Jun Hu, Weiwu Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences PO Box 2704-25 Beijing 100190 China Beijing China Loongson Technologies Corporation Limited China

ISBN: (纸本)9781424450916

For a gigahertz microprocessor with multiple clock domains and a large amount of embedded RAMs (Random Access Memory), generating at-speed testing patterns is becoming very difficult and very time-consuming. This paper presents some novel techniques to improve at-speed testing coverage with low cost. These methods are major concern about preventing X states propagation, which include avoiding capturing X states for registers, sequential bypass of macros, clock control scheme for inter-clock domains and accurate analysis of exception paths in intra-clock domains. Functional patterns are utilized to further improv. The efficiency oy the at-speed testing. A novel optimal flow is presented by carefully selecting these techniques. By usin. The flow, 90% transition fault coverage is achieved. In addition, bot. The number of patterns an. The test time oy the transition test are decreased by 15%. The total area overhead is about a few hundreds of AND cells and has little timing impact oy the critical paths. © 2009 IEEE.

关键词： Random access storage

来源：评论

学校读者我要写书评

暂无评论

HPPNetSim: A parallel simulation of large-scale interconnection networks

HPPNetSim: A parallel simulation of large-scale interconnect...

引用

42nd Annual Simulation Symposium 2009, ANSS 2009, Part of the 2009 Spring Simulation Multiconference

作者： Cao, Zheng Xu, Jianwei Chen, Mingyu Zheng, Gui Lv, Huiwei Sun, Ninghui Institute of Computing Technology Chinese Academy of Sciences Beijing China Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Beijing China Graduate University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781617386404

As the scale of parallel machine grows, communication network is playing more important role than ever before. Communication affects not only execution time, but also scalability of parallel applications. Parallel interconnection network simulator is a suitable tool to study large-scale interconnection networks. However, simulating packet level communication on detailed cycle-to-cycle network models is a really challenge work. We implement a kernel-based parallel simulator HPPNetSim to solve problems. Optimistic PDES mechanism needs huge memory consumption of saving simulation entities' states in large-scale simulations, so we chose conservative synchronization approach. Simulation kernel and network models are all carefully designed. To accelerate process of simulation, optimizations are introduced, such as block/unblock synchronization, load balancing, dynamic look-ahead generation, and etc. Simulation examples and performance results show that both high accuracy and good performance are obtained in HPPNetSim. It achieves speedup of 19.8 for 32 processing nodes when simulating 36-port 3-tree fat-tree network.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Scheme for Trust Relationship Establishment in Ubiquitous Sensor Networks

A Lightweight Scheme for Trust Relationship Establishment in...

引用

International Conference on computer and Information Technology (CIT)

作者： Lei Xie Yongjun Xu Xiaowei Li Yuefei Zhu Institute of Information Engineering Information and Engineering University Zhengzhou China Advanced Test Technology Laboratory Key Laboratory of Computer System and Architecture Key Laboratory of Computer System and Architecture Chinese Academy and Sciences Beijing China

Ubiquitous sensor networks are application oriented system, which are composed of a large number of cooperative sensor nodes. The identification of individual sensor node is important especially for some security-sensitive applications. In this paper, we focus on the establishment of trust relationship among wireless sensor nodes, and try to combine the message authentication and identity authentication as a countermeasure to hostile attack. Accompanied with a simple lightweight key pre-distribution algorithm, in which each node sends only one message, we propose a lightweight trust relationship establishing scheme for ubiquitous sensor networks. The new scheme, which works without a trusted authority in the network, is not only concise in format but effective in practice to ensure network trusted and secure.

关键词： Authentication Protocols Pervasive computing Wireless sensor networks Information security Sensor systems and applications computer networks Ubiquitous computing Base stations Laboratories

来源：评论

学校读者我要写书评

暂无评论

VMGuard: An integrity monitoring system for management virtual machines

VMGuard: An integrity monitoring system for management virtu...

引用

16th IEEE International Conference on Parallel and Distributed systems, ICPADS 2010

作者： Fang, Haifeng Zhao, Yiqiang Zang, Hongyong Huang, H. Howie Song, Ying Sun, Yuzhong Liu, Zhiyong Graduate University of Chinese Academy of Sciences Beijing China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences China George Washington University WA United States

ISBN: (纸本)9780769543079

A cloud computing provider can dynamically allocate virtual machines (VM) based on the needs of the customers, while maintaining the privileged access to the Management Virtual Machine that directly manages the hardware and supports the guest VMs. The customers must trust the cloud providers to protect the confidentiality and integrity of their applications and data. However, as the VMs from different customers are running on the same host, an attack to the management virtual machine will easily lead to the compromise of the guest VMs. Therefore, it is critical for a cloud computing system to ensure the trustworthiness of management VMs. To this end, we propose VMGuard, an integrity monitoring and detecting system for management virtual machines in a distributed environment. VMGuard utilizes a special VM, Guard Domain, which runs on each physical node to monitor the co-resident management VMs. The integrity measurements collected by the Guard Domains are sent to the VMGuard server for safe store and independent analysis. The experimental evaluation of a Xen-based prototype shows that VMGuard can quickly detect the root kit attacks while the performance overhead is low. © 2010 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：