1673 search results - page 208 / 335 » Taming the Dynamics of Distributed Data |
181
click to vote
PPOPP
1999
ACM
15 years 10 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
139
click to vote
CCGRID
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper describes an implementation of parallel LU factorization. The focus is to achieve high performance on non-dedicated clusters, where the number of available computing re...
177
click to vote
FLAIRS
2004
15 years 7 months ago
2004
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
208
click to vote
ANSOFT
2002
15 years 6 months ago
2002
Web applications can be classified as hybrids between hypermedia and information systems. They have a relatively simple distributed architecture from the user viewpoint, but a comp...
161
click to vote
RCC
2000
15 years 6 months ago
2000
Large-scale distributed hypermedia systems comprise a generation of powerful tools to meet the demands of the new information globalization era. The most promising of such systems...