Corelab Seminar

Christina Karousatou (NTUA)
BSP Algorithms for the Algebraic Path Problem

The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. We will analyze different BSP algorithms for solving the algebraic path problem - a problem that generalizes some matrix problems, graph problems and regular language problems- and a special instance of the problem, the all-pairs shortest path computation.