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

2010 International Conference in Information Science and Applications, ICISA 2010

作者： Fu, Hongyi Ding, Yan Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing National University of Defence Tech. Changsha Hunan 410073 China School of Computer National University of Defence Tech. Changsha Hunan 410073 China

ISBN: (纸本)9781424459438

As the wide application of multi-core processor architecture in the domain of high performance computing, fault tolerance for shared memory parallel programs becomes a hot spot of research. For years, checkpointing has been the dominant fault tolerance technology in this field, and recently, many research works have been engaged with it. However, to those programs which deal with large amount of data, checkpointing may induce massive I/O transfer, which will adversely affect scalability. To deal with such a problem, this paper proposes a fault tolerance approach, making use of redundancy, for shared memory parallel programs. Our scheme avoids saving and restoring computational state during the program's execution, hence does not involve I/O operations, so presents explicit advantage over checkpointing in scalability. In this paper, we introduce our approach and the related compiler tool in detail, and give the experimental evaluation result. ©2010 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

SemanticCast: Content-Based Data Distribution over Self-Organizing Semantic Overlay Networks

SemanticCast: Content-Based Data Distribution over Self-Orga...

引用

IEEE International Conference on parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Zhong Zheng Yijie Wang National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

Many applications demand distributing data with different contents efficiently in the network environment with unreliable links and a high node churn. Existing approaches mostly focus on optimizing either efficiency or robustness of data distribution, and fail to ensure both of them simultaneously. In this paper, we propose Semantic Cast - a content-based data distribution approach over self-organizing semantic overlay networks. Semantic Cast maintains a self-organizing semantic overlay based on view exchange (called Crowd). In Crowd, each node seeks neighbors with more similar interests by periodically exchanging its neighbor list (called view) with a chosen neighbor. Through these nodes' self-organizing behavior, various interest communities emerge in the overlay. For data distribution over Crowd, Semantic Cast adopts random walk to route data between interest communities, and adopts flooding to disseminate data inside the interested communities. The experimental results show that compared to existing approaches, Semantic Cast can support efficient content-based data distribution in the unreliable and highly dynamic network environment.

关键词： Semantics Peer to peer computing Communities Routing Robustness Convergence Subscriptions

来源：评论

学校读者我要写书评

暂无评论

Implementation of encrypted data for outsourced database

Implementation of encrypted data for outsourced database

引用

International Conference on Computational Intelligence and Natural computing, CINC

作者： Zheng-Fei Wang Ai-Guo Tang National Key Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China Department of Computer Hunan Business College Changsha China

ISBN: (纸本)9781424477050

Encryption technology has become an important mechanism of securing data stored in the outsourced database. However, it is a difficulty to query efficiently the encrypted data and many researchers take it into consideration. To solve the problem, an encrypted schema, based on the Postgresql DBMS, is proposed. Through the security dictionary and the extended SQL, the approach implements the encrypted storage and efficiently query over the encrypted data in the outsourced databases. Results of experiments validate the efficiency and feasibility of our approach.

关键词： Indexes Dictionaries Random access memory Catalogs Encryption

来源：评论

学校读者我要写书评

暂无评论

Routing with uncertainty in wireless mesh networks

Routing with uncertainty in wireless mesh networks

引用

International Workshop on Quality of Service

作者： Fajun Chen Jiangchuan Liu Zongpeng Li Yijie Wang Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing National University of Defense Technology China School of Computing Science Simon Fraser University Department of Computer Science University of Caglary

Existing routing protocols for Wireless Mesh Networks (WMNs) are generally optimized with statistical link measures, while not addressing on the intrinsic uncertainty of wireless links. We show evidence that, with the transient link uncertainties at PHY and MAC layers, a pseudo-deterministic routing protocol that relies on average or historic statistics can hardly explore the full potentials of a multi-hop wireless mesh. We study optimal WMN routing using probing-based online anypath forwarding, with explicit consideration of transient link uncertainties. We show the underlying connection between WMN routing and the classic Canadian Traveller Problem (CTP). Inspired by a stochastic recoverable version of CTP (SRCTP), we develop a practical SRCTP-based online routing algorithm under link uncertainties. We study how dynamic next hop selection can be done with low cost, and derive a systematic selection order for minimizing transmission delay. We conduct simulation studies to verify the effectiveness of the SRCTP algorithms under diverse network configurations. In particular, compared to deterministic routing, reduction of end-to-end delay (51.15~73.02%) and improvement on packet delivery ratio (99.76%) are observed.

关键词： Uncertainty Wireless mesh networks Delay Routing protocols Physical layer Statistics Stochastic processes Relays computer networks Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

A compact model for multi-island single electron transistors

A compact model for multi-island single electron transistors

引用

IEEE International Nanoelectronics Conference (INEC)

作者： Yaqing Chi Haiqin Zhong Chao Zhang Liang Fang National Key Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology Hunan China National University of Defense Technology Changsha Hunan CN

Multi-island single electron transistor (MISET) is a kind of single electron transistor (SET), which has advantages of the room temperature operating. A novel semi-empirical compact model for MISET is proposed. The new approach combines the orthodox theory of single electron tunneling for single Coulomb island and a novel empirical analysis for a chain of Coulomb islands. The model is verified by the Monte-Carlo method in SIMON simulator, and is much faster than the traditional multi-island SET simulator, which has the advantages for the large scale multi-island SET circuit simulation.

关键词： Single electron transistors Circuit simulation Tunneling Large-scale systems Voltage Temperature Character generation Electrodes distributed processing Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Using Redundant Threads for Fault Tolerance of OpenMP Programs

Using Redundant Threads for Fault Tolerance of OpenMP Progra...

引用

International Conference on Information Science and Applications (ICISA)

作者： Hongyi Fu Yan Ding Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China Section #620 School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781424459421

关键词： Fault tolerance Checkpointing Scalability Hardware Application software Multicore processing High performance computing Laboratories distributed processing

来源：评论

学校读者我要写书评

暂无评论

A distributed approach to consistent order delivery of concurrent events in asynchronous DVEs

ICETC 2010 - 2010 2nd International Conference on Education ...

引用

ICETC 2010 - 2010 2nd International Conference on Education Technology and computer 2010年 4卷 V495-V498页

作者： Zhou, Hangjun Zhang, Wei Peng, Yuxing Li, Sikun Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha Hunan 410073 China Department of Information Management Hunan College of Finance and Economics Changsha Hunan 410205 China

ISBN: (纸本)9781424463688

In large-scale asynchronous distributed virtual environments(DVEs), one of the difficult problems is to deliver the concurrent events in a consistent order at each node. Generally, the previous consistency control approaches can be classified into two categories: causal order and time stamped order. However, causal order approaches can merely preserve the cause-effect relation of events and time stamped order approaches seem intrinsically complex to be used in serverless large-scale asynchronous DVEs. In this paper, we proposed a novel distributed algorithm to identify the concurrent events and preserve the consistent order delivery of them at different nodes. Simulation studies are also carried out to compare the performance of this algorithm with that of the previous ones. The results show that the new algorithm can effectively deliver the concurrent events in consistent order at each node and is more efficient than the previous algorithms in large-scale asynchronous DVEs. © 2010 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

A consistency algorithm for causal and totally ordered event delivery in DVE

A consistency algorithm for causal and totally ordered event...

引用

International Conference on computer Science and Information Technology (CSIT)

作者： Hangjun Zhou Wei Zhang Yuxing Peng Sikun Li Department of Information Management Hunan College of Finance and Economics Changsha Hunan China Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha Hunan China

How to preserve causal and totally ordered event delivery is an important issue in real-time serverless DVE(distributed Virtual Environment). However, most of the related works are designed to maintain causal order merely or time stamped order with intensive computation and bandwidth overhead. In this paper, we proposed a novel distributed algorithm to maintain the before-and-after relationship between events, both causal and concurrent, of DVE at each individual node. Several simulation experiments are carried out to evaluate the performance of our algorithm and the results demonstrate that the algorithm is effective in preserving causal and totally ordered event delivery and more efficient than the previous algorithms.

关键词： Artificial neural networks Silicon Educational institutions

来源：评论

学校读者我要写书评

暂无评论

HyperSpring: Accurate and stable latency estimation in the hyperbolic space

HyperSpring: Accurate and stable latency estimation in the h...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Fu, Yongquan Wang, Yijie National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology China

ISBN: (纸本)9780769539003

Predicting network latencies between Internet hosts can efficiently support large-scale Internet applications, e.g., file sharing service and the overlay construction. Several study use the Hyperbolic space to model the Internet densecore and many-tendril structure. However, existing Hyperbolic space based embedding approaches are not designed for accurate latency estimation in the distributed context. We present HyperSpring, which estimates latency by modelling a mass spring system in the Hyperbolic similar with Vivaldi. HyperSpring adopts coordinate initialization to speed up the convergence of coordinate computation, uses multiple-round symmetric updates to escape from bad local minima, and stabilizes coordinates by compensating RTT measurements to reduce the coordinate drifts. Evaluation results based on a network trace of 226 PlanetLab nodes indicate that, compared to Euclidean-space based Vivaldi, HyperSpring provides performance improvements for most nodes, and incurs slightly higher distortions for a small number of nodes. © 2009 IEEE.

关键词： Hyperbolic space Latency estimation Mass spring field

来源：评论

学校读者我要写书评

暂无评论

iRank: Supporting proximity ranking for peer-to-peer applications

iRank: Supporting proximity ranking for peer-to-peer applica...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Fu, Yongquan Wang, Yijie National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology China

ISBN: (纸本)9780769539003

Proximity ranking according to end-to-end network distances (e.g., Round-Trip Time, RTT) can reveal detailed proximity information, which is important in network management and performance diagnosis in distributed systems. However, to the best of our knowledge, there has been no similar work on this subject in the P2P computing field. We present a distributed rating method iRank, that enables proximity rankings by providing discrete ratings in a distributed manner. It formulates the proximity ranking as a rating problem that faithfully captures the proximity based on noisy distance measurements scalably and practically. The primary challenge in inferring proximity rankings is enforcing distributed ratings with complex rating policies. Our solution is based on reconstructing ratings by decomposing a centralized rating method Maximum Margin Matrix Factorization (MMMF) into independent sub-problems, that can be efficiently solved in a decentralized manner. By relaxing the dependence on infrastructure nodes that are a single point of failure and limit scalability, iRank can gracefully handle network churns. Through real network latency data sets, we demonstrate that iRank can predict ratings with low distortion, which are smaller than 20 percentage worse than the centralized method, in the context of synthetic complex rating policies. © 2009 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：