5448 search results - page 128 / 1090 » Breakpoints and Time in Distributed Computations |
145
Voted
ICA3PP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper, we evaluate message-passing applications in Grid environments using domain decomposition technique. We compare two domain decomposition strategies: a balan...
137
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
147
Voted
CLUSTER
2003
IEEE
15 years 9 months ago
2003
IEEE
Debugging the performance of parallel and distributed systems remains a difficult task despite the widespread use of middleware packages for automatic distribution, communication...
133
click to vote
MOBICOM
2005
ACM
15 years 9 months ago
2005
ACM
This paper presents the first quantitative evaluation of the role of routing computations on performance when mobility is introduced to a content-based routing network. Additiona...
119
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...