Sciweavers

3616 search results - page 211 / 724
» Conditional Memory Ordering
Sort
View
JPDC
2008
134views more  JPDC 2008»
15 years 6 months ago
Analyzing the performance of a cluster-based architecture for immersive visualization systems
Cluster computing has become an essential issue for designing immersive visualization systems. This paradigm employs scalable clusters of commodity computers with much lower costs...
Pedro Morillo, Aron Bierbaum, Patrick Hartling, Ma...
INFOCOM
2012
IEEE
13 years 8 months ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
166
Voted
IPPS
2008
IEEE
16 years 24 days ago
Parallel IP lookup using multiple SRAM-based pipelines
Pipelined SRAM-based algorithmic solutions have become competitive alternatives to TCAMs (ternary content addressable memories) for high throughput IP lookup. Multiple pipelines c...
Weirong Jiang, Viktor K. Prasanna
SPAA
1998
ACM
15 years 10 months ago
Lamport Clocks: Verifying a Directory Cache-Coherence Protocol
Modern shared-memory multiprocessors use complex memory system implementations that include a variety of non-trivial and interacting optimizations. More time is spent in verifying...
Manoj Plakal, Daniel J. Sorin, Anne Condon, Mark D...
201
Voted
ASPLOS
2010
ACM
15 years 9 months ago
Butterfly analysis: adapting dataflow analysis to dynamic parallel monitoring
Online program monitoring is an effective technique for detecting bugs and security attacks in running applications. Extending these tools to monitor parallel programs is challeng...
Michelle L. Goodstein, Evangelos Vlachos, Shimin C...