Sciweavers

36 search results - page 2 / 8
» Efficient bulk insertion into a distributed ordered table
Sort
View
PODC
2003
ACM
13 years 11 months ago
Split-ordered lists: lock-free extensible hash tables
We present the first lock-free implementation of an extensible hash table running on current architectures. Our algorithm provides concurrent insert, delete, and find operations ...
Ori Shalev, Nir Shavit
NSDI
2010
13 years 7 months ago
Cheap and Large CAMs for High Performance Data-Intensive Networked Systems
We show how to build cheap and large CAMs, or CLAMs, using a combination of DRAM and flash memory. These are targeted at emerging data-intensive networked systems that require mas...
Ashok Anand, Chitra Muthukrishnan, Steven Kappes, ...
DSOM
2006
Springer
13 years 10 months ago
Efficient Information Retrieval in Network Management Using Web Services
Abstract. Web Services is an XML-based technology that has attracted significant attention for building distributed Internet services. There have also been significant efforts tryi...
Aimilios Chourmouziadis, George Pavlou
AINA
2007
IEEE
14 years 23 days ago
DHTs over Peer Clusters for Distributed Information Retrieval
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
Odysseas Papapetrou, Wolf Siberski, Wolf-Tilo Balk...
IPPS
1998
IEEE
13 years 10 months ago
ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining Large Datasets
In this paper, we present ScalParC (Scalable Parallel Classifier), a new parallel formulation of a decision tree based classification process. Like other state-of-the-art decision...
Mahesh V. Joshi, George Karypis, Vipin Kumar