Sciweavers

1095 search results - page 8 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
ICA3PP
2010
Springer
13 years 9 months ago
Function Units Sharing between Neighbor Cores in CMP
Abstract. Program behaviors reveal that programs have different sources requirement at different phases, even at continuous clocks. It is not a reasonable way to run different prog...
Tianzhou Chen, Jianliang Ma, Hui Yuan, Jingwei Liu...
PPOPP
2012
ACM
12 years 2 months ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin
SC
1995
ACM
13 years 11 months ago
Parallelizing the Phylogeny Problem
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
Jeff A. Jones, Katherine A. Yelick
ICS
2007
Tsinghua U.
14 years 1 months ago
Tradeoff between data-, instruction-, and thread-level parallelism in stream processors
This paper explores the scalability of the Stream Processor architecture along the instruction-, data-, and thread-level parallelism dimensions. We develop detailed VLSI-cost and ...
Jung Ho Ahn, Mattan Erez, William J. Dally
IPPS
2008
IEEE
14 years 1 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri