Sciweavers

6897 search results - page 105 / 1380
» Parallelization of Modular Algorithms
Sort
View
IPPS
2009
IEEE
15 years 10 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...
JUCS
2010
124views more  JUCS 2010»
15 years 2 months ago
Performance Optimizations for DAA Signatures on Java enabled Platforms
: With the spreading of embedded and mobile devices, public-key cryptography has become an important feature for securing communication and protecting personal data. However, the c...
Kurt Dietrich, Franz Röck
137
Voted
HPCC
2010
Springer
15 years 4 months ago
A Generic Algorithm Template for Divide-and-Conquer in Multicore Systems
The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...
Carlos H. Gonzalez, Basilio B. Fraguela
EUROPAR
2010
Springer
15 years 5 months ago
Exceptions for Algorithmic Skeletons
Abstract. Algorithmic Skeletons offer high-level abstractions for parallel programming based on recurrent parallelism patterns. Patterns can be combined and nested into more comple...
Mario Leyton, Ludovic Henrio, José M. Pique...