Sciweavers

1095 search results - page 89 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
IPPS
2006
IEEE
16 years 9 days ago
The GHS grid scheduling system: implementation and performance comparison
Effective task scheduling and deployment is hard to achieve in a Grid environment, where computing resources are heterogamous and shared between local and Grid users without a cen...
Ming Wu, Xian-He Sun
WSC
2008
15 years 8 months ago
Multi-resolution spatial simulation for molecular crowding
Spatial phenomena attract increasingly interest in computational biology. Molecular crowding, i.e. a dense population of macromolecules, is known to have a significant impact on t...
Matthias Jeschke, Adelinde M. Uhrmacher
IPPS
1998
IEEE
15 years 10 months ago
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
Sven Venema, Hong Shen, Francis Suraweera
FTTCS
2006
132views more  FTTCS 2006»
15 years 6 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
ICPP
2003
IEEE
15 years 11 months ago
Hardware-Assisted Design for Fast Packet Forwarding in Parallel Routers
A hardware-assisted design, dubbed cache-oriented multistage structure (COMS), is proposed for fast packet forwarding. COMS incorporates small on-chip cache memory in its constitu...
Nian-Feng Tzeng