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

16th IEEE Pacific Rim International Symposium on Dependable computing, PRDC 2010

作者： Wang, Ying Zhang, Lei Han, Yinhe Li, Huawei Li, Xiaowei Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China Graduate University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769542898

Large scale Chip-Multiprocessors (CMPs) generally employ Network-on-Chip (NoC) to connect the last level cache (LLC), which is generally organized as distributed NUCA (non-uniform cache access) arrays for scalability and efficiency. On the other hand, aggressive technology scaling induces severe reliability problems, causing on-chip components (e.g., cores, cache banks, routers) failure due to manufacture defects or on-line hardware faults. Typical degradable CMPs should possess the ability to work around defects by disabling faulty components. For static NUCA architecture, when cache banks attached to a computing node are disabled, however, certain physical address sections will no longer be accessible. Prior approaches such as sets reduction introduced in Intel Xeon processor 7100 series enable turning off cache banks by masking certain sets bits in physical address1, which greatly wastes cache capacity. In this paper, we propose to tackle the above problem in a finer granularity to restrict the capacity loss in NUCA cache. Cache accesses to isolated nodes are redirected based on the utility-driven address remapping scheme that reduces data blocks conflicts in fault-tolerant shared-LLC. We evaluate our technique using GEMS simulator. Experimental results show that address remapping achieves significant improvement over the conventional cache sizing scheme. © 2010 IEEE.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Task allocation for maximizing reliability of distributed computing systems using honeybee mating optimization

引用

Journal of systems and Software 2010年第11期83卷 2165-2174页

作者： Kang, Qin-Ma He, Hong Song, Hui-Min Deng, Rong Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China School of Information Engineering Shandong University at Weihai 180 Wenhua Xilu Weihai 264209 China School of Mathematics and Statistics Shandong University at Weihai Weihai 264209 China

This paper deals with the problem of task allocation (i.e,;to which processor should each task of an application be assigned) in heterogeneous distributed computing systems with the goal of maximizing the system reliability. The problem of finding an optimal task allocation is known to be NP-hard in the strong sense. We propose a new swarm intelligence technique based on the honeybee mating optimization (HBMO) algorithm for this problem. The HBMO based approach combines the power of simulated annealing, genetic algorithms with a fast problem specific local search heuristic to find the best possible solution within a reasonable computation time. We study the performance of the algorithm over a wide range of parameters such as the number of tasks, the number of processors, the ratio of average communication time to average computation time, and task interaction density of applications. The effectiveness and efficiency of our algorithm are demonstrated by comparing it with recently proposed task allocation algorithms for maximizing system reliability available in the literature. © 2010 Elsevier Inc. All rights reserved.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

Progressive ranking and composition of web services with interaction relationship

Journal of Software

引用

Journal of Software 2010年第8期5卷 842-850页

作者： Yuan, Jianjun Jiang, Changjun Jiang, Zuowen The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

service-oriented computing is a new software development paradigm that allows application developers to select available services from the Internet and to form new web services. A main problem is how to efficiently determine the most appropriate web services that will be combined into an application based on their functionalities, licensing costs, and reliability. Bryce et al. make use of the group testing results, and then progressively select the best component WS to construct the composite service by using interaction testing. However, they consider only pair-wise (2-way) interaction among any two component WS. In really composite service, there are not always interactions among any component WS, and some component WS may need Nway (N >2) testing since there is a closer relationship among them. We extend the model of interaction testing for WS with interaction relationship and propose a greedy algorithm for constructing variable covering arrays with bias. Experimental results show that our approach can cover more important interactions among web services earlier. © 2010 ACADEMY PUBLISHER.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Bayesian cognitive trust model based self-clustering algorithm for MANETs

引用

Science China(Information Sciences) 2010年第3期53卷 494-505页

作者： WANG Wei1,2,3 & ZENG GuoSun1,2,31Department of Computer Science & technology, Tongji University, Shanghai 200092, China 2Tongji Branch, National Engineering & technology Center of High Performance Computer, Shanghai 200092, China 3key Loboratory of Embedded system and service computing, Ministry of Education, Shanghai 200092, China 1. Department of Computer Science & Technology Tongji University Shanghai 200092 China2. Tongji Branch National Engineering & Technology Center of High Performance Computer Shanghai 200092 China3. Key Loboratory of Embedded System and Service Computing Ministry of Education Shanghai 200092 China

With the introduction of mobile Ad hoc networks (MANETs), nodes are able to participate in a dynamic network which lacks an underlying infrastructure. Before two nodes agree to interact, they must trust that each will satisfy the security and privacy requirements of the other. In this paper, using the cognition inspired method from the brain informatics (BI), we present a novel approach to improving the search efficiency and scalability of MANETs by clustering nodes based on cognitive trust mechanism. The trust relationship is formed by evaluating the level of trust using Bayesian statistic analysis, and clusters can be formed and maintained autonomously by nodes with only partial knowledge. Simulation experiments show that each node can form and join proper clusters, which improve the interaction performance of the entire network. The essence of the underlying reason is analyzed through the theory of complex networks, revealing great scalability of this method.

关键词： trust model MANET self-clustering Bayesian method cognitive mobile

来源：评论

学校读者我要写书评

暂无评论

A pervasive service discovery strategy based on peer to peer model

A pervasive service discovery strategy based on peer to peer...

引用

作者： Zhang, De-Gan Chen, Xu-Yan Li, Chao Li, Lin-Qing Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin University of Technology 300191 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology 300191 China

ISBN: (纸本)9780955529337

In order to improve the efficiency of service discovery in the pervasive environment, this paper presents a new strategy of service discovery based on p2p network model. Reference the ring topology of chord algorithm and tbe algorithm used by DDT, tbe traditional single finger-table witch be maintained by each node in the ring will be changed into double finger-table: the Neigbbor-Finger-Table and Long-distance Finger-Table. The structure of the Neighbor-Finger-Table is the same as the traditional single finger-table's. The Long-distance Finger-Table can construct small-world network. Some similar algorithm uses random method to select remote access node, the new strategy is different from that, tbrough tbe calculation of the local node, it can ensure the scope of service can cover tbe entire network. The simulation shows the algorithm can effectively reduce the path length of service discovery, improve the service success rate, and control the path length of magnitude.

关键词： Small-world networks

来源：评论

学校读者我要写书评

暂无评论

A new method for image fusion based on fuzzy neural network

A new method for image fusion based on fuzzy neural network

引用

作者： Zhang, De-Gan Wang, Yuan-Yuan Liu, Wei-Wei Zhang, Xiao-Li Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin University of Technology 300191 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology 300191 China

ISBN: (纸本)9780955529337

In pervasive computing paradigm, the image data obtained by a variety of multimedia, information equipment. In order to make use of these information reasonably and efficiently, a new method for image fusion based on fuzzy neural network has presented in this paper. It can fuse massive data from the multi-sensor image. Here, fuzzy neural network is a paraDel information processing model, there are more adaptive and self-organization, and can accomplish the complexity of real-time computing and mass data retrieval, it demonstrate its unique superiority of image understanding, pattern recognition and the handling of incomplete information. The fuzzy neural network system developed by us can be used in multi- sensor image fusion. Based on our experiments, it has been proved that the fusion is fast, effective, and can meet the real-time requirements of pervasive computing.

关键词： Fuzzy neural networks

来源：评论

学校读者我要写书评

暂无评论

Design and realization of mobile government information services platform based on SMS

Design and realization of mobile government information serv...

引用

作者： Wang, Fayu Zhang, Hua Xu, Guangping Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Ministry of Education Tianjin University of Technology 300191 Tianjin China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology 300191 Tianjin China

ISBN: (纸本)9788988678251

As the development of mobile communication technology becomes gradual mature, the short message service which sends messages from the information platform to the mobile phone users has been a method for the most users to obtain information timely and conveniently. This thesis collates the short message service system exploited for the mobile phone users and the service platform for the network users to elaborate the function of the platform and the system structure of the short message platform briefly, and state the key technology of its design and operation minutely. The short message platform is consisted of a web server based on the database, a sending server and interface server. This platform employs three-level control tactics, the user, role and administrator to regulate the user's authority and guarantee the security of the system. So the system has a certain referent value for the design of such kind of short message platform.

关键词： Cellular telephones

来源：评论

学校读者我要写书评

暂无评论

GVE: Godson-T verification engine for many-core architecture rapid prototyping and debugging

GVE: Godson-T verification engine for many-core architecture...

引用

2010 International Conference on Field-Programmable technology, FPT'10

作者： Lei, Zhengmeng Zhang, Lunkai Song, Fenglong Tang, Shibin Fan, Dongrui Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781424489817

In this paper, we present a Godson-T Verification Engine (GVE) to rapidly prototype and debug our Godson-T many-core processor design. GVE adopts the state-of-the-art hardware platform which contains 6 Xilinx Virtex-5 LX330 FPGAs, thus permitting us to map our many-core processor and peripheral devices into it. Besides the hardware, our toolkit Godson-T Studio provides the compiler, program loader, debugger and monitor to fulfil the purpose of developing, profiling and debugging, while the accuracy loss problem is settled by our novel techniques: Check-point and ILA-Check, presented in this paper. To our experience, GVE greatly reduces the verification cycle due to its high execution speed, for example, it finishes thousands of testcases in an hour, where the software-based approach takes few days to run. And by the help of the checkpoint framework, we can easily locate the faults. Because of these features, GVE makes a great contribution to the 16-tile Godson-T tape-out Project. © 2010 IEEE.

关键词： Verification

来源：评论

学校读者我要写书评

暂无评论

Fast path selection for testing of small delay defects considering path correlations

Fast path selection for testing of small delay defects consi...

引用

28th IEEE VLSI Test Symposium, VTS10

作者： He, Zijian Lv, Tao Li, Huawei Li, Xiaowei Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University of the Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781424466481

Statistical timing models have been proposed to describe delay variations in very deep sub-micro process technologies, which have increasingly significant influence on circuit performance. Under a statistical timing model, testing of a path can detect potential delay failures caused by different small delay defects. Due to path correlations, the potential delay failures captured by two different paths overlap between each other more or less. It is difficult to find a given number of paths that can capture most potential delay failures. In this paper, the path selection problem is converted to a minimal space intersection problem, and a greedy path selection heuristics is proposed, the key point of which is to calculate the probability that the paths in a specified path set all meet the delay constraint. Statistical timing analysis technologies and heuristics are used in the calculation. Experimental results show that the proposed approach is time-efficient and achieves a higher probability of capturing delay failures in comparison with conventional path selection approaches. ©2010 IEEE.

关键词： Defects

来源：评论

学校读者我要写书评

暂无评论

Software-Based Self-Testing of Processors Using Expanded Instructions

Software-Based Self-Testing of Processors Using Expanded Ins...

引用

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

作者： Ying Zhang Xiaowei Li Huawei Li 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

In this paper, an automatic test instruction generation (ATIG) technique using expanded instructions is presented for software-based selftesting (SBST) of processors. First, mappings between expanded instructions and signals are obtained through data mining, and they are used to impose value ranges of expanded instructions on component signals and generate instruction-level constraints. Second, virtual circuits are established based on the instruction-level constraints, and test patterns are generated for the constrained components. Third, test patterns are translated into test instructions according to the values of controlling signals and constraints for their mappings to instructions, and an SBST program is produced after assembling the test instructions. Experimental results on the Parwan processor show that the proposed ATIG technique can achieve 94.8％ stuck-at fault coverage, which is close to that of the full-scan test generation method. In addition, it can cut down 57％ test volume of the previous random pattern generation based SBST technique, while the test time reduces to one thirteenth of the previous SBST technique.

关键词： Software-Based Self-Test Automatic Test Instruction Generation Instruction-Level Constraint On-Line Test

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：