Sciweavers

559 search results - page 29 / 112
» Algorithms and Data Structures for External Memory
Sort
View
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
15 years 8 months ago
Priority Queues Resilient to Memory Faults
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
Allan Grønlund Jørgensen, Gabriel Mo...
IASTEDSEA
2004
15 years 3 months ago
Java bytecode verification with dynamic structures
Java applets run on a Virtual Machine that checks code's integrity and correctness before execution using a module called Bytecode Verifier. Java Card technology allows Java ...
Cinzia Bernardeschi, Luca Martini, Paolo Masci
CCR
2004
153views more  CCR 2004»
15 years 2 months ago
Tree bitmap: hardware/software IP lookups with incremental updates
IP address lookup is challenging for high performance routers because it requires a longest matching prefix at speeds of up to 10 Gbps (OC-192). Existing solutions have poor updat...
Will Eatherton, George Varghese, Zubin Dittia
113
Voted
IPPS
1998
IEEE
15 years 6 months ago
Managing Concurrent Access for Shared Memory Active Messages
Passing messages through shared memory plays an important role on symmetric multiprocessors and on Clumps. The management of concurrent access to message queues is an important as...
Steven Lumetta, David E. Culler
CPHYSICS
2006
124views more  CPHYSICS 2006»
15 years 2 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...