615 search results - page 67 / 123 » Design and Implementation of Parallel Algorithms for Gene-Fi... |
147
Voted
WWW
2011
ACM
14 years 9 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
117
Voted
SPAA
1996
ACM
15 years 6 months ago
1996
ACM
A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, alth...
103
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
Traditional data structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. We introduce a new synchronization paradi...
128
Voted
ISPA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This article presents the C++ library vShark which reduces the intranode communication overhead of parallel programs on clusters of SMPs. The library is built on top of m...
108
Voted
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
Researchers and practitioners in the area of parallel and distributed computing have been lacking a portable, flexible and robust distributed instrumentation system. We present th...