Sciweavers

4670 search results - page 130 / 934
» Testing that distributions are close
Sort
View
IPPS
2003
IEEE
15 years 6 months ago
Performance of Distributed Algorithms for Topology Control in Wireless Networks
We try to close the gap between theoretical investigations of wireless network topologies and realistic wireless environments. For point-to-point communication, we examine theoret...
Stefan Rührup, Christian Schindelhauer, Klaus...
115
Voted
WOMPAT
2001
Springer
15 years 5 months ago
A Study of Implicit Data Distribution Methods for OpenMP Using the SPEC Benchmarks
In contrast to the common belief that OpenMP requires data-parallel extensions to scale well on architectures with non-uniform memory access latency, recent work has shown that it ...
Dimitrios S. Nikolopoulos, Eduard Ayguadé
101
Voted
ICDCS
1999
IEEE
15 years 5 months ago
Design Considerations for Distributed Caching on the Internet
In this paper, we describe the design and implementation of an integrated architecture for cache systems that scale to hundreds or thousands of caches with thousands to millions o...
Renu Tewari, Michael Dahlin, Harrick M. Vin, Jonat...
CP
2006
Springer
15 years 4 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
96
Voted
IPPS
1995
IEEE
15 years 4 months ago
Index translation schemes for adaptive computations on distributed memory multicomputers
Current research in parallel programming is focused on closing the gap between globally indexed algorithms and the separate address spaces of processors on distributed memory mult...
Bongki Moon, Mustafa Uysal, Joel H. Saltz