Structures of Computing explains the behavioral meaning of fundamental concepts of
computing from a practical viewpoint and in generic terms, unrestricted by specific …

Abstract “What is an algorithm?” is a fundamental question of computer science. Gurevich's
behavioural theory of sequential algorithms (aka the sequential ASM thesis) gives a partial …

Reflective algorithms are algorithms that can modify their own behaviour. Recently a
behavioural theory of reflective algorithms has been developed, which shows that they are …

We are interested in specifications which provide a consistent high-level view of systems.
They should abstract irrelevant details and provide a precise and complete description of the …

Within a distributed deep learning training system, variances in performance among
computing nodes, as well as the influence of external environmental factors, can result in …

” Structures of Computing” aims to explain the behavioural meaning of fundamental
concepts of computing without referring to any specific computing device or programming …

In a distributed deep learning system based on mobile service computing, there may be
differences in performance between computing nodes, which may be affected by the …

Abstract multi-bsp is a bridging model for algorithm design which takes into account
hierarchical architectures. We discuss two questions about multi-bsp algorithms and their …

MapReduce supports the processing of large data sets in parallel. It has been shown that
MapReduce is an example for the use of the bulk synchronous parallel (BSP) bridging …

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 …