5448 search results - page 65 / 1090 » Breakpoints and Time in Distributed Computations |
137
Voted
HPCN
1999
Springer
15 years 4 months ago
1999
Springer
Modern scientific computing involves organizing, moving, visualizing, and analyzing massive amounts of data from around the world, as well as employing large-scale computation. The...
110
click to vote
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
—The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of comp...
105
click to vote
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
FASE
2008
Springer
15 years 2 months ago
2008
Springer
In many distributed computing paradigms, especially sensor networks and ubiquitous computing but also grid computing and web services, programmers commonly tie their application to...
118
Voted
CONCUR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. In previous work, a probabilistic notion of time divergence for p...