Sciweavers

PODC
1993
ACM
14 years 3 months ago
A Lower Bound on Wait-Free Counting
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 ...
Shlomo Moran, Gadi Taubenfeld
PODC
1993
ACM
14 years 3 months ago
On the Space Complexity of Randomized Synchronization
Faith Ellen Fich, Maurice Herlihy, Nir Shavit
PARLE
1993
14 years 3 months ago
Arithmetic for Parallel Linear Recursive Query Evaluation in Deductive Databases
: 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...
Jerome Robinson, Shutian Lin
PARLE
1993
14 years 3 months ago
On the Performance of Parallel Join Processing in Shared Nothing Database Systems
: 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...
Robert Marek, Erhard Rahm
PARLE
1993
14 years 3 months ago
A Parallel Programming Style and Its Algebra of Programs
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...
Chris Hankin, Daniel Le Métayer, David Sand...
PARLE
1993
14 years 3 months ago
From Data Flow Networks to Process Algebras
Cinzia Bernardeschi, Andrea Bondavalli, Luca Simon...
PARLE
1993
14 years 3 months ago
Parallel Programming Using Skeleton Functions
John Darlington, A. J. Field, Peter G. Harrison, P...
CONPAR
1992
14 years 3 months ago
Cost Prediction for Load Balancing: Application to Algebraic Computations
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...
Jean-Louis Roch, A. Vermeerbergen, Gilles Villard
CONPAR
1992
14 years 3 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
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...
Christian Lavault