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

RECOVERY POINT SELECTION ON A REVERSE BINARY-TREE TASK MODEL

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1989年第8期15卷 963-976页

作者： CHEN, SK TSAI, WT THURAISINGHAM, MB UNIV MINNESOTA DEPT COMP SCIMINNEAPOLISMN 55455 MITRE CORP BEDFORDMA 01730

In this paper we analyze the complexity of placing recovery points where the computation is modeled as a reverse binary tree task model. The objective is to minimize the expected computation time of a program in the presence of faults. The method can be extended to an arbitrary reverse tree model. For uniprocessor systems, we propose an optimal placement algorithm. For multiprocessor systems, we describe a procedure to compute its performance. Since no closed form solution is available, we propose an alternative measurement which has a closed form formula. Based upon this formula, we devise algorithms to solve the recovery point placement problem. The estimated formula can be extended to include communication delays where the algorithm devised still applies. [ABSTRACT FROM AUTHOR]

关键词： aigorithms placement algorithm recovery block.

来源：评论

学校读者我要写书评

暂无评论

Testing graphs for colorable properties

Testing graphs for colorable properties

引用

2001 Operating Section Proceedings, American Gas Association

作者： Fischer, Eldar NEC Research Institute 4 Independence Way Princeton NJ

ISBN: (纸本)0898714907

Let P be a property of graphs. An -test for P is a randomized algorithm which, given the ability to make gueries whether a desired pair of vertices of an input graph G with n vertices are adjacent or not, distinguishes, with high probability, between the case of G satisfying P and the case that it has to be modified by adding and removing more than (n 2) edges to make it satisfy P. The property P is called testable, if for every D there exists an -test for P whose total number of guéries is independent of the size of the input graph. Goldreich, Goldwasser and Ron [7] showed that certain graph properties, like k-colorability, admit an -test. In [2] a first step towards a logical characterization of the testable graph properties was made by proving that all first order properties of type " " are testable while there exist first order graph properties of type "" which are not testable. For proving the positive part, it was shown that all properties describable by a very general type of coloring problem are testable. While this result is tight from the standpoint of first order expressions, further steps towards the characterization of the testable graph properties can be taken by considering the coloring problem instead. It is proven here that other classes of graph properties, describable by various generalizations of the coloring notion used in [2], are testable, showing that this approach can broaden the understanding of the nature of the testable graph properties. The proof combines some generalizations of the methods used in [2] with additional methods. Copyright © 2009 ACM, Inc.

关键词： aigorithms Theory Verification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：