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

2010 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

作者： Xiang, Liping Xu, Yinlong Lui, John C. S. Chang, Qian Univ Sci & Technol China Sch Comp Sci & Technol Hefei Peoples R China

ISBN: (纸本)9781450302111

Modern storage systems use thousands of inexpensive disks to meet the storage requirement of applications. To enhance the data availability, some form of redundancy is used. For example, conventional RAID-5 systems provide data availability for single disk failure only, while recent advanced coding techniques such as row-diagonal parity (RDP) can provide data availability with up to two disk failures. To reduce the probability of data unavailability, whenever a single disk fails, disk recovery (or rebuild) will be carried out. We show that conventional recovery scheme of RDP code for a single disk failure is inefficient and suboptimal. In this paper, we propose an optimal and efficient disk recovery scheme, Row-Diagonal Optimal recovery (RDOR), for single disk failure of RDP code that has the following properties: (1) it is read optimal in the sense that it issues the smallest number of disk reads to recover the failed disk;(2) it has the load balancing property that all surviving disks will be subjected to the same amount of additional workload in rebuilding the failed disk. We carefully explore the design state space and theoretically show the optimality of RDOR. We carry out performance evaluation to quantify the merits of RDOR on some widely used disks.

关键词： RAID recovery RDP code disk failure recovery algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal recovery of Single Disk Failure in RDP Code Storage Systems 10

Optimal Recovery of Single Disk Failure in RDP Code Storage ...

引用

SIGMETRICS 2010

作者： Liping Xiang Yinlong Xu John C.S. Lui Qian Chang University of Science and Technology of China Hefei China The Chinese University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9781450300384

关键词： RAID recovery RDP code disk failure recovery algorithm

来源：评论

学校读者我要写书评

暂无评论

A computationally efficient energy-aware multicast tree recovery algorithm for ad hoc network

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2003年第9期E86B卷 2701-2708页

作者： Ng, JM Sridharan, S Low, CP Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore

Multicasting is an efficient communication tool for use ill multi-point applications such as conferencing and information distribution. Ill ad hoc networks, node mobility causes frequent changes of network topology, and re-construction of the multicast, tree in all efficient and effective manner becomes a critical issues. In case of link breakage, most of the multicast tree construction protocols available presently require either a total re-build of the tree or to reconnect a disjoined node back to the multicast tree via the shortest path which may disrupt, the, optimising factors, such as energy consumption delay Or Cost, Used ill the building of the original tree. Ill this papers we introduce a computationally efficient recover algorithm which will also minimise the power consumption oil the tree.

关键词： ad hoc networks multicast tree recovery algorithm

来源：评论

学校读者我要写书评

暂无评论

Resource pre-reservation algorithm for intelligent optical networks

Resource pre-reservation algorithm for intelligent optical n...

引用

International Symposium on Communications and Information Technologies (ISCIT2005)

作者： Li, H Lu, YM Ji, YF Beijing Univ Posts & Telecommun Sch Telecommun Engn Beijing 100088 Peoples R China

ISBN: (纸本)0780395387

Intelligent optical networks support real-time automatic connection configuration and recovery, which give rise to another new set of problems, such as the unsureness of resource reservation and the uncertainty of connection recovery. In view of those facts, we examine current optical network protection and restoration schemes, and propose a connection survivable resource reservation algorithm based on fault simulation. By automatic simulating one link failure or multi share risk link group failures combination, this algorithm can allocate enough backup resources, which make the networks can survive any 1 similar to 3 node or link failures.

关键词： network planning recovery algorithm resource allocation network optimization intelligent optical networks

来源：评论

学校读者我要写书评

暂无评论

A new profile recovery algorithm with high lateral resolution using spline smoothing

A new profile recovery algorithm with high lateral resolutio...

引用

7th International Symposium on Laser Metrology Applied to Science, Industry and Everyday Life

作者： Liu, X Gao, Y Hong Kong Univ Sci & Technol Dept Mech Engn Kowloon Hong Kong Peoples R China

ISBN: (纸本)0819446866

A new method, to improve the lateral resolution of differential profile measurement is proposed, together with a related profile recovery algorithm. In this method, the lateral resolution will not be constrained to the distance between two differential probes. It-can be a fraction of the distance and is affected by the. scanning resolution. In the corresponding algorithm to recover a profile, d is the probes distance, d(r) is the scanning resolution, and d(r) = d/N, where N is the number of groups separated from, the difference data set. Integration is applied to every group to build a profile. Finally, spline smoothing regression is used to the profiles to find translations between them to obtain the whole profile. Computer stimulation was used to examine the effectiveness of the proposed recovery algorithm and good accuracy was achieved.

关键词： differential-profiler spline smoothing recovery algorithm

来源：评论

学校读者我要写书评

暂无评论

A recovery algorithm for Self-Stabilizing Communication Protocols

引用

Journal of Systems Engineering and Electronics 2000年第1期11卷 38-46页

作者： Li Layuan & Li Chunlin (Department of Computer Science & Technology, Wuhan nansportation University, 430063, P. R. China) Department of Computer Science & Technology Wuhan Transportation University 430063 P. R. China

This paper presents a recovery algorithm for self-stabilizing communication protocols. It first describes some concepts and a formal description method for the algorithm. Then it proposes the algorithm procedures, proves its correctness and analyses its complexity. Finally, it also verifies the availability and efficiency of the algorithm by illustrating an example protocol with multi-processes.

关键词： Computer networks Communication protocols recovery algorithm Self-stabilization Multimedia communication networks.

来源：评论

学校读者我要写书评

暂无评论

一种实时内存数据库恢复算法

一种实时内存数据库恢复算法

引用

第二十届全国数据库学术会议

作者：覃飙王建民刘云生清华大学软件学院华中科技大学计算机学院

1.引言实时数据库系统(RTDBS)的一个基本特征就是事务具有显示定时限制,传统的磁盘数据库系统(DDBS)由于访问磁盘数据需要I/O,而导致事务处理时间不可预测,因此DDBS很难保证实时事务的

关键词： Real-time main memory database Real-time transactions recovery algorithm

来源：评论

学校读者我要写书评

暂无评论

Session level rollback recovery

Session level rollback recovery

引用

7th IEEE International Symposium on Computers and Communications

作者： Ciuffoletti, A Univ Pisa Dipartimento Informat I-56100 Pisa Italy

ISBN: (纸本)0769516718

The problem of rollback recovery is traditionally approached using a model oriented to packet delivery. Instead, we introduce a model centered around complex sessions, and we explain why this model is more appropriate. Using this model, we extract a basic coordination scheme that is common to the three distributed activities that compose rollback recovery: checkpointing, rollback and disposal. The basic coordination scheme is refined to describe each of the three activities.

关键词： distributed control checkpointing algorithm recovery algorithm checkpoint disposal algorithm quasi-synchronous coordination consistent cut

来源：评论

学校读者我要写书评

暂无评论

A recovery algorithm for chain graphs

引用

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING 1997年第2-3期17卷 265-293页

作者： Studeny, M Institute of Information Theory and Automation Academy of Sciences of the Czech Republic Prague Czech Republic

The class of chain graphs (CGs) involving both undirected graphs (=Markou networks) and directed acyclic graphs (= Bayesian networks) was introduced in middle eighties for description of probabilistic conditional independence structures. Every class of Markov equivalent CGs (that is, CGs describing the same conditional independence structure) has a natural representative which is called the largest CG. The paper presents a recovery algorithm which on the basis of the conditional independence structure given by a CG (in the form of a dependency model) finds the largest CG representing the corresponding class of Markov equivalent CGs. As a by-product a graphical characterization of graphs which are the largest CGs (for a class of Markov equivalent CGs) is obtained, and a simple algorithm changing every CG into the largest CG of the corresponding equivalence class is given. (C) 1997 Elsevier Science Inc.

关键词： chain graph dependency model Markov equivalence pattern largest chain graph recovery algorithm

来源：评论

学校读者我要写书评

暂无评论

PROJECTION-BASED SPATIALLY ADAPTIVE RECONSTRUCTION OF BLOCK-TRANSFORM COMPRESSED IMAGES

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 1995年第7期4卷 896-908页

作者： YANG, YY GALATSANOS, NP KATSAGGELOS, AK NORTHWESTERN UNIV DEPT ELECT ENGN & COMP SCI EVANSTON IL 60208 USA

At the present time, block-transform coding is probably the most popular approach for image compression, For this approach, the compressed images are decoded using only the transmitted transform data, In this paper, we formulate image decoding as an image recovery problem, According to this approach, the decoded image is reconstructed using not only the transmitted data but, in addition, the prior knowledge that images before compression do not display between-block discontinuities. A spatially adaptive image recovery algorithm is proposed based on the theory of projections onto convex sets. Apart from the data constraint set, this algorithm uses another new constraint set that enforces between-block smoothness, The novelty of this set is that it captures both the local statistical properties of the image and the human perceptual characteristics, A simplified spatially adaptive recovery algorithm is also proposed, and the analysis of its computational complexity Is presented, Numerical experiments are shown that demonstrate that the proposed algorithms work better than both the JPEG deblocking recommendation and our previous projection-based image decoding approach.

关键词： .image recovery approach for image reconstructed using Compressed Images decoded image between-block recovery algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：