30 search results - page 1 / 6 » Analyzing the Scalability of Graph Algorithms on Eldorado |
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorad...
OOPSLA
2000
Springer
13 years 8 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
SEMWEB
2010
Springer
13 years 2 months ago
2010
Springer
The Semantic Web graph is growing at an incredible pace, enabling opportunities to discover new knowledge by interlinking and analyzing previously unconnected data sets. This confr...
CCS
2006
ACM
13 years 8 months ago
2006
ACM
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
ISPA
2004
Springer
13 years 10 months ago
2004
Springer
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...