Sciweavers

Share
ICPADS
1997
IEEE

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

9 years 4 months ago
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.
V. Kamakoti, N. Balakrishnan
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1997
Where ICPADS
Authors V. Kamakoti, N. Balakrishnan
Comments (0)
books