Search Sciweavers | Sciweavers

6105 search results - page 74 / 1221

» A Parallel Algorithm for Bound-Smoothing

click to vote

IPPS
2009
IEEE

118views Distributed And Parallel Com...» more IPPS 2009»

Early experiences on accelerating Dijkstra's algorithm using transactional memory

15 years 4 months ago

Download www.cslab.ece.ntua.gr

In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efﬁcacy of several parallelization techniques in a multicore architecture....

Nikos Anastopoulos, Konstantinos Nikas, Georgios I...

claim paper

Read More »

click to vote

HPCC
2010
Springer

191views Distributed And Parallel Com...» more HPCC 2010»

A Generic Algorithm Template for Divide-and-Conquer in Multicore Systems

14 years 10 months ago

Download www.des.udc.es

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

claim paper

Read More »

click to vote

EUROPAR
2010
Springer

170views Distributed And Parallel Com...» more EUROPAR 2010»

Exceptions for Algorithmic Skeletons

14 years 11 months ago

Download hal.archives-ouvertes.fr

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...

claim paper

Read More »

click to vote

PODC
2009
ACM

81views Distributed and Parallel Com...» more PODC 2009»

SINR diagrams: towards algorithmically usable SINR models of wireless networks

15 years 4 months ago

Download www.eng.tau.ac.il

Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, Da...

claim paper

Read More »