Sciweavers

6 search results - page 1 / 2
» How to Employ Reverse Search in Distributed Single Source Sh...
Sort
View
ICPP
2009
IEEE
13 years 2 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...
HIPC
2007
Springer
13 years 11 months ago
Accelerating Large Graph Algorithms on the GPU Using CUDA
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
Pawan Harish, P. J. Narayanan
CCR
1998
140views more  CCR 1998»
13 years 4 months ago
Policy tree multicast routing: an extension to sparse mode source tree delivery
Bandwidth-sensitive multicast delivery controlled by routing criteria pertinent to the actual traffic flow is very costly in terms of router state and control overhead and it scal...
Horst Hodel
INFOCOM
2010
IEEE
13 years 3 months ago
On Channel-Discontinuity-Constraint Routing in Wireless Networks
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to ...
Swaminathan Sankararaman, Alon Efrat, Srinivasan R...