122 search results - page 10 / 25 » Using Disjoint Reachability for Parallelization |
PROCEDIA
2011
12 years 10 months ago
2011
A new challenge in scientific computing is to merge existing simulation models to create new higher fidelity combined (often multi-level) models. While this challenge has been a...
INFOSCALE
2007
ACM
13 years 9 months ago
2007
ACM
Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the inverted index among a set of parallel server nodes. In this paper we are interested ...
CSR
2010
Springer
14 years 6 days ago
2010
Springer
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
ICPP
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper a sufficient condition is given for minimal routing in n-dimensional (n-D) meshes with faulty nodes contained in a set of disjoint fault regions. It is based on an ...
PLDI
2012
ACM
11 years 9 months ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...