In recent years, the Massively Parallel Computation (MPC) model has gained significant attention. However, most distributed and parallel graph algorithms in the MPC model are designed for static ...

The GCA (global cellular automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical CA model. In ...

The team designed a fully dynamic APSP algorithm in the MPC model with low round complexity that is faster than all the existing static parallel APSP algorithms.

Real-time scheduling of parallel tasks in multiprocessor systems is a critical field that underpins the reliability and efficiency of modern computing in applications ranging from embedded systems ...