Sciweavers

95 search results - page 3 / 19
» Constructive, Deterministic Implementation of Shared Memory ...
Sort
View
ANCS
2009
ACM
13 years 3 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...
INFOCOM
2008
IEEE
13 years 11 months ago
Peacock Hashing: Deterministic and Updatable Hashing for High Performance Networking
—Hash tables are extensively used in networking to implement data-structures that associate a set of keys to a set of values, as they provide O(1), query, insert and delete opera...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley
ICDE
1999
IEEE
209views Database» more  ICDE 1999»
14 years 6 months ago
Parallel Classification for Data Mining on Shared-Memory Multiprocessors
We present parallel algorithms for building decision-tree classifiers on shared-memory multiprocessor (SMP) systems. The proposed algorithms span the gamut of data and task parall...
Mohammed Javeed Zaki, Ching-Tien Ho, Rakesh Agrawa...
DATE
2010
IEEE
137views Hardware» more  DATE 2010»
13 years 10 months ago
Deterministic, predictable and light-weight multithreading using PRET-C
—We present a new language called Precision Timed C, for predictable and lightweight multithreading in C. PRET-C supports synchronous concurrency, preemption, and a high-level co...
Sidharta Andalam, Partha S. Roop, Alain Girault
WDAG
1995
Springer
103views Algorithms» more  WDAG 1995»
13 years 8 months ago
Self-Stabilization of Wait-Free Shared Memory Objects
This paper proposes a general definition of self-stabilizing wait-free shared memory objects. The definition ensures that, even in the face of processor failures, every executio...
Jaap-Henk Hoepman, Marina Papatriantafilou, Philip...