检索结果-南通市图书馆

INTEGRABILITY AND linearizability FOR A CLASS OF CUBIC KOLMOGOROV SYSTEMS

Annals of Differential Equations 2010年第4期26卷 442-449页

作者： Qinlong Wang , Haitao Wu (School of Information and Mathematics, Yangtze University, Jingzhou 434023, Hubei)

The integrability and linearizability for a class of cubic Kolmogorov systems are studied. A recursive formula to compute the saddle quantities of the systems is deduced firstly, and integrable conditions for the systems are obtained. Then a recursive formula to compute the coefficients of the normal form for saddle points of the systems is also applied. Finally linearizable conditions of the origin for the systems are given. Both formulas to find necessary conditions are all linear and readily done using computer algebra system such as Mathematica or Maple, and some good methods are given to obtain the sufficient conditions.

关键词： cubic Kolmogorov system integrability linearizability

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Decidability of linearizabilities for relaxed data structures

引用

Science China(Information Sciences) 2018年第1期61卷 113-122页

作者： Chao WANG Yi LV Peng WU State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences

Many recent implementations of concurrent data structures relaxed their linearizability requirements for better performance and scalability. Quasi-linearizability, k-linearizability and regular-relaxed linearizability are three quantitative relaxation variants of linearizability that have been proposed as correctness conditions of relaxed data structures, yet preserving the intuition of linearizability. Quasi-linearizability has been proved undecidable. In this paper, we first show that k-linearizability is undecidable for a bounded number of processes, by reducing quasi-linearizability into it. We then show that regular-relaxed linearizability is decidable for a bounded number of processes. We also find that the number of the states of a relaxed specification is exponential to the number of the states of the underlying specification automaton(representing its relaxation strategy), and polynomial to the number of the states of the underlying quantitative sequential specification and the number of operations.

关键词： concurrent data structures quantitative relaxation linearizability decidability finite automata

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Fault-tolerant precise data access on distributed log-structured merge-tree

引用

Frontiers of Computer Science 2019年第4期13卷 760-777页

作者： Tao ZHU Huiqi HU Weining QIAN Huan ZHOU Aoying ZHOU School of Data Science and Engineering East China Normal University Shanghai 200062 China

Log-structured merge tree has been adopted by many distributed storage systems. It decomposes a large database into multiple parts: an in?writing part and several read-only ones. Records are firstly written into a memoryoptimized structure and then compacted into in-disk struc? tures periodically. It achieves high write throughput. However, it brings side effect that read requests have to go through multiple structures to find the required record. In a distributed database system, different parts of the LSM-tree are stored in distributed fashion. To this end, a server in the query layer has to issues multiple network communications to pull data items from the underlying storage layer. Coming to its rescue, this work proposes a precise data access strategy which includes: an efficient structure with low maintaining overhead designed to test whether a record exists in the in?writing part of the LSM-tree;a lease-based synchronization strategy proposed to maintain consistent copies of the structure on remote query servers. We further prove the technique is capable of working robustly when the LSM-Tree is re?organizing multiple structures in the backend. It is also fault-tolerant, which is able to recover the structures used in data access after node failures happen. Experiments using the YCSB benchmark show that the solution has 6x throughput improvement over existing methods.

关键词： distributed data storage log-structured merge tree linearizability fault tolerance

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：