1424 search results - page 35 / 285 » Improving on Version Stamps |
IPPS
2009
IEEE
15 years 5 months ago
2009
IEEE
We present PIO-HMMER, an enhanced version of MPI-HMMER. PIO-HMMER improves on MPIHMMER’s scalability through the use of parallel I/O and a parallel file system. In addition, we...
113
click to vote
ICPP
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract—The Sparse Matrix-Vector Multiplication kernel exhibits limited potential for taking advantage of modern shared memory architectures due to its large memory bandwidth re...
APPROX
2007
Springer
15 years 5 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
110
click to vote
MFCS
2009
Springer
15 years 3 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
ASPLOS
2000
ACM
15 years 3 months ago
2000
ACM
Processors execute the full dynamic instruction stream to arrive at the final output of a program, yet there exist shorter instruction streams that produce the same overall effec...