Sciweavers

4155 search results - page 63 / 831
» External Memory Algorithms
Sort
View
ICPP
2009
IEEE
15 years 19 hour 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...
113
Voted
JSS
2008
91views more  JSS 2008»
15 years 2 months ago
A parametrized algorithm that implements sequential, causal, and cache memory consistencies
In this paper, we present an algorithm that can be used to implement sequential, causal, or cache consistency in distributed shared memory (DSM) systems. For this purpose it inclu...
Ernesto Jiménez, Antonio Fernández, ...
IPPS
2009
IEEE
15 years 9 months ago
Early experiences on accelerating Dijkstra's algorithm using transactional memory
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....
Nikos Anastopoulos, Konstantinos Nikas, Georgios I...
OTM
2005
Springer
15 years 7 months ago
A Detailed Investigation of Memory Requirements for Publish/Subscribe Filtering Algorithms
Various filtering algorithms for publish/subscribe systems have been proposed. One distinguishing characteristic is their internal representation of Boolean subscriptions: They ei...
Sven Bittner, Annika Hinze
FIMI
2004
279views Data Mining» more  FIMI 2004»
15 years 3 months ago
DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...