arrow
返回

Dynamic asynchronous iterations

delete2022-06-01
delete1
delete
OA
AI
M
Matthew L. Daggitt *
T
Timothy G. Griffin
DOI:10.1016/j.jpdc.2022.03.013delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Many problems can be solved by iteration by multiple participants (processors, servers, routers etc.). Previous mathematical models for such asynchronous iterations assume a single function being iterated by a fixed set of participants. We will call such iterations static since the system's configuration does not change. However in several real-world examples, such as inter-domain routing, both the function being iterated and the set of participants change frequently while the system continues to function. In this paper we extend uresin and Dubois's work on static iterations to develop a model for this class of dynamic or always on asynchronous iterations. We explore what it means for such an iteration to be implemented correctly, and then prove two different conditions on the set of iterated functions that guarantee the full asynchronous iteration satisfies this new definition of correctness. These results have been formalised in Agda and the resulting library is publicly available. (C) 2022 Elsevier Inc. All rights reserved.
Keyword:
Asynchronous computation
Iteration
Fixed points
Formal verification
Agda
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Journal of Parallel and Distributed Computing 封面图
Journal of Parallel and Distributed Computing
IF:
4
论文数:
3.8K
被引数:
4.8K

机构

U
University of Cambridge
学者数:
7.7W
论文数: 7.1W
被引数: 13.7W
引用论文

引用论文

Denitrification in a Grassed and a Wooded, Valley and Ridge, Riparian Ecotone
err1996-11-01
err0
PREAI
errR. R. Schnabel; L. F. Cornish; W. L. Stout; J. A. Shaffer
err分享
err收藏
err分享
err收藏
没有更多内容