4744 search results - page 507 / 949 » Connected Computing |
167
click to vote
ACSC
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
181
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
197
click to vote
FOCS
2006
IEEE
16 years 28 days ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
159
click to vote
IPPS
2006
IEEE
16 years 27 days ago
2006
IEEE
Current trends in high-performance parallel computers show that fat-tree interconnection networks are one of the most popular topologies. The particular characteristics of this to...
181
click to vote
CCGRID
2005
IEEE
16 years 15 days ago
2005
IEEE
Internet data centers (IDCs) perform multi-customer hosting on a virtualized collection of resources while Grid computing generalizes distributed computing by focusing on large sc...