Sciweavers

822 search results - page 30 / 165
» Contention in shared memory algorithms
Sort
View
IPPS
2006
IEEE
15 years 8 months ago
A segment-based DSM supporting large shared object space
This paper introduces a software DSM that can extend its shared object space exceeding 4GB in a 32bit commodity cluster environment. This is achieved through the dynamic memory ma...
Benny Wang-Leung Cheung, Cho-Li Wang
USENIX
1990
15 years 3 months ago
A New Design for Distributed Systems: The Remote Memory Model
This paper describes a new model for constructing distributed systems called the Remote Memory Model. The remote memory model consists of several client machines, one or more dedi...
Douglas Comer, Jim Griffioen
ARCS
2006
Springer
15 years 6 months ago
Adding Low-Cost Hardware Barrier Support to Small Commodity Clusters
The performance of the barrier operation can be crucial for many parallel codes. Especially distributed shared memory systems have to synchronize frequently to ensure the proper o...
Torsten Hoefler, Torsten Mehlan, Frank Mietke, Wol...
ANCS
2005
ACM
15 years 8 months ago
Fast and scalable pattern matching for content filtering
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
Sarang Dharmapurikar, John W. Lockwood
WDAG
2000
Springer
97views Algorithms» more  WDAG 2000»
15 years 6 months ago
Objects Shared by Byzantine Processes
Work to date on algorithms for message-passing systems has explored a wide variety of types of faults, but corresponding work on shared memory systems has usually assumed that only...
Dahlia Malkhi, Michael Merritt, Michael K. Reiter,...