Sciweavers

735 search results - page 84 / 147
» Randomization in Parallel Stringology
Sort
View
FOCM
2011
188views more  FOCM 2011»
14 years 5 months ago
Compressive Wave Computation
This paper considers large-scale simulations of wave propagation phenomena. We argue that it is possible to accurately compute a wavefield by decomposing it onto a largely incomp...
Laurent Demanet, Gabriel Peyré
PODC
2011
ACM
14 years 5 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...
ASPLOS
2012
ACM
13 years 10 months ago
Aikido: accelerating shared data dynamic analyses
Despite a burgeoning demand for parallel programs, the tools available to developers working on shared-memory multicore processors have lagged behind. One reason for this is the l...
Marek Olszewski, Qin Zhao, David Koh, Jason Ansel,...
134
Voted
ICDCSW
2008
IEEE
15 years 8 months ago
Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing
—This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic ...
Yin Chen, Li Tang, Jun Li
COLCOM
2005
IEEE
15 years 8 months ago
Stochasticity of probabilistic systems: analysis methodologies case-study
We do a case study of two different analysis techniques for studying the stochastic behavior of a randomized system/algorithms: (i) The first approach can be broadly termed as a ...
Anwitaman Datta, Martin Hasler, Karl Aberer