Towards Refinement of Unbounded Parallelism in ASMs Using Concurrency and Reflection

Abstract

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.

Document

If you cannot see the document below, the PDF document is most likely not freely accessible. In this case, please try to access the document via this link.

Reference

% BibTex
@inproceedings{JiangXLGS21,
  author       = {Fengqing Jiang and
                  Neng Xiong and
                  Xinyu Lian and
                  Sen{\'{e}}n Gonz{\'{a}}lez and
                  Klaus{-}Dieter Schewe},
  editor       = {Alexander Raschke and
                  Dominique M{\'{e}}ry},
  title        = {Towards Refinement of Unbounded Parallelism in ASMs Using Concurrency
                  and Reflection},
  booktitle    = {Rigorous State-Based Methods - 8th International Conference, {ABZ}
                  2021, Ulm, Germany, June 9-11, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12709},
  pages        = {118--123},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-77543-8\_10},
  doi          = {10.1007/978-3-030-77543-8\_10},
  timestamp    = {Wed, 09 Jun 2021 12:14:31 +0200},
  biburl       = {https://dblp.org/rec/conf/asm/JiangXLGS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}