1095 search results - page 80 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
105
Voted
EUROPAR
2006
Springer
15 years 6 months ago
2006
Springer
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
117
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...
152
Voted
DAMON
2006
Springer
15 years 6 months ago
2006
Springer
The goal of this work is to gain insight into whether processingin-memory (PIM) technology can be used to accelerate the performance of link discovery algorithms, which represent ...
117
Voted
FTDCS
1995
IEEE
15 years 6 months ago
1995
IEEE
A VOD server handles various types of media such as continuous media (CM) and non-continuous media (NM). Conventional VOD server buffer scheduling algorithms like Round Robin (RR)...
106
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
In a machine that follows the dynamically trace scheduled VLIW (DTSVLIW) architecture, VLIW instructions are built dynamically through an algorithm that can be implemented in hard...