5448 search results - page 114 / 1090 » Breakpoints and Time in Distributed Computations |
130
click to vote
ICDCSW
2002
IEEE
15 years 8 months ago
2002
IEEE
The coordination paradigm has been used extensively as a mechanism for software composition and integration. However, relatively little work has been done for the cases where the ...
197
Voted
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
138
Voted
IRREGULAR
1995
Springer
15 years 7 months ago
1995
Springer
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
158
click to vote
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
149
click to vote
ISPA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Powerful grid and cluster computers allow efficient distributed simulation. Optimistic simulation techniques have been developed which allow for more parallelism in the l...