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

COOPERATIVE DISTRIBUTED ALGORITHMS FOR DYNAMIC CYCLE PREVENTION

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1987年第5期13卷 540-552页

作者： KATZ, S SHMUELI, O MCC DATABASE PROGRAM AUSTINTX 78759

Parallel distributed algorithms are introduced for adding and deleting edges in a directed graph without creating a cycle. These algorithms are useful for a variety of problems in distributed systems, such as preventing deadlock or ordering priorities. The algorithms operate in a realistic asynchronous computer network environment in which there are many possible interactions among overlapping instances of the algorithms. The distributed algorithms are obtained from a sequential algorithm. In formulating distributed versions of the algorithm from a sequentional version, the crucial role of an invariant is emphasized. Global correctness of the distributed algorithms depends upon (locally) preserving this invariant. Thus, the correctness of the algorithms is proven relatively easily. Interactions and cooperation between various activations of the algorithms are exploited to minimize redundant computation. A restricted freezing mechanism, definitive reranking, is shown to be incorporated easily into the proposed schemes.

关键词： Distributed Systems Concurrent programming

来源：评论

学校读者我要写书评

暂无评论

A flexible architectural study methodology

A flexible architectural study methodology

引用

International Workshop on Graph Reduction, 1986

作者： Tighe, Steven Zink, Ken Brice, Richard Alexander, William Parallel Processing Program MCC United States Database Program MCC United States

ISBN: (纸本)9783540184201

An efficient emulation/simulation system for evaluating architectures and scheduling strategies for reduction systems is described. Execution traces of example programs are generated by the emulator. The execution method of the emulator exercises all possible parallelism available in the execution model under study. The trace of each program execution is then reduced to an "architecturally neutral" precedence graph. The precedence graph can then be used repeatedly in simulations to study the effects of changes in architecture or scheduling strategy. © 1987, Springer-Verlag.

关键词： Architecture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：