The paper presents efficient scalable algorithms for performing prefix (PC) and general prefix (GPC) computations on a distributed shared memory, (DSM) system with applications. PC and GPC are generic techniques that can be used to design sequential and parallel algorithms for a number of problems from diverse areas (K. Arvind et al., 1995; V. Kamakoti and C. Pandurangan, 1992).
['V. Kamakoti', 'N. Balakrishnan']
Efficient algorithms for prefix and general prefix computations on distributed shared memory systems with applications