Algorithmic Completeness for BSP Languages
PROCEEDINGS 2018 INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING & SIMULATION (HPCS)(2018)
摘要
What is bulk-synchronous parallel (BSP) computing and is not? Behind this naive question, we can find complex formalisms. We first define a model that contain all BSP algorithms; This model comes with what is called abstract state machines (ASMs). Then, we prove, by using an operational semantics and a fair simulation, the algorithmic equivalence between an imperative language (with BSP routines) and the previous model. We finally give the intuition of an example that is not BSP complete.
更多查看译文
关键词
ASM, BSP, Semantics, Algorithm, Simulation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要