946 search results - page 17 / 190 » Maximizing data locality in distributed systems |
ICPP
1999
IEEE
13 years 11 months ago
1999
IEEE
There has been much work recently on improving the locality performance of loop nests in scientific programs through the use of loop as well as data layout optimizations. However,...
BMCBI
2008
13 years 7 months ago
2008
Background: Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic d...
DPD
2010
13 years 4 months ago
2010
In distributed database systems, tables are frequently fragmented and replicated over a number of sites in order to reduce network communication costs. How to fragment, when to rep...
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
SPAA
2012
ACM
11 years 9 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...