4400 search results - page 527 / 880 » A proposal for parallel self-adjusting computation |
173
click to vote
EUROPAR
2006
Springer
15 years 11 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...
229
click to vote
GCC
2006
Springer
15 years 11 months ago
2006
Springer
An important problem that confronts data grid applications is to efficiently locate the node that stores a particular data replica. This paper proposes a Hierarchical Replica Loca...
211
click to vote
GCC
2006
Springer
15 years 11 months ago
2006
Springer
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
227
click to vote
COORDINATION
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Tuple spaces have turned out to be one of the most fundamental abstractions for coordinating communicating agents. At the same time, researchers continue to propose new v...
173
click to vote
ISHPC
2000
Springer
15 years 11 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...