具有计算域的可预测自组织

J. Beal, Mirko Viroli
{"title":"具有计算域的可预测自组织","authors":"J. Beal, Mirko Viroli","doi":"10.1109/SASOW.2014.9","DOIUrl":null,"url":null,"abstract":"In recent years, a number of different strands of research on self-organizing systems have come together to create a new \"aggregate programming\" approach to the engineering of distributed systems. Aggregate programming is motivated by a desire to avoid the notoriously intractable \"local to global\" problem, where the system designer must predict how to control individual devices to achieve a collective goal. Instead, the designer programs an abstraction of the collective, composing \"building block\" primitives from a library of special cases where the local-to-global problem is already solved. Unifying a number of the proposed aggregate programming approaches is the notion of a \"computational field\" that maps each device in the field's domain to a local value in its range. This concept was originally developed for spatial computers, in which communication and geometric position are closely linked, but can support effective aggregate programming of many non-spatial networks as well. A mathematical foundation for such approaches has been formalized recently with a minimal \"field calculus\" that appears to be an effective unifying model, covering a wide range of aggregate programming models, both continuous (e.g., geometry-based) and discrete (e.g., graph-based). On this foundation, restricted languages can ensure various desirable properties such as scalability, self-stabilization, and robustness to perturbation. By building up a sufficiently broad collection of composable \"building block\" distributed algorithms, it is possible to enable simple and rapid development of complex distributed systems that are implicitly scalable and resilient. The ultimate aim of this line of research is to make the programming of robust distributed systems as simple and widespread as single-processor programming, thereby enabling widespread increases in the reliability, efficiency, and democracy of our technological infrastructure.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Predictable Self-Organization with Computational Fields\",\"authors\":\"J. Beal, Mirko Viroli\",\"doi\":\"10.1109/SASOW.2014.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, a number of different strands of research on self-organizing systems have come together to create a new \\\"aggregate programming\\\" approach to the engineering of distributed systems. Aggregate programming is motivated by a desire to avoid the notoriously intractable \\\"local to global\\\" problem, where the system designer must predict how to control individual devices to achieve a collective goal. Instead, the designer programs an abstraction of the collective, composing \\\"building block\\\" primitives from a library of special cases where the local-to-global problem is already solved. Unifying a number of the proposed aggregate programming approaches is the notion of a \\\"computational field\\\" that maps each device in the field's domain to a local value in its range. This concept was originally developed for spatial computers, in which communication and geometric position are closely linked, but can support effective aggregate programming of many non-spatial networks as well. A mathematical foundation for such approaches has been formalized recently with a minimal \\\"field calculus\\\" that appears to be an effective unifying model, covering a wide range of aggregate programming models, both continuous (e.g., geometry-based) and discrete (e.g., graph-based). On this foundation, restricted languages can ensure various desirable properties such as scalability, self-stabilization, and robustness to perturbation. By building up a sufficiently broad collection of composable \\\"building block\\\" distributed algorithms, it is possible to enable simple and rapid development of complex distributed systems that are implicitly scalable and resilient. The ultimate aim of this line of research is to make the programming of robust distributed systems as simple and widespread as single-processor programming, thereby enabling widespread increases in the reliability, efficiency, and democracy of our technological infrastructure.\",\"PeriodicalId\":6458,\"journal\":{\"name\":\"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SASOW.2014.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SASOW.2014.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近年来,许多关于自组织系统的不同研究方向汇集在一起,为分布式系统的工程创造了一种新的“聚合编程”方法。聚合编程的动机是为了避免臭名昭著的棘手的“局部到全局”问题,即系统设计者必须预测如何控制单个设备以实现集体目标。相反,设计人员编写了一个集体抽象的程序,从已经解决了局部到全局问题的特殊情况库中组合“构建块”原语。将许多提议的聚合编程方法统一起来的是“计算域”的概念,它将域域中的每个设备映射到其范围内的局部值。这个概念最初是为空间计算机开发的,其中通信和几何位置紧密相连,但也可以支持许多非空间网络的有效聚合编程。最近,这种方法的数学基础已经被形式化了,一个最小的“场演算”似乎是一个有效的统一模型,涵盖了广泛的聚合规划模型,包括连续的(例如,基于几何的)和离散的(例如,基于图的)。在此基础上,受限语言可以确保各种理想的特性,如可伸缩性、自稳定性和对扰动的鲁棒性。通过构建一个足够广泛的可组合“构建块”分布式算法集合,可以简单快速地开发具有隐式可伸缩和弹性的复杂分布式系统。这条研究路线的最终目标是使健壮的分布式系统的编程像单处理器编程一样简单和广泛,从而使我们的技术基础设施的可靠性、效率和民主得到广泛的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Predictable Self-Organization with Computational Fields
In recent years, a number of different strands of research on self-organizing systems have come together to create a new "aggregate programming" approach to the engineering of distributed systems. Aggregate programming is motivated by a desire to avoid the notoriously intractable "local to global" problem, where the system designer must predict how to control individual devices to achieve a collective goal. Instead, the designer programs an abstraction of the collective, composing "building block" primitives from a library of special cases where the local-to-global problem is already solved. Unifying a number of the proposed aggregate programming approaches is the notion of a "computational field" that maps each device in the field's domain to a local value in its range. This concept was originally developed for spatial computers, in which communication and geometric position are closely linked, but can support effective aggregate programming of many non-spatial networks as well. A mathematical foundation for such approaches has been formalized recently with a minimal "field calculus" that appears to be an effective unifying model, covering a wide range of aggregate programming models, both continuous (e.g., geometry-based) and discrete (e.g., graph-based). On this foundation, restricted languages can ensure various desirable properties such as scalability, self-stabilization, and robustness to perturbation. By building up a sufficiently broad collection of composable "building block" distributed algorithms, it is possible to enable simple and rapid development of complex distributed systems that are implicitly scalable and resilient. The ultimate aim of this line of research is to make the programming of robust distributed systems as simple and widespread as single-processor programming, thereby enabling widespread increases in the reliability, efficiency, and democracy of our technological infrastructure.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Prosumers as Aggregators in the DEZENT Context of Regenerative Power Production A Hybrid Cross-Entropy Cognitive-Based Algorithm for Resource Allocation in Cloud Environments Artificial Immune System Driven Evolution in Swarm Chemistry Towards an Agent-Based Simulation Model for Schema Matching A Graph Analysis Approach to Detect Attacks in Multi-agent Systems at Runtime
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1