5171 search results - page 527 / 1035 » Deterministic Parallel Processing |
118
click to vote
SPAA
1990
ACM
15 years 9 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
125
click to vote
EUROPAR
2006
Springer
15 years 8 months ago
2006
Springer
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
125
click to vote
ISHPC
2000
Springer
15 years 8 months ago
2000
Springer
Isosurface generation algorithms usually need a vertex-identification process since most of polygon-vertices of an isosurface are shared by several polygons. In our observation the...
173
click to vote
RTA
1995
Springer
15 years 8 months ago
1995
Springer
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
136
click to vote
PODC
1991
ACM
15 years 8 months ago
1991
ACM
d abstract) Maurice Herlihy Digital Equipment Corporation Cambridge Research Laboratory One Kendall Square Cambridge MA, 02139 Digital Equipment Corporation Cambridge Research Lab ...