Towards Refinement of Unbounded Parallelism in ASMs Using Concurrency and Reflection
International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ)(2021)
摘要
The BSP bridging model can be exploited to support MapReduce processing. This article describes how this can be realised using a work-stealing approach, where an idle processor can autonomously grab a thread from a partially ordered pool of open threads and execute it. It is further outlined that this can be generalised for the refinement of an unboundedly parallel ASM by a concurrent, reflective BSP-ASM, i.e. the individual agents are associated with reflective ASMs, i.e. they can adapt their own program.
更多查看译文
关键词
MapReduce,Work stealing,Reflection,Abstract State Machine,BSP bridging model
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要