Sciweavers

5448 search results - page 185 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 4 months ago
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
Christian Lavault, Mario Valencia-Pabon
HIPC
2009
Springer
15 years 2 months ago
Supporting load balancing for distributed data-intensive applications
In data-intensive computing, an important problem that has received relatively little attention is of transparent processing of data stored in remote data repositories. Interesting...
Leonid Glimcher, Vignesh T. Ravi, Gagan Agrawal
CCGRID
2009
IEEE
15 years 11 months ago
Towards Visualization Scalability through Time Intervals and Hierarchical Organization of Monitoring Data
Highly distributed systems such as Grids are used today to the execution of large-scale parallel applications. The behavior analysis of these applications is not trivial. The comp...
Lucas Mello Schnorr, Guillaume Huard, Philippe Oli...
IPPS
2000
IEEE
15 years 8 months ago
Replicating the Contents of a WWW Multimedia Repository to Minimize Download Time
Dynamic replication algorithms aim at allocating, migrating and deleting copies of an object over various Internet hosts, according to the access patterns exhibited online, so as ...
Thanasis Loukopoulos, Ishfaq Ahmad
PRDC
2000
IEEE
15 years 8 months ago
Enforcing synchronous system properties on top of timed systems
A synchronous system model is a simple yet powerful distributed system model that reduces the complexity of the design and implementation of dependable distributed applications. H...
Christof Fetzer