5448 search results - page 417 / 1090 » Breakpoints and Time in Distributed Computations |
181
click to vote
SPAA
2005
ACM
16 years 11 days ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
137
click to vote
ISORC
2002
IEEE
15 years 11 months ago
2002
IEEE
: Although high-level real-time distributed computing objects are generally written in forms independent of execution platforms, input and output (I/O) activities involving periphe...
200
click to vote
HPDC
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper we present a scalable protocol for conducting periodic probes of network performance in a way that minimizes collisions between separate probes. The goal of the prot...
186
click to vote
ICPP
2006
IEEE
16 years 25 days ago
2006
IEEE
Modeling the performance behavior of parallel applications to predict the execution times of the applications for larger problem sizes and number of processors has been an active ...
161
click to vote
IPPS
2005
IEEE
16 years 12 days ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...