PPOPP
1993
ACM
13 years 11 months ago
1993
ACM
PODC
1993
ACM
13 years 11 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
PODC
1993
ACM
13 years 11 months ago
1993
ACM
PARLE
1993
13 years 11 months ago
1993
: An arithmetic approach, such as the Level-Finding method described in this paper for evaluating linear recursive queries in deductive database systems provides great potential fo...
PARLE
1993
13 years 11 months ago
1993
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
PARLE
1993
13 years 11 months ago
1993
Abstract. We present a set of primitive program schemes, which together with just two basic combining forms provide a suprisingly expressive parallel programming language. The prim...
PARLE
1993
13 years 11 months ago
1993
PARLE
1993
13 years 11 months ago
1993
CONPAR
1992
13 years 11 months ago
1992
A major feature of Computer Algebra, and more generally of non-numerical computations, is the dynamical and non-predictable behaviour of the executions. We then understand that st...
CONPAR
1992
13 years 11 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...