Sciweavers

13987 search results - page 2662 / 2798
» The Two Guards Problem
Sort
View
FOCS
1992
IEEE
14 years 3 days ago
Fault-tolerant Wait-free Shared Objects
Wait-free implementations of shared objects tolerate the failure of processes, but not the failure of base objects from which they are implemented. We consider the problem of imple...
Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg
PODC
1994
ACM
14 years 3 days ago
Using Belief to Reason about Cache Coherence
The notion of belief has been useful in reasoning about authentication protocols. In this paper, we show how the notion of belief can be applied to reasoning about cache coherence...
Lily B. Mummert, Jeannette M. Wing, Mahadev Satyan...
SIGMOD
1994
ACM
106views Database» more  SIGMOD 1994»
14 years 3 days ago
Multi-Step Processing of Spatial Joins
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
14 years 3 days ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
NIXDORF
1992
116views Hardware» more  NIXDORF 1992»
14 years 2 days ago
Programmable Active Memories: A Performance Assessment
We present some quantitative performance measurements for the computing power of Programmable Active Memories (PAM), as introduced by [2]. Based on Field Programmable Gate Array (...
Patrice Bertin, Didier Roncin, Jean Vuillemin
« Prev « First page 2662 / 2798 Last » Next »