Towards Refinement of Unbounded Parallelism in ASMs Using Concurrency and Reflection

被引：0

作者：

Jiang, Fengqing ^{[1
]}

Xiong, Neng ^{[1
]}

Lian, Xinyu ^{[1
]}

Gonzalez, Senen ^{[2
]}

Schewe, Klaus-Dieter ^{[1
]}

机构：

[1] Zhejiang Univ, UIUC Inst, Haining, Peoples R China

[2] TMConnected, Linz, Austria

来源：

RIGOROUS STATE-BASED METHODS, ABZ 2021 | 2021年 / 12709卷

关键词：

MapReduce; Work stealing; Reflection; Abstract State Machine; BSP bridging model;

D O I：

10.1007/978-3-030-77543-8_10

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：118 / 123

页数：6