Sciweavers

12659 search results - page 351 / 2532
» The distributed breakout algorithms
Sort
View
ECOWS
2010
Springer
15 years 4 months ago
Shepherd: node monitors for fault-tolerant distributed process execution in OSIRIS
OSIRIS is a middleware for the composition and orchestration of distributed web services that follows a P2P decentralized approach to process execution, providing already some deg...
Diego Milano, Nenad Stojnic
ISITA
2010
15 years 4 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
MODELS
2009
Springer
16 years 1 months ago
An Incremental Algorithm for High-Performance Runtime Model Consistency
We present a novel technique for applying two-level runtime models to distributed systems. Our approach uses graph rewriting rules to transform a high-level source model into one o...
Christopher Wolfe, T. C. Nicholas Graham, W. Greg ...
ISPAN
1999
IEEE
15 years 11 months ago
Location Updates and Probabilistic Tracking Algorithms for Mobile Cellular Networks
In this work, we develop a novel mathematical model to analyze di erent location update protocols for mobile cellular network. Our model can capture many important features of use...
John C. S. Lui, Cedric C. F. Fong, H. W. Chan
SPAA
1994
ACM
15 years 11 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher