Sciweavers

7683 search results - page 178 / 1537
» Distributed Computing with the CLAN Network
Sort
View
CN
2006
70views more  CN 2006»
15 years 3 months ago
Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue
We first study the distribution of path duration in multi-hop wireless networks. We show that as the number of hops along a path increases, the path duration distribution can be a...
Yijie Han, Richard J. La, Armand M. Makowski, Seun...
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
15 years 4 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...
131
Voted
HPDC
2000
IEEE
15 years 8 months ago
Managing Network Resources in Condor
Data-intensive applications in the Condor High Throughput Computing environment can place heavy demands on network resources for checkpointing and remote data access. We have deve...
Jim Basney, Miron Livny
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 1 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
134
Voted
EMSOFT
2010
Springer
15 years 1 months ago
Semantics-preserving implementation of synchronous specifications over dynamic TDMA distributed architectures
We propose a technique to automatically synthesize programs and schedules for hard real-time distributed (embedded) systems from synchronous data-flow models. Our technique connec...
Dumitru Potop-Butucaru, Akramul Azim, Sebastian Fi...