Efficient Algorithms for Prefix and General Prefix Computations on Distributed Shared Memory Systems with Applications

The paper presents eficient scalable algorithms for performing Prefix (PC) and General Prefix (GPC) Computations on a Distributed Shared Memory ( D S M ) system with applications.

• Type: Conference
• Year: 1997
• Where: ICPADS
• Authors: V. Kamakoti, N. Balakrishnan
• Keywords: Distributed And Parallel Computing, Distributed Shared Memory, Eficient Scalable Algorithms, General Prefix, ICPADS 1997