Sciweavers

1156 search results - page 94 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
ICPP
2009
IEEE
13 years 8 months ago
A Parallel Algorithm for Computing Betweenness Centrality
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
Guangming Tan, Dengbiao Tu, Ninghui Sun
SIGMOD
2007
ACM
187views Database» more  SIGMOD 2007»
14 years 10 months ago
P-ring: an efficient and robust P2P range index structure
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
Adina Crainiceanu, Prakash Linga, Ashwin Machanava...
CCGRID
2005
IEEE
14 years 3 months ago
Empirical evaluation of shared parallel execution on independently scheduled clusters
Parallel machines are typically space shared, or time shared such that only one application executes on a group of nodes at any given time. It is generally assumed that executing ...
M. Ghanesh, S. Kumar, Jaspal Subhlok
CLUSTER
2004
IEEE
13 years 10 months ago
Performance Evaluation of Shared Mesh Protection in WDM Networks
The efficient use of network capacity in shared restoration schemes strongly depends upon the path selection procedure. In this paper we propose and evaluate path selection algorit...
Chadi Assi, Ahmad Khalil, Nasir Ghani, Abdallah Sh...
IPPS
2009
IEEE
14 years 5 months ago
DMTCP: Transparent checkpointing for cluster computations and the desktop
DMTCP (Distributed MultiThreaded CheckPointing) is a transparent user-level checkpointing package for distributed applications. Checkpointing and restart is demonstrated for a wid...
Jason Ansel, Kapil Arya, Gene Cooperman