Sciweavers

12659 search results - page 369 / 2532
» The distributed breakout algorithms
Sort
View
ICPP
2009
IEEE
15 years 5 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...
171
Voted
IPPS
2009
IEEE
16 years 2 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...
CEC
2008
IEEE
16 years 1 months ago
New evaluation criteria for the convergence of continuous evolutionary algorithms
—The first hitting time (FHT) plays an important role in convergence evaluation for evolutionary algorithms. However, the current criteria of the FHT are mostly under a hypothesi...
Ying Lin, Jian Huang, Jun Zhang
PDP
2008
IEEE
16 years 1 months ago
Type Safe Algorithmic Skeletons
This paper addresses the issue of type safe algorithmic skeletons. From a theoretical perspective we contribute by: formally specifying a type system for algorithmic skeletons, an...
Denis Caromel, Ludovic Henrio, Mario Leyton
ICPP
2007
IEEE
16 years 1 months ago
Towards Optimized Packet Classification Algorithms for Multi-Core Network Processors
In this paper, a novel packet classification scheme optimized for multi-core network processors is proposed. The algorithm, Explicit Cuttings (ExpCuts), adopts a hierarchical spac...
Yaxuan Qi, Bo Xu, Fei He, Xin Zhou, Jianming Yu, J...