Sciweavers

559 search results - page 21 / 112
» Algorithms and Data Structures for External Memory
Sort
View
PDP
2006
IEEE
15 years 3 months ago
A Distributed Query Structure to Explore Random Mappings in Parallel
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performanc...
Jan Heichler, Jorg Keller
75
Voted
ICPP
1995
IEEE
15 years 1 months ago
Data-Parallel Primitives for Spatial Operations
Data-parallel primitives for performing operations on the PM1 quadtree and the bucket PMR quadtree are presented using the scan model. Algorithms are described for building these ...
Erik G. Hoel, Hanan Samet
IDEAS
2007
IEEE
148views Database» more  IDEAS 2007»
15 years 3 months ago
Adaptive Execution of Stream Window Joins in a Limited Memory Environment
A sliding window join (SWJoin) is becoming an integral operation in every stream data management system. In some streaming applications the increasing volume of streamed data as w...
Fatima Farag, Moustafa A. Hammad
ICPP
2009
IEEE
14 years 7 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
ICNP
2007
IEEE
15 years 3 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...