716 search results - page 108 / 144 » time 1997 |
PADS
1997
ACM
14 years 3 months ago
1997
ACM
In traditional optimistic distributed simulation protocols, a logical process(LP) receiving a straggler rolls back and sends out anti-messages. Receiver of an anti-message may als...
PODC
1997
ACM
14 years 3 months ago
1997
ACM
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
PODS
1997
ACM
14 years 3 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
PPOPP
1997
ACM
14 years 3 months ago
1997
ACM
Array remappings are useful to many applications on distributed memory parallel machines. They are available in High Performance Fortran, a Fortran-based data-parallel language. T...
SIGCOMM
1997
ACM
14 years 3 months ago
1997
ACM
For some time, the networking communityhas assumed that it is impossible to do IP routing lookups in software fast enough to support gigabit speeds. IP routing lookups must nd th...