
doi: 10.1007/bfb0002777
BSP is a model of parallel computation which employs global synchronisation as a means of ensuring that a set of communications has reached completion. The efficiency properties of the model have been widely investigated. In this paper the model's associated semantic framework is studied. An axiomatic treatment of global synchronisation is presented. The proof rule proposed for synchronisation is evaluated in the context of semantic frameworks for a general parallel process model and for data-parallel computation.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
