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

13 years 8 months ago

Download eprints.iisc.ernet.in

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

Real-time Traffic

Distributed And Parallel Computing | Distributed Shared Memory | Eficient Scalable Algorithms | General Prefix | ICPADS 1997 |

claim paper

» Diagnosis of Active Systems

» Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems

» Larchant Persistence by Reachability in Distributed Shared Memory Through Garbage Collecti...

» Headbody partitioned string matching for Deep Packet Inspection with scalable and attackre...

» An efficient transactional memory algorithm for computing minimum spanning forest of spars...

» Configuration Independent Analysis for Characterizing SharedMemory Applications

» DagConsistent Distributed Shared Memory

» Efficient algorithms for verifying memory consistency

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1997
Where	ICPADS
Authors	V. Kamakoti, N. Balakrishnan

Comments (0)

Sciweavers

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

Distributed And Parallel Computing | Distributed Shared Memory | Eficient Scalable Algorithms | General Prefix | ICPADS 1997 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers