Sciweavers

186 search results - page 25 / 38
» Distributed Shared Memory for Roaming Large Volumes
Sort
View
HPCA
1997
IEEE
15 years 3 months ago
A Performance Comparison of Hierarchical Ring- and Mesh-Connected Multiprocessor Networks
This paper compares the performance of hierarchical ring- and mesh-connected wormhole routed shared memory multiprocessor networks in a simulation study. Hierarchical rings are in...
Govindan Ravindran, Michael Stumm
EUROPAR
2004
Springer
15 years 2 months ago
Efficient Parallel Hierarchical Clustering
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
Manoranjan Dash, Simona Petrutiu, Peter Scheuerman...
HPCC
2009
Springer
15 years 3 months ago
Grid Network Dimensioning by Modeling the Deadline Constrained Bulk Data Transfers
—Grid applications need to move large amounts of data between distributed resources within deterministic time frames. In most cases it is possible to specify the volume and the d...
Kashif Munir, Pascale Vicat-Blanc Primet, Michael ...
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 4 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
IPPS
2007
IEEE
15 years 5 months ago
Software and Algorithms for Graph Queries on Multithreaded Architectures
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
Jonathan W. Berry, Bruce Hendrickson, Simon Kahan,...